Contribution of FACTS devices in power systems security using MILP‐based OPF
Bibliographic record
Abstract
Traditionally, electric system operators have dispatched generation to minimise total production costs ignoring the flexibility of the AC transmission system (ACTS). One available option to enhance power system security is to harness the flexibility of the ACTS, where a variety of flexible AC transmission system (FACTS) devices can be incorporated in the ACTS. However, utilisation of FACTS devices is limited today due to the complexities that these devices introduce to the AC optimal power flow (ACOPF) problem. The mathematical representation of the full ACOPF problem, with the added modelling of FACTS devices, is a non‐linear programming (NLP) optimisation problem, which is computationally burdensome for large‐scale systems. This study presents a method to convert this NLP problem into a mixed‐integer linear program (MILP) where a certain level of solution accuracy can be achieved for a time budget. In this regard, this study first proposes a linear AC OPF model, using which the OPF solution with the operation of FACTS devices is obtained. In addition, the loadability of the power systems is utilised to quantify the impacts of FACTS devices on improving the security of system. The OPF problem including FACTS devices based on a linearised model is tested on a 6‐bus and the IEEE 118‐bus test systems.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".