Skip to main content
Contribution to Book
Distribution Systems Reconfiguration Using the Hyper-Cube Ant Colony Optimization Algorithm
Lecture Notes in Computer Science, Swarm, Evolutionary, and Memetic Computing (2011)
  • Almoataz Youssef Abdelaziz
Abstract

This paper introduces the Ant Colony Optimization algorithm (ACO) implemented in the Hyper-Cube (HC) framework to solve the distribution network minimum loss reconfiguration problem. The ACO is a relatively new and powerful intelligence evolution method inspired from natural behavior of real ant colonies for solving optimization problems. In contrast to the usual ways of implementing ACO algorithms, the HC framework limits the pheromone values by introducing changes in the pheromone updating rules resulting in a more robust and easier to implement version of the ACO procedure. The optimization problem is formulated taking into account the operational constraints of the distribution systems. Results of numerical tests carried out on two test systems from literature are presented to show the effectiveness of the proposed approach.

Publication Date
November, 2011
Publisher
Spriger
Citation Information
Almoataz Youssef Abdelaziz. "Distribution Systems Reconfiguration Using the Hyper-Cube Ant Colony Optimization Algorithm" Lecture Notes in Computer Science, Swarm, Evolutionary, and Memetic Computing Vol. 7077 (2011)
Available at: http://works.bepress.com/almoataz_abdelaziz/32/