On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds

DOI10.1080/15472450500455237MaRDI QIDQ5485097zbMATH OpenOpenAlexFDO

Authors Mark E. T. Horn

Publication date 28 August 2006

Published in ITS Journal - Intelligent Transportation Systems Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15472450500455237

zbMATH Keywords

dispatchingfastest pathson-line schedulingpickup and delivery problemtime-varying networksvehicle routing

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Deterministic scheduling theory in operations research (90B35)

Cites work

• Efficient modeling of travel in networks with time-varying link speeds
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• Shortest paths in a network with time-dependent flow speeds
• The pickup and delivery problem with time windows
• The Vehicle Routing Problem with Stochastic Travel Times
• The vehicle routing problem: An overview of exact and approximate algorithms
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• Vehicle dispatching with time-dependent travel times

Cited in

(1)

• A novel two-phase heuristic method for vehicle routing problem with backhauls

Describes a project that uses

Uses Software

• VRP

This page was built for publication: On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds

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