RECORD
The Allocation of a Variable Series Reactor Considering AC Constraints and Contingencies
Optimization and Control · Submitted 30 Dec 2017
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Numerical case studies based on IEEE 118-bus demonstrate the high performance of the proposed approach.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
The Variable Series Reactors (VSRs) can efficiently control the power flow through the adjustment of the line reactance. When they are appropriately allocated in the power network, the transmission congestion and generation cost can be reduced. This paper proposes a planning model to optimally allocate VSRs considering AC constraints and multi-scenarios including base case and contingencies. The planning model is originally a non-convex large scale mixed integer nonlinear program (MINLP), which is generally intractable. The proposed Benders approach decomposes the MINLP model into a mixed integer linear program (MILP) master problem and a number of nonlinear subproblems. Numerical case studies based on IEEE 118-bus demonstrate the high performance of the proposed approach.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | The Variable Series Reactors (VSRs) can efficiently control the power flow through the adjustment of the line reactance. | background 1.00 | 0.09 | 0.03 | asserted 0.94 |
| s1 | When they are appropriately allocated in the power network, the transmission congestion and generation cost can be reduced. | background 1.00 | 0.08 | 0.08 | asserted 0.58 |
| s2 | This paper proposes a planning model to optimally allocate VSRs considering AC constraints and multi-scenarios including base case and contingencies. | contribution 0.99 | 0.92 | 0.21 | asserted 1.00 |
| s3 | The planning model is originally a non-convex large scale mixed integer nonlinear program (MINLP), which is generally intractable. | background 0.71 | 0.36 | 0.03 | asserted 1.00 |
| s4 | The proposed Benders approach decomposes the MINLP model into a mixed integer linear program (MILP) master problem and a number of nonlinear subproblems. | method 0.98 | 0.90 | 0.08 | asserted 1.00 |
| s5 | Numerical case studies based on IEEE 118-bus demonstrate the high performance of the proposed approach. | result 0.97 | 0.93 | 0.49 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
The Variable Series Reactors (VSRs) can efficiently control the power flow through the adjustment of the line reactance. When they are appropriately allocated in the power network, the transmission congestion and generation cost can be reduced. This paper proposes a planning model to optimally allocate VSRs considering AC constraints and multi-scenarios including base case and contingencies. The planning model is originally a non-convex large scale mixed integer nonlinear program (MINLP), which is generally intractable. The proposed Benders approach decomposes the MINLP model into a mixed integer linear program (MILP) master problem and a number of nonlinear subproblems. Numerical case studies based on IEEE 118-bus demonstrate the high performance of the proposed approach.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.