The time-dependent quickest path problem: properties and bounds

DOI10.1002/NET.21616MaRDI QIDQ4642443zbMATH OpenOpenAlexFDO

Authors Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21616

zbMATH Keywords

lower boundtime-dependent quickest path

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• A lower bound for the quickest path problem
• Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Bidirectional A^* search on time-dependent road networks
• Improved approximation for time-dependent shortest paths

Cited in

(12)

• The quickest path problem with batch constraints.
• Determining time-dependent minimum cost paths under several objectives
• A solution of the minimum-time speed planning problem based on lattice theory
• Finding traffic-aware fastest paths in spatial networks
• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• TSP race: minimizing completion time in time-sensitive applications
• A lower bound for the quickest path problem
• Time-dependent routing problems: a review
• Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest‐path trees
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• Point-to-point shortest paths on dynamic time-dependent road networks
• System reliability for quickest path problems under time threshold and budget

This page was built for publication: The time-dependent quickest path problem: properties and bounds

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