A Comparative Study of Metaheuristic Methods for Transmission Network Expansion Planning

A Comparative Study of Metaheuristic Methods for Transmission Network Expansion Planning

Ashu R. Verma (TERI University, India), P. K. Bijwe (IIT, India) and B. Panigrahi (IIT, India)
Copyright: © 2010 |Pages: 21
DOI: 10.4018/jaec.2010100104
OnDemand PDF Download:
No Current Special Offers


Transmission network expansion planning is a very complex and computationally demanding problem due to the discrete nature of the optimization variables. This complexity has increased even more in a restructured deregulated environment. In this regard, there is a need for development of more rigorous optimization techniques. This paper presents a comparative analysis of three metaheuristic algorithms known as Bacteria foraging (BF), Genetic algorithm (GA), and Particle swarm optimization (PSO) for transmission network expansion planning with and without security constraints. The DC power flow based model is used for analysis and results for IEEE 24 bus system are obtained with the above three metaheuristic drawing a comparison of their performance characteristic.
Article Preview


Transmission network expansion planning (TNEP) is an important part of the power system planning. It deals in finding the set of transmission lines to be constructed among the available candidate lines for the transmission expansion, such that the cost of the expansion plan is minimum and there are no overloads during the planning horizon.

The complexity of the problem has increased even more due to restructuring of the power systems. The various factors affecting the TNEP are future load, generation scenarios, right of way constraints, costs and capacities of lines etc. The transmission network expansion planning is of two types: static and dynamic. Static TNEP is done in a single planning horizon, whereas dynamic TNEP requires stage wise addition of lines over the planning horizon with varying stage wise loads. Basically, TNEP is dynamic in nature; however, most of the research work in the literature is for a simple static problem to keep the mathematical formulation simple.

This paper also considers the static TNEP model only. However, the algorithms can be extended for a multistage transmission network expansion planning. DC load flow model is used for simplicity.

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 13: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing