A Neural Combinatorial Optimization Algorithm for Unit Commitment in AC Power Systems
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 unit commitment (UC) problem in AC power systems can be formulated as a mixed-integer nonlinear optimization program with a running time that scales exponentially with the number of generators. This paper addresses the time complexity of solving the UC problem by developing a deep learning framework that determines the generator on/off states using a transformer deep neural network (DNN), and subsequently solves an AC optimal power flow (OPF) problem to obtain the generator setpoints. To obtain a feasible binary solution, we apply a neural combinatorial optimization algorithm to train the DNN, while penalizing infeasible power flow solutions. Also, to guarantee the optimality of the generator setpoints, we transform the AC OPF problem into a semidefinite program (SDP). The proposed algorithm can obtain a near-optimal solution to the UC problem in polynomial running time. Simulations are performed for two IEEE test systems. When compared with three existing UC algorithms in the literature, our proposed algorithm can obtain a solution with at least 2.14% lower operation cost and lower running time. When compared with the MOSEK solver, our algorithm can obtain a solution with at most 1.97% greater operation cost, but with a significantly lower running time.
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.000 |
| 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