Modelling and optimisation of continuous catalytic regeneration process using bee colony algorithm
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract The continuous catalytic regeneration (CCR) reforming process optimisation leads to nonlinear programming with nonlinear quality constraints such as octane number and coke concentration on the catalytic particles. A typical CCR reforming process consists of four reactors with recycle. The reaction patterns and reactors have been mathematically modelled on a base of 12‐lumped kinetics reaction network derived from literature. The bee colony optimisation (BCO) algorithm is one of the most recent and efficient swarm intelligence‐based algorithms which simulates the foraging behaviour of honey bee colonies. The performance of the BCO algorithm in the process optimisation was compared with the genetic algorithm (GA). In the present work, BCO algorithm was used for optimising the CCR reforming process. The results show that the BCO algorithm reaches a better optimum point in a lower evaluation time and higher convergence rate with respect to the GA. © 2012 Canadian Society for Chemical Engineering
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it