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

DOI10.1016/J.COR.2004.11.021MaRDI QIDQ2581622zbMATH OpenOpenAlexFDO

Authors J. Bérubé, Jean-Yves Potvin, Jean Vaucher

Publication date 10 January 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.11.021

zbMATH Keywords

Fixed nodesShortest pathsTime-dependentTravel planning

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Recommendations

• Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
• Time-dependent routing problems: a review
• The time-dependent shortest path and vehicle routing problem
• Shortest paths in piecewise continuous time-dependent networks

Cites work

• A note on two problems in connexion with graphs
• A parametric approach to solving bicriterion shortest path problems
• An Appraisal of Some Shortest-Path Algorithms
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• scientific article; zbMATH DE number 1488066 (Why is no real title available?)
• Minimum weight paths in time-dependent networks
• Network flows. Theory, algorithms, and applications.
• On a routing problem
• Shortest paths in Euclidean graphs
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• The shortest route through a network with time-dependent internodal transit times
• Time-varying shortest path problems with constraints

Cited in

(10)

• Optimising waiting at nodes in time-dependent networks: cost functions and applications
• Dynamic journeying under uncertainty
• The fastest itinerary in time-dependent decentralized travel information systems
• The multi-period \(p\)-center problem with time-dependent travel times
• scientific article; zbMATH DE number 4174360 (Why is no real title available?)
• Time analysis for planning a path in a time-window network
• Finding theKth shortest path in a time-schedule network
• An efficient exact approach for the constrained shortest path tour problem
• Solving time dependent shortest path problems on airway networks using super-optimal wind
• Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network

This page was built for publication: Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581622)