Metaheuristics and Transmission Expansion Planning: A Comparative Case Study

Abstract

Transmission expansion planning (TEP), the determination of new transmission lines to be added to an existing power network, is a key element in power system planning. Using classical optimization to define the most suitable reinforcements is the most desirable alternative. However, the extent of the under-study problems is growing, because of the uncertainties introduced by renewable generation or electric vehicles (EVs) and the larger sizes under consideration given the trends for higher renewable shares and stronger market integration. This means that classical optimization, even using efficient techniques, such as stochastic decomposition, can have issues when solving large-sized problems. This is compounded by the fact that, in many cases, it is necessary to solve a large number of instances of a problem in order to incorporate further considerations. Thus, it can be interesting to resort to metaheuristics, which can offer quick solutions at the expense of an optimality guarantee. Metaheuristics can even be combined with classical optimization to try to extract the best of both worlds. There is a vast literature that tests individual metaheuristics on specific case studies, but wide comparisons are missing. In this paper, a genetic algorithm (GA), orthogonal crossover based differential evolution (OXDE), grey wolf optimizer (GWO), moth–flame optimization (MFO), exchange market algorithm (EMA), sine cosine algorithm (SCA) optimization and imperialistic competitive algorithm (ICA) are tested and compared. The algorithms are applied to the standard test systems of IEEE 24, and 118 buses. Results indicate that, although all metaheuristics are effective, they have diverging profiles in terms of computational time and finding optimal plans for TEP.