Identifying multiple reasonable alternative routes: Efficient vector labeling approach

Dongjoo Park, Shyam Lal Sharma, Laurence R. Rilett, Myungsoon Chang

Research output: Contribution to journalArticle

8 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)111-118
Number of pages8
JournalTransportation Research Record
Issue number1783
DOIs
StatePublished - Jan 1 2002

Fingerprint

Labeling
Travel time

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Mechanical Engineering

Cite this

Identifying multiple reasonable alternative routes : Efficient vector labeling approach. / Park, Dongjoo; Sharma, Shyam Lal; Rilett, Laurence R.; Chang, Myungsoon.

In: Transportation Research Record, No. 1783, 01.01.2002, p. 111-118.

Research output: Contribution to journalArticle

Park, Dongjoo ; Sharma, Shyam Lal ; Rilett, Laurence R. ; Chang, Myungsoon. / Identifying multiple reasonable alternative routes : Efficient vector labeling approach. In: Transportation Research Record. 2002 ; No. 1783. pp. 111-118.
@article{59dd4b46c037464792694f0e6c2db78a,
title = "Identifying multiple reasonable alternative routes: Efficient vector labeling approach",
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.",
author = "Dongjoo Park and Sharma, {Shyam Lal} and Rilett, {Laurence R.} and Myungsoon Chang",
year = "2002",
month = "1",
day = "1",
doi = "10.3141/1783-14",
language = "English (US)",
pages = "111--118",
journal = "Transportation Research Record",
issn = "0361-1981",
publisher = "US National Research Council",
number = "1783",

}

TY - JOUR

T1 - Identifying multiple reasonable alternative routes

T2 - Efficient vector labeling approach

AU - Park, Dongjoo

AU - Sharma, Shyam Lal

AU - Rilett, Laurence R.

AU - Chang, Myungsoon

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036962042&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036962042&partnerID=8YFLogxK

U2 - 10.3141/1783-14

DO - 10.3141/1783-14

M3 - Article

AN - SCOPUS:0036962042

SP - 111

EP - 118

JO - Transportation Research Record

JF - Transportation Research Record

SN - 0361-1981

IS - 1783

ER -