A mixed integer disjunctive model for transmission network expansion
- 1 January 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 16 (3), 560-565
- https://doi.org/10.1109/59.932295
Abstract
The classical nonlinear mixed integer formulation of the transmission network expansion problem cannot guarantee finding the optimal solution due to its nonconvex nature. We propose an alternative mixed integer linear disjunctive formulation, which has better conditioning properties than the standard disjunctive model. The mixed integer program is solved by a commercial branch and bound code, where an upper bound provided by a heuristic solution is used to reduce the tree search. The heuristic solution is obtained using a GRASP metaheuristic, capable of finding sub-optimal solutions with an affordable computing effort. Combining the upper bound given by the heuristic and the mixed integer disjunctive model, optimality can be proven for several hard problem instances.Keywords
This publication has 5 references indexed in Scilit:
- Transmission system expansion planning by simulated annealingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Reactive Grasp for Transmission Network Expansion PlanningPublished by Springer Science and Business Media LLC ,2002
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- A hierarchical decomposition approach for transmission network expansion planningIEEE Transactions on Power Systems, 1994
- A Decomposition Approach to Automated Generation/Transmission Expansion PlanningIEEE Power Engineering Review, 1985