The reasonable route set is defined as a set of all paths which drivers may be selected from in a specific OD pair. This is a necessary link in traffic assignments and it is also an important determining factor for traffic management and control. So there is interest in algorithms that can deliver multi-paths that may be reasonable. In this paper, an efficient Astar-based algorithm is designed to elect such route set. Compared with conventional Dijkstra-based one, it runs faster and gets suboptimal results in the early stage of calculation. A numerical example demonstrates the operation of the algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Multi-Path Astar Algorithm for Recognizing Reasonable Route Set


    Contributors:
    Yin, Wei (author) / Yang, Xiao-Guang (author)

    Conference:

    The Twelfth COTA International Conference of Transportation Professionals ; 2012 ; Beijing, China


    Published in:

    CICTP 2012 ; 756-763


    Publication date :

    2012-07-23




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English






    ASTAR Flight Test: Overview and Spacing Results

    Roper, Roy D. / Koch, Michael R. | NTRS | 2016


    Towards an orientation enhanced astar algorithm for robotic navigation

    Fernandes E. / Fernandes, Elisabete / Costa, Pedro et al. | BASE | 2015

    Free access

    ASTAR Flight Test: Overview and Spacing Results

    R. D. Roper / M. R. Koch | NTIS | 2016