DocumentCode
2221699
Title
Distribution network structure planning based on ant algorithm
Author
Aiguo, Liu ; Wan Huilong
Author_Institution
Nanchang Univ., Nanchang, China
Volume
4
fYear
2010
fDate
20-22 Aug. 2010
Abstract
The distribution network planning is a complex combinatorial optimization problems, Based on the suboptimal solution instead of solving the optimal solution when the time complexity of the problem from the point of view, Adjust the traditional model base on it does not need Solution Accuracy, the distribution network planning problem is divided into two stages. Then using ant colony algorithm search for optimal solutions based on load forecasting, and it takes planning solution that meet the constraints. By the following examples of the results show that the ant colony algorithm has good adaptability and high computing efficiency and optimize the effect is good etc.
Keywords
combinatorial mathematics; computational complexity; load forecasting; optimisation; power distribution planning; search problems; ant colony algorithm; combinatorial optimization problems; distribution network structure planning; load forecasting; time complexity; Neodymium; Optimization; ant algorithm; distribution network; minimum network; network planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on
Conference_Location
Chengdu
ISSN
2154-7491
Print_ISBN
978-1-4244-6539-2
Type
conf
DOI
10.1109/ICACTE.2010.5579279
Filename
5579279
Link To Document