HOME JOURNALS CONTACT

Information Technology Journal

Year: 2013 | Volume: 12 | Issue: 22 | Page No.: 6852-6858
DOI: 10.3923/itj.2013.6852.6858
Path Planning for Urgent Repair of Transmission Line Based on Diamond-boundary Limit Algorithm
Zhou Jing, Li Cunbin and Ma Weiqing

Abstract: In this study, an improved diamond-boundary limit algorithm is proposed for optimizing the resource scheduling of transmission line and path planning. This algorithm is based on Dijkstra algorithm, establishes four boundary conditions in term of ellipse-circumscribed diamond boundary, makes a directional search for nodes only inside the diamond so that reduces nodes in the search process. This algorithm transfers the nonlinear boundary limit into linear one so to simplify the operation and raise the efficiency. By analyzing the shortest path and the consuming time of different limit algorithm in an example, it is proved that this algorithm is validity and practicability.

Fulltext PDF

How to cite this article
Zhou Jing, Li Cunbin and Ma Weiqing, 2013. Path Planning for Urgent Repair of Transmission Line Based on Diamond-boundary Limit Algorithm. Information Technology Journal, 12: 6852-6858.

Keywords: Transmission line, urgent repair, resource scheduling, diamond boundary algorithm and shortest path

REFERENCES
  • Hu, G.Q. and R.M. He, 2007. Optimal scheduling of hydroelectric power plant based on self-adaptive ant colony algorithm. Electric Power, 40: 48-50.
    Direct Link    

  • Tang, W.W., X.D. Shi and D.K. Zhu, 2000. The calculation of the shortest path using modified Dijkstra algorithm in GIS. J. Image Graphics, 5: 1019-1023.
    Direct Link    

  • Wang, H.M. and X.Z. Zhou, 2009. Improved shortest path algorithm for restricted searching area. J. Nanjing Univ. Sci. Technol., 33: 638-642.

  • Wang, S., J.P. Xing, Y.T. Zhang and B.H. Bai, 2011. Ellipse-based shortest path algorithm for typical urban road networks. Syst. Eng. Theory Practice, 31: 1158-1164.

  • Wang, X.L., Z.S. Yang, X.T. Lv and B.X. Zhao, 2006. Shortest path algorithm based on limiting parallelogram and its application in traffic networks. J. Jilin Univ. (Eng. Technol. Edn.), 1: 123-127.
    Direct Link    

  • Wei, S.Y., F. Xu and Y. Min, 2008. Modeling on maintenance scheduling of transmission lines. Automation Electric Power Syst., 30: 41-44.

  • Zhang, J.W., L.Z. Zhang and X.C. Huang, 2008. A multi-fault rush repair strategy for distribution network based on genetic-topology algorithm. Automation Electric Power Syst., 32: 32-35.

  • Zhang, L.Z., X.C. Huang and J. Shu, 2005. Design and implementation of an optimization model for distribution net work maintenance scheduling. Automation Electric Power Syst., 29: 50-52.

  • Zhang, Y.L., J.H. Fan, J.G. Xu and D.S. Chen, 2006. Improved genetic algorithm research for vehicle routing problem. J. Tianjin Univ. Technol., 22: 79-82.
    Direct Link    

  • Zhu, Y.L., Y.W. Chen and K. Han, 2011. Optimal rush repair path of power lines based on improved genetic algorithm and taboo search. Microcomputer Appl., Vol. 28
    CrossRef    

    • © Science Alert. All Rights Reserved