Distribution network planning based on shortest path
Zhi-ying Lu , Shan Gao , Li Yao
Journal of Central South University ›› 2012, Vol. 19 ›› Issue (9) : 2534 -2540.
Distribution network planning based on shortest path
In order to form an algorithm for distribution network routing, an automatic routing method of distribution network planning was proposed based on the shortest path. The problem of automatic routing was divided into two steps in the method: the first step was that the shortest paths along streets between substation and load points were found by the basic ant colony algorithm to form a preliminary radial distribution network, and the second step was that the result of the shortest path was used to initialize pheromone concentration and pheromone updating rules to generate globally optimal distribution network. Cases studies show that the proposed method is effective and can meet the planning requirements. It is verified that the proposed method has better solution and utility than planning method based on the ant colony algorithm.
distribution network planning / shortest path / ant colony algorithm / pheromone
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
BOUCHARD D E, SALAMA M M A, CHIKHANI A Y. Optimal feeder routing and optimal substation sizing and placement using guided evolutionary simulated annealing [C]// Proceedings of the Canadian Conference on Electrical and Computer Engineering. Canada, 1995: 688–691. |
| [10] |
DANIEL L C, KHAN I H, RAVICHANDRAN S. Distribution network reconfiguration for loss reduction using ant colony system algorithm [C]// Proceedings of INDICON 2005: An International Conference of IEEE India Council. Chennai, India, 2005: 619–622. |
| [11] |
RIVAS-DÁVALOS F, IRVING M R. The edge-set encoding in evolutionary algorithms for power distribution network planning problem part II: Multi-objective optimization planning [C]// Proceedings-Electronics, Robotics and Automotive Mechanics Conference. Cuernavaca, Morelos, Mexico, 2006: 251–257. |
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
/
| 〈 |
|
〉 |