Distribution Systems Reconfiguration Using Ant Colony Optimization and Harmony Search Algorithms

Abstract One objective of the feeder reconfiguration problem in distribution systems is to minimize the distribution network total power loss for a specific load. For this problem, mathematical modeling is a non-linear mixed integer problem that is generally hard to solve. This article proposes two heuristic algorithms inspired from natural phenomena to solve the network reconfiguration problem: (1) “real ant-behavior-inspired” ant colony optimization implemented in the hyper cube framework and (2) the “musician behavior-inspired” harmony search algorithm. The optimization problem is formulated taking into account the operational constraints of distribution systems. A 32-bus system and a 118-bus distribution were selected for optimizing the configuration to minimize the losses. The results of reconfiguration using the proposed algorithms show that both of them yield the optimum configuration with minimum power loss for each case study; however, the harmony search required shorter simulation time but more practice of the iterative process than the hyper cube–ant colony optimization. Implementing the ant colony optimization in the hyper cube framework resulted in a more robust and easier handling of pheromone trails than the standard ant colony optimization.

[1]  D. Shirmohammadi,et al.  A compensation-based power flow method for weakly meshed distribution and transmission networks , 1988 .

[2]  J. J. Grainger,et al.  Distribution feeder reconfiguration for loss reduction , 1988 .

[3]  Dariush Shirmohammadi,et al.  Reconfiguration of Electric Distribution Networks for Resistive Line Loses Reduction , 1989, IEEE Power Engineering Review.

[4]  D. Shirmohammadi,et al.  Reconfiguration of electric distribution networks for resistive line losses reduction , 1989 .

[5]  Felix F. Wu,et al.  Network Reconfiguration in Distribution Systems for Loss Reduction and Load Balancing , 1989, IEEE Power Engineering Review.

[6]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[7]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[8]  J. R. Shin,et al.  An efficient simulated annealing algorithm for network reconfiguration in large-scale distribution systems , 2002 .

[9]  Jae-Chul Kim,et al.  Application of simulated annealing and tabu search for loss minimization in distribution systems , 2004 .

[10]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[11]  Koichi Nara,et al.  Method for minimum‐loss reconfiguration of distribution system by tabu search , 2005 .

[12]  M. Fesanghary,et al.  An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..

[13]  Zhengcai Fu,et al.  An improved TS algorithm for loss-minimum reconfiguration in large-scale distribution systems , 2007 .

[14]  B. Raison,et al.  Radial Network Reconfiguration Using Genetic Algorithm Based on the Matroid Theory , 2008, IEEE Transactions on Power Systems.

[15]  S.H. Hosseinian,et al.  Application of Ant Colony System algorithm to distribution networks reconfiguration for loss reduction , 2008, 2008 11th International Conference on Optimization of Electrical and Electronic Equipment.

[16]  M.A.L. Badr,et al.  Distribution Systems Reconfiguration using a modified particle swarm optimization algorithm , 2009 .

[17]  M.A.L. Badr,et al.  Distribution system reconfiguration using a modified Tabu Search algorithm , 2010 .

[18]  Almoataz Y. Abdelaziz,et al.  Reconfiguration of Distribution Systems for Loss Reduction Using the Harmony Search Algorithm , 2011, SEMCCO.

[19]  Almoataz Y. Abdelaziz,et al.  Distribution Systems Reconfiguration Using the Hyper-Cube Ant Colony Optimization Algorithm , 2011, SEMCCO.