A class of multicriteria shortest path problems for real-time in-vehicle routing

Dongjoo Park, Laurence R. Rilett, Changho Choi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In-route guidance systems fastest path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this paper is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e., Pareto optimal) paths for real-time in-vehicle routing. The basic notion of the proposed approach is that (i) enumerating all nondominated paths is computationally too expensive, (ii) obtaining a stable mathematical representation of the driver's utility function is theoretically difficult and impractical, and (iii) identifying the optimal path given a nonlinear utility function is a nondeterministic polynomial time (NP)-hard problem. Consequently, a heuristic two-stage strategy that identifies multiple routes and then selects the near-optimal path may be effective and practical. As the first stage, we relax the uniqueness of the utility function by measuring the context-dependent preference using an entropy model and propose a branch-and-bound technique that discards most of the nondominated paths. To make sure that the paths identified are dissimilar in terms of links used, the portion of shared links between routes is limited. The test of the algorithm in a large real-life traffic network shows that the algorithm can significantly reduce computational complexity while identifying reasonable alternative paths.

Original languageEnglish (US)
Pages (from-to)1096-1109
Number of pages14
JournalCanadian journal of civil engineering
Volume34
Issue number9
DOIs
StatePublished - Sep 1 2007

Fingerprint

Vehicle routing
routing
Set theory
heuristics
entropy
Computational complexity
Entropy
Polynomials
vehicle

Keywords

  • Multiple routes
  • Optimal path
  • Real-time vehicle routing
  • Utility function

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Environmental Science(all)

Cite this

A class of multicriteria shortest path problems for real-time in-vehicle routing. / Park, Dongjoo; Rilett, Laurence R.; Choi, Changho.

In: Canadian journal of civil engineering, Vol. 34, No. 9, 01.09.2007, p. 1096-1109.

Research output: Contribution to journalArticle

@article{9e6df0a120664dcdbc0f71e53db4c198,
title = "A class of multicriteria shortest path problems for real-time in-vehicle routing",
abstract = "In-route guidance systems fastest path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this paper is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e., Pareto optimal) paths for real-time in-vehicle routing. The basic notion of the proposed approach is that (i) enumerating all nondominated paths is computationally too expensive, (ii) obtaining a stable mathematical representation of the driver's utility function is theoretically difficult and impractical, and (iii) identifying the optimal path given a nonlinear utility function is a nondeterministic polynomial time (NP)-hard problem. Consequently, a heuristic two-stage strategy that identifies multiple routes and then selects the near-optimal path may be effective and practical. As the first stage, we relax the uniqueness of the utility function by measuring the context-dependent preference using an entropy model and propose a branch-and-bound technique that discards most of the nondominated paths. To make sure that the paths identified are dissimilar in terms of links used, the portion of shared links between routes is limited. The test of the algorithm in a large real-life traffic network shows that the algorithm can significantly reduce computational complexity while identifying reasonable alternative paths.",
keywords = "Multiple routes, Optimal path, Real-time vehicle routing, Utility function",
author = "Dongjoo Park and Rilett, {Laurence R.} and Changho Choi",
year = "2007",
month = "9",
day = "1",
doi = "10.1139/L07-013",
language = "English (US)",
volume = "34",
pages = "1096--1109",
journal = "Canadian Journal of Civil Engineering",
issn = "0315-1468",
publisher = "National Research Council of Canada",
number = "9",

}

TY - JOUR

T1 - A class of multicriteria shortest path problems for real-time in-vehicle routing

AU - Park, Dongjoo

AU - Rilett, Laurence R.

AU - Choi, Changho

PY - 2007/9/1

Y1 - 2007/9/1

N2 - In-route guidance systems fastest path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this paper is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e., Pareto optimal) paths for real-time in-vehicle routing. The basic notion of the proposed approach is that (i) enumerating all nondominated paths is computationally too expensive, (ii) obtaining a stable mathematical representation of the driver's utility function is theoretically difficult and impractical, and (iii) identifying the optimal path given a nonlinear utility function is a nondeterministic polynomial time (NP)-hard problem. Consequently, a heuristic two-stage strategy that identifies multiple routes and then selects the near-optimal path may be effective and practical. As the first stage, we relax the uniqueness of the utility function by measuring the context-dependent preference using an entropy model and propose a branch-and-bound technique that discards most of the nondominated paths. To make sure that the paths identified are dissimilar in terms of links used, the portion of shared links between routes is limited. The test of the algorithm in a large real-life traffic network shows that the algorithm can significantly reduce computational complexity while identifying reasonable alternative paths.

AB - In-route guidance systems fastest path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this paper is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e., Pareto optimal) paths for real-time in-vehicle routing. The basic notion of the proposed approach is that (i) enumerating all nondominated paths is computationally too expensive, (ii) obtaining a stable mathematical representation of the driver's utility function is theoretically difficult and impractical, and (iii) identifying the optimal path given a nonlinear utility function is a nondeterministic polynomial time (NP)-hard problem. Consequently, a heuristic two-stage strategy that identifies multiple routes and then selects the near-optimal path may be effective and practical. As the first stage, we relax the uniqueness of the utility function by measuring the context-dependent preference using an entropy model and propose a branch-and-bound technique that discards most of the nondominated paths. To make sure that the paths identified are dissimilar in terms of links used, the portion of shared links between routes is limited. The test of the algorithm in a large real-life traffic network shows that the algorithm can significantly reduce computational complexity while identifying reasonable alternative paths.

KW - Multiple routes

KW - Optimal path

KW - Real-time vehicle routing

KW - Utility function

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

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

U2 - 10.1139/L07-013

DO - 10.1139/L07-013

M3 - Article

AN - SCOPUS:36148956614

VL - 34

SP - 1096

EP - 1109

JO - Canadian Journal of Civil Engineering

JF - Canadian Journal of Civil Engineering

SN - 0315-1468

IS - 9

ER -