Optimal Location and Sizing of Fault Current Limiters in Mesh Networks Using Iterative Mixed Integer Nonlinear Programming
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
In some mature power systems located in densely populated areas, an increase in demand and supply is resulting in very high short-circuit levels that are either too close to or over the safe breaker operating limits. Fault current limiters (FCLs) built with advanced materials and methods are a potent solution in this situation wherein an in-line FCL offers a very low impedance and power loss under normal operating conditions, but a high impedance and hence a lower short-circuit current during faults. From a planning perspective for complex meshed networks where faults are concurrently fed from several sources, it is important to optimally locate and size FCLs, which is a difficult mixed integer nonlinear optimization challenge as commonly used location sensitivity index methods and heuristic search techniques seem inadequate. In this paper, an iterative mixed integer nonlinear optimization method is proposed to optimally locate and size FCLs in a power system by searching the entire solution space such that costs are the least and fault currents are curtailed to levels within breakers' limits, without prior knowledge of the best locations irrespective of the size of the system. The IEEE 9-bus, IEEE 30-bus, and a real North American 395-bus transmission system were chosen to test and demonstrate the proposed method.
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