Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning
- 1 January 2007
- journal article
- Published by Institution of Engineering and Technology (IET) in IET Generation, Transmission & Distribution
- Vol. 1 (2), 318-323
- https://doi.org/10.1049/iet-gtd:20060239
Abstract
A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.Keywords
This publication has 8 references indexed in Scilit:
- A new strategy for transmission expansion in competitive electricity marketsIEEE Transactions on Power Systems, 2003
- Test systems and mathematical models for transmission network expansion planningIEE Proceedings - Generation, Transmission and Distribution, 2002
- A greedy randomized adaptive search procedure for transmission expansion planningIEEE Transactions on Power Systems, 2001
- A new Benders decomposition approach to solve power transmission network design problemsIEEE Transactions on Power Systems, 2001
- Specialised branch-and-bound algorithm for transmission network expansion planningIEE Proceedings - Generation, Transmission and Distribution, 2001
- Transmission network expansion planning under an improved genetic algorithmIEEE Transactions on Power Systems, 2000
- A hierarchical decomposition approach for transmission network expansion planningIEEE Transactions on Power Systems, 1994
- Transmission Network Planning Using Linear ProgrammingIEEE Transactions on Power Apparatus and Systems, 1985