A multi-agent Immune-based Co-Taboo search algorithm for distribution network reconfiguration

A multi-agent Immune-based Co-Taboo Search Algorithm is proposed to reconfigure distribution network with loss minimization. When the population is initialized, the approach of co-taboo search is applied to seek out initial solutions, and the radial structure constraint ensures initial solutions to be feasibility. So the avoiding of unfeasible solutions greatly reduces the search space, and the search efficiency is also greatly improved. Furthermore, the antibody population is updated continuously by the immune algorithm, which can maintain the diversity of the population and prevent the optimization from prematurity. In the process of searching for the best solution, all agents were changed dynamically in order to get the best solution as quickly as possible. The calculation results of 33-bus distribution system show that the proposed algorithm has a highly computational efficiency.