Volume 11 Issue 4
. 
Turn off MathJax
Article Contents
Article Navigation >  Journal of Traffic and Transportation Engineering  > 2011  >  11(4): 123-126
YU De-xin, YANG Wei, YANG Zhao-sheng. Shortest path improved algorithm based on GIS under large-scale disaster[J]. Journal of Traffic and Transportation Engineering, 2011, 11(4): 123-126. doi: 10.19818/j.cnki.1671-1637.2011.04.019
Citation: YU De-xin, YANG Wei, YANG Zhao-sheng. Shortest path improved algorithm based on GIS under large-scale disaster[J]. Journal of Traffic and Transportation Engineering, 2011, 11(4): 123-126. doi: 10.19818/j.cnki.1671-1637.2011.04.019
shu

Shortest path improved algorithm based on GIS under large-scale disaster

doi: 10.19818/j.cnki.1671-1637.2011.04.019
  • 1.

    School of Traffic, Jilin University, Changchun 130022, Jilin, China

  • 2.

    State Key Laboratory of Automotive Simulation and Control, Jilin University, Changchun 130022, Jilin, China

More Information
  • Author Bio:

    YU De-xin(1972-), male, professor, PhD, +86-431-85095091, yudx@jlu.edu.cn

  • Received Date: 2011-03-08
  • Publish Date: 2011-08-25
    Abstract
  • The Dijkstra algorithm under large-scale disaster was improved by using classical Dijkstra algorithm, and the function of penalty factor was built. Complex network analysis function was realized by using Visual C++ 6.0 and the secondary development module of GIS. The impacts of node quantity on road reliability and the selection of optimal path under large-scale disaster were analyzed. Distance, travel time and node quantity were considered, the advantage of improved Dijkstra algorithm in the selection of optimal path was proved. Analysis result shows that the node quantities computed by improved Dijkstra algorithm and classical Dijkstra algorithm are 31, 59 respectively, travel times are almost same. So the improved algorithm can reduce the node quantity in evacuation route effectively, and decrease the delay loss and risk of vehicle at the node.

     

    • FullText(HTML)
  • loading
    • References(11)
  • [1]
    HOFFMAN W, PAVLEY R. A method for the solution of the Nth best path problem[J]. Journal of the Association for Computing Machinery, 1959, 6 (4): 506-514. doi: 10.1145/320998.321004
    [2]
    LAWLER E L. Combinatorial Opti mization: Networks and Matroids[M]. New York: Courier Dover Publications, 1976.
    [3]
    YAMADA T. A network flowapproach to a city emergency evacuation planning[J]. International Journal of Systems Science, 1996, 27 (10): 931-936. doi: 10.1080/00207729608929296
    [4]
    DUNN C E, NEWTON D. Optimal routesin GIS and emergency planning applications[J]. Area, 1992, 24 (3): 259-267.
    [5]
    王秀斌. GIS网络分析中最短路径的实现[J]. 测绘科学, 2007, 32 (5): 61-62. doi: 10.3771/j.issn.1009-2307.2007.05.021

    WANG Xiu-bin. Realization of the shortest path in GIS network analysis[J]. Science of Surveying and Mapping, 2007, 32 (5): 61-62. (in Chinese) doi: 10.3771/j.issn.1009-2307.2007.05.021
    [6]
    CHERKASSKY B V, GOLDBERG A V, RADZIK T. Shortest paths algorithms: theory and experimental evaluation[J]. Mathematical Programming, 1996, 73 (2): 129-174. doi: 10.1007/BF02592101
    [7]
    ZHAN F B, NOON C E. Shortest path algorithms: An evaluation using real road networks[J]. Transportation Science, 1998, 32 (1): 65-73. doi: 10.1287/trsc.32.1.65
    [8]
    王杰臣, 杨得志, 张伟. 最短路径问题的一种改进算法[J]. 解放军测绘学院学报, 1999, 16 (4): 282-285. https://www.cnki.com.cn/Article/CJFDTOTAL-JFJC199904014.htm

    WANG Jie-chen, YANG De-zhi, ZHANG Wei. An improvement algorithm of shortest route analysis[J]. Journal of the PLA Institute of Surveying and Mapping, 1999, 16 (4): 282-285. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-JFJC199904014.htm
    [9]
    成礼平. GIS技术在城市交通分配中的应用研究[D]. 南京: 东南大学, 2004.

    CHENG Li-ping. The research of applying GIS technology to city traffic assignment[D]. Nanjing: Southeast University, 2004. (in Chinese)
    [10]
    夏松, 韩用顺. GIS中最短路径算法的改进实现[J]. 测绘通报, 2004 (9): 40-42. https://www.cnki.com.cn/Article/CJFDTOTAL-CHTB200409014.htm

    XI A Song, HAN Yong-shun. An improved implementation of shortest path algorithmin GIS[J]. Bulletin of Surveying and Mapping, 2004 (9): 40-42. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-CHTB200409014.htm
    [11]
    严寒冰, 刘迎春. 基于GIS的城市道路网最短路径算法探讨[J]. 计算机学报, 2000, 23 (2): 210-215. doi: 10.3321/j.issn:0254-4164.2000.02.015

    YAN Han-bing, LIU Ying-chun. A new algorithm for finding shortcut in a city's road net based on GIS technology[J]. Chinese Journal of Computers, 2000, 23 (2): 210-215. (in Chinese) doi: 10.3321/j.issn:0254-4164.2000.02.015
    • Relative Articles
    • Supplements(0)
    • Cited By
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (557) PDF downloads(778) Cited by()
    Proportional views
    Related

    Copyright《Journal of Traffic and Transportation Engineering》编辑部陕ICP备05001904号-1

    Address ：Editorial Department of Journal of Traffic and Transportation Engineering, Chang 'an University, Middle Section of South Second Ring Road, Xi 'an, Shaanxi（710064） Tel：029-82334388 Email：jygc@chd.edu.cn

    All visit:Today's visit:

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return