Real-Time Dynamic Optimization-Based Advisory System for Electric Arc Furnace Operation
Bibliographic record
Abstract
Electric arc furnaces (EAFs) are widely applied in the steel industry for producing steel by melting scrap metal. This highly energy-intensive steelmaking process is subject to limited automation, with decisions related to input amounts and timings typically made by operators. This leads to suboptimal EAF batch operation due to complex behavior and relationships between variables that are inevitably overlooked in the decision making. In this work, we introduce an advisory system that employs a first-principles EAF model to support the operator decision making in real-time for economically optimal process operation. A dynamic optimization calculation can be triggered by the operator at any point in the batch, an action that can be repeated multiple times during the batch. The advisory system incorporates a multirate moving horizon estimator (MHE) that continually computes estimates of the process states utilizing current and past inputs and measurements. End-point constraints and potential extension of the batch duration are handled through a multitiered optimization algorithm. Case studies demonstrate a major economic improvement when the dynamic optimization-based advisory system is used. We show that the online computational load is under 5 s on average when a proposed multitiered initialization scheme is used for solving the large-scale optimal control problems.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".