This paper discusses a new algorithm for the shortest path founding based on hierarchical graphs. It plots out a flat graph into some sub-graphs, which are abstracted as a high-level graph. The calculation for the shortest path founding begins at the high-level graph. This method shrinks the searching range of the shortest path and reduces the time spending of calculating it. Since the impedance function among sub-graphs can be calculated dynamically, this algorithm can be applied to dynamic traffic inducement system.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A shortest path algorithm based on hierarchical graph model


    Contributors:
    Wu Yimin, (author) / Xu Jianmin, (author) / Hu Yucong, (author) / Yang Qinghong, (author)


    Publication date :

    2003-01-01


    Size :

    267743 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Shortest Path Algorithm Based on Hierarchical Graph Model

    Wu, Y. / Xu, J. / Hu, Y. et al. | British Library Conference Proceedings | 2003


    A performance analysis of hierarchical shortest path algorithms

    Fetterer, A. / Shekhar, S. | Tema Archive | 1997


    A Multiple Pairs Shortest Path Algorithm

    Wang, I.-L. / Johnson, E. L. / Sokol, J. S. | British Library Online Contents | 2005


    Shortest path using detour heuristic algorithm

    Wu, Shu-Hui / Wang, Shu-Jen / Tai, Chien-Ting et al. | Tema Archive | 1999


    A directionally oriented shortest path algorithm

    Butas, Larry F. | Elsevier | 1968