Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem

Authors:
Jean-François Bérubé;Jean-Yves Potvin;Jean Vaucher
Affiliations:
Département d'informatique et de recherche opérationnelle, Université de Montréal, Montréal, Qué., Canada;Département d'informatique et de recherche opérationnelle, Université de Montréal, Montréal, Qué., Canada;Département d'informatique et de recherche opérationnelle, Université de Montréal, Montréal, Qué., Canada
Venue:
Computers and Operations Research
Year:
2006

Citing 7
Cited 0

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Shortest paths in Euclidean graphs

Algorithmica
Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"

ACM SIGART Bulletin
Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks

IEEE Transactions on Intelligent Transportation Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we introduce a travel planning problem which is solved by computing time-dependent shortest paths through a fixed sequence of nodes. Given a predetermined itinerary, our travel planning problem consists in finding the best travel plan, involving planes and hotels, based on the traveler's preferences. Our time-dependent framework therefore models plane flights, hotels, stays in each city as well as global time constraints. Given the large size of time-dependent networks, an exact decomposition algorithm is devised to solve instances of realistic size in reasonable computation times.