ACO Algorithm Implementation in Radial Distributed Network Planning
This paper presents a new approach for radial distributed network planning with using ACO algorithm. Ant colony optimization algorithm (ACO) is one of the best methods for optimization in difficult discrete problems. The new algorithm determines the optimal configuration of network and voltage level...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Najafabad Branch, Islamic Azad University
2010-10-01
|
| Series: | Journal of Intelligent Procedures in Electrical Technology |
| Subjects: | |
| Online Access: | http://jipet.iaun.ac.ir/pdf_4464_fd0454d58051865c6ab594b804060042.html |
| Summary: | This paper presents a new approach for radial distributed network planning with using ACO algorithm. Ant colony optimization algorithm (ACO) is one of the best methods for optimization in difficult discrete problems. The new algorithm determines the optimal configuration of network and voltage level of each section of the feeders and calculates the optimum rating of the transformers and the size of each section of the feeders. This algorithm applied to a real 23-feeder radial test network of Gilan Regional Electricity Company inIran. The results validate the superiority of new algorithm in comparison with particle swarm optimization (PSO) and supplying area algorithm. The important characteristics of this algorithm in this paper are its high speed in solving problems for instance 240 times of supplying area algorithm time and 18 times of PSO algorithm time and 10% decreasing of final cost because of considering the transformers rating as an another searching space variable. |
|---|---|
| ISSN: | 2322-3871 2345-5594 |