A Branch-and-Cut Benders Decomposition Algorithm for Transmission Expansion Planning
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 emergence of a great number of regional planning projects worldwide has considerably increased the complexity and relevance of transmission expansion planning, prompting intensive research and investigation on the formulation and solution. In this paper, the security constrained transmission expansion planning problem is addressed by a branch-and-cut Benders decomposition (BCBD) algorithm. It is a deterministic method where the global optimal solution can be guaranteed in a finite number of iterations. Based on this implementation framework, four acceleration strategies have been employed to enhance the performance. For the validation of accuracy and efficiency, the commercial solver Cplex running on the same platform is introduced for comparison, where four types of mixed-integer linear programming algorithms are discriminated by specifying two pairs of key settings, including dynamic searching and parallel implementation. The superiority of BCBD over Cplex has been validated by case studies, where five benchmark systems ranging from 6 to 300 buses are employed. In addition, performance analysis between BCBD and classical Benders decomposition has also been carried out to distinguish the contribution of branch-and-cut framework and acceleration strategies.
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.001 | 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