Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning
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.
How to cite this document
Romero, R. et al. Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning. Iet Generation Transmission & Distribution. Hertford: Institution Engineering Technology-iet, v. 1, n. 2, p. 318-323, 2007. Available at: <http://hdl.handle.net/11449/33793>.
Language
English
Collections
