Heuristic shortest path algorithms for transportation applications: State of the art

L. Fu, D. Sun, L. R. Rilett

Research output: Contribution to journalArticle

175 Citations (Scopus)

Abstract

There are a number of transportation applications that require the use of a heuristic shortest path algorithm rather than one of the standard, optimal algorithms. This is primarily due to the requirements of some transportation applications where shortest paths need to be quickly identified either because an immediate response is required (e.g., in-vehicle route guidance systems) or because the shortest paths need to be recalculated repeatedly (e.g., vehicle routing and scheduling). For this reason a number of heuristic approaches have been advocated for decreasing the computation time of the shortest path algorithm. This paper presents a survey review of various heuristic shortest path algorithms that have been developed in the past. The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience.

Original languageEnglish (US)
Pages (from-to)3324-3343
Number of pages20
JournalComputers and Operations Research
Volume33
Issue number11
DOIs
StatePublished - Nov 1 2006

Fingerprint

Shortest Path Algorithm
Heuristic algorithm
Shortest path
Heuristics
Vehicle Scheduling
Vehicle Routing
Optimal Algorithm
Vehicle routing
Guidance
Scheduling
Requirements

Keywords

  • Artificial intelligence
  • Heuristic shortest path algorithm
  • Heuristics
  • In-vehicle route guidance system (RGS)
  • Intelligent transportation systems (ITS)
  • Shortest path algorithm
  • Traffic network

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Cite this

Heuristic shortest path algorithms for transportation applications : State of the art. / Fu, L.; Sun, D.; Rilett, L. R.

In: Computers and Operations Research, Vol. 33, No. 11, 01.11.2006, p. 3324-3343.

Research output: Contribution to journalArticle

@article{f5d8d70e1f074afeaa6cfd2ee27693d7,
title = "Heuristic shortest path algorithms for transportation applications: State of the art",
abstract = "There are a number of transportation applications that require the use of a heuristic shortest path algorithm rather than one of the standard, optimal algorithms. This is primarily due to the requirements of some transportation applications where shortest paths need to be quickly identified either because an immediate response is required (e.g., in-vehicle route guidance systems) or because the shortest paths need to be recalculated repeatedly (e.g., vehicle routing and scheduling). For this reason a number of heuristic approaches have been advocated for decreasing the computation time of the shortest path algorithm. This paper presents a survey review of various heuristic shortest path algorithms that have been developed in the past. The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience.",
keywords = "Artificial intelligence, Heuristic shortest path algorithm, Heuristics, In-vehicle route guidance system (RGS), Intelligent transportation systems (ITS), Shortest path algorithm, Traffic network",
author = "L. Fu and D. Sun and Rilett, {L. R.}",
year = "2006",
month = "11",
day = "1",
doi = "10.1016/j.cor.2005.03.027",
language = "English (US)",
volume = "33",
pages = "3324--3343",
journal = "Computers and Operations Research",
issn = "0305-0548",
number = "11",

}

TY - JOUR

T1 - Heuristic shortest path algorithms for transportation applications

T2 - State of the art

AU - Fu, L.

AU - Sun, D.

AU - Rilett, L. R.

PY - 2006/11/1

Y1 - 2006/11/1

N2 - There are a number of transportation applications that require the use of a heuristic shortest path algorithm rather than one of the standard, optimal algorithms. This is primarily due to the requirements of some transportation applications where shortest paths need to be quickly identified either because an immediate response is required (e.g., in-vehicle route guidance systems) or because the shortest paths need to be recalculated repeatedly (e.g., vehicle routing and scheduling). For this reason a number of heuristic approaches have been advocated for decreasing the computation time of the shortest path algorithm. This paper presents a survey review of various heuristic shortest path algorithms that have been developed in the past. The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience.

AB - There are a number of transportation applications that require the use of a heuristic shortest path algorithm rather than one of the standard, optimal algorithms. This is primarily due to the requirements of some transportation applications where shortest paths need to be quickly identified either because an immediate response is required (e.g., in-vehicle route guidance systems) or because the shortest paths need to be recalculated repeatedly (e.g., vehicle routing and scheduling). For this reason a number of heuristic approaches have been advocated for decreasing the computation time of the shortest path algorithm. This paper presents a survey review of various heuristic shortest path algorithms that have been developed in the past. The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience.

KW - Artificial intelligence

KW - Heuristic shortest path algorithm

KW - Heuristics

KW - In-vehicle route guidance system (RGS)

KW - Intelligent transportation systems (ITS)

KW - Shortest path algorithm

KW - Traffic network

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

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

U2 - 10.1016/j.cor.2005.03.027

DO - 10.1016/j.cor.2005.03.027

M3 - Article

AN - SCOPUS:33644686206

VL - 33

SP - 3324

EP - 3343

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 11

ER -