Multiobjective Optimization of an Industrial Styrene Reactor Using the Dual Population Evolutionary Algorithm (DPEA)
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
In the last few years, multiobjective evolutionary algorithms (MOEAs) have gained significant interest as a reliable option to optimize problems with conflicting objectives in science and engineering. These algorithms generate an optimal set of trade-off solutions referred to as the Pareto domain. In this investigation, a MOEA was used to optimize simultaneously conflicting design variables of an industrial styrene reactor. The dual population evolutionary algorithm (DPEA) was implemented to optimize the productivity, yield, and selectivity of styrene. To evaluate the robustness and versatility of the algorithm, two and three objective optimization case studies were conducted for three different configurations of the reactor: adiabatic, steam-injected, and isothermal.Results indicated that DPEA is a robust optimization strategy to generate a well-defined Pareto domain with a wide range of solutions. In addition, the Pareto-optimal solutions of the steam-injected configuration were superior to the adiabatic reactor and to a portion of the isothermal configuration. The optimal operating conditions corresponding to the Pareto domains were also slightly better in terms of profit when compared with previously published studies. The Pareto domains were then ranked using the Net Flow Method (NFM), a ranking algorithm that incorporates the knowledge and preferences of an expert into the optimization routine.
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.001 |
| 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