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

Author

Khoa, T.Q.D. ; Phan, B.T.T.

Author_Institution

Fac. of Electr. & Electron. Eng., Hochiminh Univ. of Technol.

fYear

0

fDate

0-0 0

Abstract

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

Keywords

losses; mathematics computing; optimisation; power distribution reliability; search problems; Hochiminh utility; Matlab; ant colony search algorithm; distribution network losses; feeder; genetic algorithm; meta-heuristic method; optimization problem; reliability; sectionalized switches; simulated annealing method; tie switches; Ant colony optimization; Automation; Computational modeling; Constraint optimization; Customer service; Genetics; Helium; Search methods; Simulated annealing; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Power India Conference, 2006 IEEE

Conference_Location

New Delhi

Print_ISBN

0-7803-9525-5

Type

conf

DOI

10.1109/POWERI.2006.1632571

Filename

1632571