Title: Transmission network expansion planning using state-of-art nature inspired algorithms: a survey

Authors: Ashish Khandelwal; Annapurna Bhargava; Ajay Sharma; Harish Sharma

Addresses: Department of Electrical Engineering, Rajasthan Technical University, Kota, India ' Department of Electrical Engineering, Rajasthan Technical University, Kota, India ' Department of Electrical Engineering, Government Engineering College, Jhalawar, India ' Department of Computer Science Engineering, Rajasthan Technical University, Kota, India

Abstract: Transmission network expansion planning (TNEP) problem has been continuously solved for many years still the cost effective, reliable, and optimise solution is always desirable. The TNEP has been solved by various conventional and non conventional strategies. The strategy to find the solution of TNEP by classical mathematical optimisation techniques is tedious, slow and inefficient. In recent years, nature inspired algorithms (NIAs) have proven their importance to provide the solutions of the TNEP problem over classical mathematical optimisation techniques. This paper presents a review on the key contributions of the state-of-art NIAs to solve the TNEP problem. Further, the TNEP system specific significant works presented in the literature are summarised for easy understanding of the readers. The readers can get a brief description of the considered NIAs algorithms which has been applied to solve various systems of TNEP problem and they can also identify the significant NIA which is being applied for specific TNEP system.

Keywords: genetic algorithm; particle swarm optimisation; PSO; differential evolution; artificial bee colony algorithm; ABC; ant colony optimisation; ACO; harmony search algorithm; spider monkey optimisation; SMO; grey wolf optimisation; GWO.

DOI: 10.1504/IJSI.2019.097442

International Journal of Swarm Intelligence, 2019 Vol.4 No.1, pp.73 - 92

Received: 27 Sep 2018
Accepted: 04 Oct 2018
Published online: 21 Jan 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article