Learning-Assisted Variables Reduction Method for Large-Scale MILP Unit Commitment
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
The security-constrained unit commitment (SCUC) challenge is solved repeatedly several times every day, for operations in a limited time. Typical mixed-integer linear programming (MILP) formulations are intertemporal in nature and have complex and discrete solution spaces that exponentially increase with system size. Improvements in the SCUC formulation and/or solution method that yield a faster solution hold immense economic value, as less time can be spent finding the best-known solution. Most machine learning (ML) methods in the literature either provide a warm start or convert the MILP-SCUC formulation to a continuous formulation, possibly leading to sub-optimality and/or infeasibility. In this paper, we propose a novel ML-based variables reduction method that accurately determines the optimal schedule for a subset of trusted generators, shrinking the MILP-SCUC formulation and dramatically reducing the search space. ML indicators sets are created to shrink the MILP-SCUC model, leading to improvement in the solution quality. Test results on IEEE systems with 14, 118, and 300 busses, the Ontario system, and Polish systems with 2383 and 3012 busses report significant reductions in solution times in the range of 48% to 98%. This is a promising tool for system operators to solve the MILP-SCUC with a lower optimality gap in a limited-time operation, leading to economic benefits.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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