Multi-objective optimal reconfiguration of distribution networks using a novel meta-heuristic algorithm

Negar Dehghany, Rasool Asghari


Reconfiguration strategies are used to reduce power losses and increase the reliability of the distribution systems. Since the optimal reconfiguration problem is a multi-objective optimization problem with non-convex functions and constraints, meta-heuristic algorithms are the most suitable choice for the problem-solving approach. One of the new meta-heuristic algorithms that exhibits excellent performance in solving multi-objective problems is the wild mice colony (WMC) algorithm, which is implemented based on aggressive and mating strategies of wild mice. In this paper, the distribution network reconfiguration problem is solved to reduce power losses, improve reliability, and increase the voltage profile of network buses using the WMC algorithm. In addition, the obtained results are compared with conventional multi-objective algorithms. The optimal reconfiguration problem is applied to the IEEE 33-bus and 69-bus test systems. The comparative study confirms the superior performance of the proposed algorithm in terms of convergence speed, execution time, and the final solution.


Distribution networks; Meta-heuristic algorithms; Multi-objective optimization problem; Optimal reconfiguration; Wild mice colony optimization algorithm

Full Text:



Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578

This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).