On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds
From MaRDI portal
Publication:5485097
DOI10.1080/15472450500455237zbMath1099.90540OpenAlexW2080930076MaRDI QIDQ5485097
Publication date: 28 August 2006
Published in: Journal of Intelligent Transportation Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15472450500455237
vehicle routingpickup and delivery problemdispatchingon-line schedulingtime-varying networksfastest paths
Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)
Related Items (1)
Uses Software
Cites Work
- The pickup and delivery problem with time windows
- The vehicle routing problem: An overview of exact and approximate algorithms
- Vehicle dispatching with time-dependent travel times
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Shortest paths in a network with time-dependent flow speeds
- The Vehicle Routing Problem with Stochastic Travel Times
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Efficient modeling of travel in networks with time-varying link speeds
This page was built for publication: On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds