Large scale transmission network planning using optimization and heuristic techniques
- 1 November 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 10 (4) , 1828-1834
- https://doi.org/10.1109/59.476047
Abstract
Pursuing optimal solutions for large scale transmission network planning problems is a formidable task due to their combinatorial nature and also due to the nonconvexities involved. Successful approaches using hierarchical Benders decomposition incur in a high computational cost mainly due to the need to solve a large integer program (the investment sub-problem) for every Benders iteration. In this work the authors propose to use heuristics within the decomposition framework, therefore avoiding to solve to optimality each integer sub-problem. The global computational effort is substantially reduced, and allows coping with large problems that would be intractable using classical combinatorial techniques. Case studies with the 6 bus Garver test system and a reduced Southeastern Brazilian power network are presented and discussed.Keywords
This publication has 4 references indexed in Scilit:
- A hierarchical decomposition approach for transmission network expansion planningIEEE Transactions on Power Systems, 1994
- Linear Programming for Power-System Network Security ApplicationsIEEE Transactions on Power Apparatus and Systems, 1979
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962