Specialised branch-and-bound algorithm for transmission network expansion planning
- 1 January 2001
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings - Generation, Transmission and Distribution
- Vol. 148 (5) , 482-488
Abstract
An algorithm is presented that finds the optimal plan long-term transmission for all cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, in which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch-and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.Keywords
This publication has 7 references indexed in Scilit:
- Branch and bound algorithm for transmission system expansion planning using a transportation modelIEE Proceedings - Generation, Transmission and Distribution, 2000
- A Computational Study of Search Strategies for Mixed Integer ProgrammingINFORMS Journal on Computing, 1999
- Comparative studies on nonconvex optimization methods for transmission network expansion planningIEEE Transactions on Power Systems, 1998
- A hierarchical decomposition approach for transmission network expansion planningIEEE Transactions on Power Systems, 1994
- Experiments in mixed-integer linear programming using pseudo-costsMathematical Programming, 1977
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- Transmission Network Estimation Using Linear ProgrammingIEEE Transactions on Power Apparatus and Systems, 1970