By Topic

Ant Colony Optimization-Based Approach to Optimal Reactive Power Dispatch: A Comparison of Various Ant Systems

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 $13
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

2 Author(s)
Abbasy, A. ; Electr. Eng. Dept., Sharif Univ. of Technol., Tehran ; Hosseini, S.H.

The optimal reactive power dispatch (ORPD) problem is formulated as a combinatorial optimization problem involving nonlinear objective function with multiple local minima. In this paper, as a new approach, different ant colony optimization (ACO) algorithms are applied to the reactive power dispatch problem. Ant system (AS), the firstly introduced ant colony optimization algorithm, and its direct successors, elitist ant system (EAS), rank-based ant system (ASrank) and max-min ant system (MMAS), are employed to solve the reactive power dispatch problem. To analyze the efficiency and effectiveness of these modern search algorithms, the proposed methods are applied to the IEEE 30-bus system and the results are compared to those of conventional mathematical methods, genetic algorithm, evolutionary programming, and particle swarm optimization.

Published in:

Power Engineering Society Conference and Exposition in Africa, 2007. PowerAfrica '07. IEEE

Date of Conference:

16-20 July 2007