Fast Heuristics for Transmission-Line Switching
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 optimal transmission switching (OTS) problem, a mixed-integer program (MIP), has been proposed as a way to choose lines to take out of service to reduce generation costs. One impediment to the use of OTS in practice is the very long computing time to solve it. This paper proposes two heuristics which rely on a line-ranking parameter that is based on the optimal solution to the ordinary dc optimal power flow problem, a linear program (LP). One heuristic solves a sequence of LPs, removing one line at a time, and the other heuristic solves a sequence of MIPs, removing one line at a time, and each MIP has far fewer binary variables (for switching the lines out of service) than the original MIP. The proposed heuristics are tested on 118-bus and 662-bus systems, and compared with the most common previous heuristic in the literature, which solves a sequence of MIPs, removing one line at a time, with each MIP having all binary variables, i.e., one for each line. Both heuristics are much faster than the previous heuristic from the literature. In almost all cases tested, both proposed heuristics find cost reductions that are approximately as large as the previous heuristic. The computing time reductions are so great that OTS may now be practical with respect to the computing time issue.
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