By Topic

Hybrid shuffled frog leaping algorithm and Nelder-Mead simplex search for optimal reactive power dispatch

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Khorsandi, A. ; Dept. of Electr. Eng., Amirkabir Univ. of Technol., Tehran, Iran ; Alimardani, A. ; Vahidi, B. ; Hosseinian, S.H.

The optimal reactive power dispatch (ORPD) problem is a non-linear mixed-variable optimisation problem. This study employs a new evolutionary algorithm that expands the original shuffled frog leaping algorithm (SFLA) to solve this problem. In order to fully exploit the promising solution region, a local search algorithm known as Nelder-Mead (NM) algorithm is integrated with SFLA. The resultant NM-SFLA is very efficient in solving ORPD problem. The most important benefit of the proposed method is higher speed of convergence to a better solution. The proposed method is applied to ORPD problem on IEEE 30-bus, IEEE 57-bus and IEEE 118-bus power systems and compared with four versions of particle swarm optimisation algorithm, two versions of differential evolutionary algorithm and SFLA. The optimal setting of control variables including generator voltages, transformer taps and shunt VAR compensation devices for active power loss minimisation in a transmission system is determined while all the constraints are satisfied. The simulation results show the efficiency of the proposed method.

Published in:

Generation, Transmission & Distribution, IET  (Volume:5 ,  Issue: 2 )