题名: |
IDENTIFYING MULTIPLE REASONABLE ALTERNATIVE ROUTES: EFFICIENT VECTOR LABELING APPROACH. |
作者: |
Park-D; Sharma-SL; Rilett-LR; Chang-M |
关键词: |
Algorithms-; Austin-Texas; Efficient-vector-labeling; Networks-; Routing-; Transportation- |
摘要: |
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. |
总页数: |
Transportation Research Record. 2002. (1783) pp111-118 (5 Fig., 1 Tab., 20 Ref.) |
报告类型: |
科技报告 |