An exact approach for identifying multiple reasonable paths in a transportation network is proposed. It is motivated by the deficiencies of heuristic approaches and K-shortest-path algorithms that have been used historically. The proposed algorithm is based on the so-called efficient vector labeling approach. The search space is pruned using a resource constraint. A route constraint is applied for maintaining the reasonableness of alternative routes. In addition, a dominance-checking concept is introduced to avoid identifying candidate subpaths at nodes that cannot satisfy travel time or route uniqueness requirements. The approach was demonstrated on a transportation network from Austin, Texas. It was found that the proposed algorithm can efficiently identify multiple reasonable alternative routes in transportation networks and has a number of advantages as compared with traditional K-shortest-path algorithms and heuristic approaches.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Identifying Multiple Reasonable Alternative Routes: Efficient Vector Labeling Approach


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2002-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Identifying Multiple Reasonable Alternative Routes: Efficient Vector Labeling Approach

    Park, D. / Sharma, S. L. / Rilett, L. R. et al. | British Library Conference Proceedings | 2002


    Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach

    Park, Dongjoo / Rilett, Laurence R. | Transportation Research Record | 1997


    Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach

    Park, D. / Rilett, L. R. / National Research Council; Transportation Research Board | British Library Conference Proceedings | 1997