The VTI National Transport Library Catalogue

Identifying multiple reasonable alternative routes : Efficient vector labeling approach Park, Dongjoo et al

By: Park, DongjooPublication details: Transportation Research Record, 2002Description: nr 1783, s. 111-8Subject(s): USA | Mathematical model | Transport network | | Selection | Alternative | 25Bibl.nr: VTI P8169:2002 RefLocation: Abstract: 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.
Item type: Reports, conferences, monographs
Current library Call number Status Date due Barcode
Statens väg- och transportforskningsinstitut

VTI:s bibliotek i Linköping
bibliotek@vti.se

Available

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.

Powered by Koha