Robust Multi‐Objective Genetic Algorithm (RMOGA) with Online Approximation under Interval Uncertainty
Bibliographic record
Abstract
The optimization of chemical processes is usually multi-objective, constrained and has uncertainty in the process inputs, variables and/or parameters. This uncertainty can produce undesirable variations in the process outputs, i.e., in the objective and/or constraint functions. The traditional multi-objective genetic algorithm (MOGA) assumes that all inputs are deterministic. However, optimal solutions obtained from MOGA can be sensitive to input uncertainty and, consequently, the solutions may be degraded. The goal in robust MOGA (RMOGA) is to obtain optimal solutions that are also relatively insensitive to uncertainty. In this chapter, two approaches to RMOGA, nested and sequential, are presented. In both approaches, a measure of robustness is considered using the worst-case analysis, which assumes that the uncertainty in inputs is expressed by an interval with known lower and upper bounds. The main difference between the nested and sequential RMOGA is that, in the nested approach, an upper level problem identifies and improves candidate points, while a lower-level subproblem evaluates robustness of the candidate points; on the other hand, in the sequential approach, a multi-objective optimization problem is first solved to obtain optimal solutions, and then the robustness of each optimal solution is evaluated. Both nested and sequential RMOGA approaches can be computationally costly. To reduce the computational cost, an online approximation assisted method is used in both approaches. The purpose of the approximation is to replace a computationally intensive simulation for objective and/or constraint functions with a computationally inexpensive surrogate model; the accuracy of the approximation is adaptively improved as the solutions are reached. Two examples, one numerical and the other based on petroleum refinery, are used to demonstrate and compare the applicability of the two RMOGA approaches.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".