Ant colony search-based loss minimum for reconfiguration of distribution systems

This paper presents one of applications of the ant colony search method to reduce the minimum losses of distribution network. The configuration of distribution network is defined by the tie switches and sectionalized switches. The configuration optimization problem of distribution network is a combination optimization with a large search space involved the operational constraints of the distribution. The results of the ACS are compared to the ones obtained from other heuristic methods (heuristic, simulated annealing, genetic). All of the algorithms are programmed on Matlab applied to the typical distribution system 3 feeders, 17 buses, 16 switches and one feeder of Hochiminh Utility, 55 buses, 13 switches. This ant colony search algorithms obtains computation time faster and more reliability than other ones