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.
Identifying Multiple Reasonable Alternative Routes: Efficient Vector Labeling Approach
Transportation Research Record
Transportation Research Record: Journal of the Transportation Research Board ; 1783 , 1 ; 111-118
2002-01-01
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Identifying Multiple Reasonable Alternative Routes: Efficient Vector Labeling Approach
Online Contents | 2002
|Identifying Multiple Reasonable Alternative Routes: Efficient Vector Labeling Approach
British Library Conference Proceedings | 2002
|Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach
Online Contents | 1997
|Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach
Transportation Research Record | 1997
|Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach
British Library Conference Proceedings | 1997
|