Engineering time-dependent many-to-many shortest paths computation

DOI10.4230/OASICS.ATMOS.2010.74MaRDI QIDQ2917289zbMATH OpenOpenAlexFDO

Authors Robert Geisberger, Peter Sanders

Publication date 28 September 2012

Full work available at URL http://algo2.iti.kit.edu/download/time_dependent_many_to_many.pdf

zbMATH Keywords

algorithm engineeringtime-dependenttravel time tablevrp

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Recommendations

• Efficient computation of shortest paths in time-dependent multi-modal networks
• On the complexity of time-dependent shortest paths
• On the complexity of time-dependent shortest paths
• Improved approximation for time-dependent shortest paths
• Temporal shortest paths: Parallel computing implementations
• Shortest paths in a network with time-dependent flow speeds
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
• Shortest paths in piecewise continuous time-dependent networks

Cited in

(2)

• The piecewise constant/linear solution for dynamic user equilibrium
• Vehicle routing with time-dependent travel times: theory, practice, and benchmarks

This page was built for publication: Engineering time-dependent many-to-many shortest paths computation

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