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.

PDF
Journal of Central South University ›› 2012, Vol. 19 ›› Issue (9) : 2534 -2540. DOI: 10.1007/s11771-012-1307-8
Article

Distribution network planning based on shortest path

Author information +
History +
PDF

Abstract

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.

Keywords

distribution network planning / shortest path / ant colony algorithm / pheromone

Cite this article

Download citation ▾
Zhi-ying Lu, Shan Gao, Li Yao. Distribution network planning based on shortest path. Journal of Central South University, 2012, 19(9): 2534-2540 DOI:10.1007/s11771-012-1307-8

登录浏览全文

4963

注册一个新账户 忘记密码

References

[1]

WangS.-y., WangC.-shan.. Urban MV distribution network planning based on multi-objective model [J]. Electric Power, 2006, 39(11): 46-50

[2]

WangT.-w., XuW.-g., GuanLin.. Methods for optimal programming of the electric power grid structure [J]. Relay, 2005, 33(21): 58-61

[3]

QuintanaV. H., TenrazH. K., HipelK. W.. Two-stage power system distribution planning algorithm [J]. IEE Proceedings-Generation, Transmission and Distribution, 1993, 140(1): 17-29

[4]

NiQ.-l., HuangM.-xiang.. Power distribution network planning using branch exchange based simulated annealing algorithm [J]. Proceedings of the EPSA, 2000, 12(4): 31-35

[5]

MíguezE., CidrásJ., Díaz-DoradoE., García-DornelasJ. L.. Improved branch-exchange algorithm for large-scale distribution network planning [J]. IEEE Transactions on Power System, 2002, 17(4): 931-936

[6]

MirandaV., RanitoJ. V., ProcencaL. M.. Genetic algorithms in optimal multistage distribution network planning [J]. IEEE Trans on Power Systems, 1994, 9(4): 1927-1933

[7]

HsiaoY. T., ChienC. Y.. Multiobjective optimal feeder reconfiguration [J]. IEE Proceedings-Generation, Transmission and Distribution, 2001, 148(4): 333-336

[8]

NaraK., HayashiY., YamafujiY., TanakaH., HagiharaJ., MutoS., TakaoaS., SakuraokaM.. A Tabu search algorithm for determining distribution tie lines [C]. International Conference on Intelligent Systems Applications to Power Systems Proceedings, 1996New YorkIEEE266-270

[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]

LuJie.The Research of urban medium-voltage distribution network planning based on the ant colony algorithm [D], 2008TianjinTianjin University

[13]

HaffnerS., PereiraL. F. A., PereiraL. A., BarretoL. S.. Multistage model for distribution expansion planning with distributed generation-Part II: Numerical results [J]. IEEE Transactions on Power Delivery, 2008, 23(2): 915-923

[14]

NavarroA., RudnickH.. Large-scale distribution planning-Part II: Macro-optimization with Voronoi’s diagram and Tabu search [J]. IEEE Transactions on Power System, 2009, 24(2): 752-758

[15]

BemardonD. P., GarciaV. J., FerreiraA. S. Q., CanhaL. N.. Multicriteria distribution network reconfiguration considering subtransmission analysis [J]. IEEE Transactions on Power Delivery, 2010, 25(4): 2684-2691

[16]

CossentR., GómezT., OlmosL., MateoC., FríasP.. Assessing the impact of distributed generation on distribution network costs [C]. 6th International Conference on the European Energy Market, 2009Leuven, BelgiumIEEE1-8

[17]

CarlosM. D., TomásG. S. R., ÁlvaroS. M., Jesús PascualP. G., AntonioC. M.. A reference network model for large-scale distribution planning with automatic street map generation [J]. IEEE Transactions on Power Systems, 2011, 26(1): 190-197

[18]

DorigoM., ManiezzoV., ColorniA.. Ant system: Optimization by a colony of cooperating agents [J]. IEEE Transactions on System, Man, and Cybernetics, Part B: Cybernetics, 1996, 26(1): 29-41

[19]

TanG.-z., HeH., SlomanA.. Ant colony system algorithm for real-time globally optimal path planning of mobile robots [J]. Acta Automatica Sinica, 2007, 33(3): 279-285

AI Summary AI Mindmap
PDF

137

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/