Transmission Expansion by Branch-and-Bound Integer Programming with Optimal Cost - Capacity Curves
- 1 September 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Apparatus and Systems
- Vol. PAS-93 (5) , 1390-1400
- https://doi.org/10.1109/tpas.1974.293869
Abstract
A new method is proposed in this paper to solve a single-stage expansion problem for a transmission network, given future generation and load patterns, and alternative types of lines available, subject to overload, reliability and right-of-way constraints. The problem is formulated as a series of zero-one integer programs which are solved by an efficient branch-and-bound algorithm. Complexity is reduced by the concepts of optimal cost-capacity curves and screening algorithms. A sample study is shown and the method is implemented in a computer program.Keywords
This publication has 8 references indexed in Scilit:
- Statistical power transmission network designIEEE Transactions on Circuits and Systems, 1982
- Transmission Planning Using Discrete Dynamic OptimizingIEEE Transactions on Power Apparatus and Systems, 1973
- Iterative Linear AC Power Flow Solution for Fast Approximate Outage StudiesIEEE Transactions on Power Apparatus and Systems, 1972
- Transmission Network Estimation Using Linear ProgrammingIEEE Transactions on Power Apparatus and Systems, 1970
- Power System Long-Term Planning in the Presence of UncertaintyIEEE Transactions on Power Apparatus and Systems, 1970
- A Mathematical Optimization Technique for the Expansion of Electric Power Transmission SystemsIEEE Transactions on Power Apparatus and Systems, 1970
- Power System Static-State Estimation, Part II: Approximate ModelIEEE Transactions on Power Apparatus and Systems, 1970
- Direct solutions of sparse network equations by optimally ordered triangular factorizationProceedings of the IEEE, 1967