Transmission Expansion Planning (TEP) is a complex optimization problem that has the purpose of determining how the transmission capacity of a network should be enlarged, satisfying the increasing demand. This problem has combinatorial nature and different alternative plans can be designed so that many algorithms can converge towards local optima. This feature drives the development of tools that combine high robustness and low computational effort. This paper presents a comparative analysis and a detailed review of the main Constructive Heuristic Algorithms (CHA) used in the TEP problem. This kind of tools combine low computational effort with reasonable quality solutions and can be associated with other tools to use in a subsequent step in order to improve the final solution. CHAs proved to be very effective and showed good performance as the test results will illustrate.
Transmission expansion planning has become a complicated procedure more than any time it was with the rapid growth of the transmission networks, therefore, this work summarizes the works had been done before regarding this topic. This review classifies the existing works from many sides such as, solution methods, planning horizon and from the modeling prospective in order to facilitate the other researcher’s works in this hot area to get a feasible algorithm academically and commercially. The drawbacks of the TEP procedure and some recommendations are also included.
Capricious Cables: Understanding the Limitations and Context of Transmission Expansion Planning Models
