Process modeling and optimization of industrial ethylene oxide reactor by integrating support vector regression and genetic algorithm
Bibliographic record
Abstract
Abstract This article presents an artificial intelligence‐based process modeling and optimization strategies, namely support vector regression–genetic algorithm (SVR‐GA) for modeling and optimization of catalytic industrial ethylene oxide (EO) reactor. In the SVR‐GA approach, an SVR model is constructed for correlating process data comprising values of operating and performance variables. Next, model inputs describing process operating variables are optimized using Genetic Algorithm (GAs) with a view to maximize the process performance. The GA possesses certain unique advantages over the commonly used gradient‐based deterministic optimization algorithms The SVR‐GA is a new strategy for chemical process modeling and optimization. The major advantage of the strategies is that modeling and optimization can be conducted exclusively from the historic process data wherein the detailed knowledge of process phenomenology (reaction mechanism, kinetics, etc.) is not required. Using SVR‐GA strategy, a number of sets of optimized operating conditions leading to maximized EO production and catalyst selectivity were obtained. The optimized solutions when verified in actual plant resulted in a significant improvement in the EO production rate and catalyst selectivity.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".