Title: Minimal constraint based cuckoo search algorithm for removing transmission congestion and rescheduling the generator units

Authors: N. Chidambararaj; K. Chitra

Addresses: Faculty of Electrical Engineering, Sathyabama University, Rajiv Gandhi Salai, OMR, Chennai – 600119, India ' Department of Electronics and Communication Engineering, School of Electronics Engineering, VIT University– Chennai Campus, Chennai– 600127, India

Abstract: In the paper, a minimal constraint based cuckoo search (CS) algorithm is proposed for solving transmission congestion problem by considering both increase and decrease in generation power. Thus, the proposed algorithm is used to optimise the real power changes of generator while transmission congestion occurred. Then, the power loss, generator sensitivity factor and congestion management cost of the system is evaluated by the proposed algorithm according to the transmission congestion. The proposed method is implemented in MATLAB working platform and their congestion management performance is analysed. The performance of the proposed method is compared with the other existing methods such as fuzzy adaptive bacterial foraging (FABF), simple bacterial foraging (SBF), particle swarm optimisation (PSO), and artificial neural network (ANN)-CS respectively. The congestion management cost is reduced up to 26.169%. Through the analysis of comparison, it is shown that the proposed technique is better and outperforms other existing techniques in terms of congestion management measures.

Keywords: minimal constraint based CS algorithm; particle swarm optimisation; PSO; artificial neural network; ANN; real power; congestion management; power loss and congestion management cost.

DOI: 10.1504/IJBIDM.2019.096796

International Journal of Business Intelligence and Data Mining, 2019 Vol.14 No.1/2, pp.218 - 237

Received: 07 Dec 2016
Accepted: 11 Mar 2017
Published online: 11 Dec 2018 *

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