Competitive analysis of a dispatch policy for a dynamic multi-period routing problem

DOI10.1016/j.orl.2007.02.006zbMath1180.90049OpenAlexW2058479983MaRDI QIDQ2467440

Savelsbergh, Martin W. P., Maria Grazia Speranza, Enrico Angelelli

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.02.006

zbMATH Keywords

dynamic vehicle routing

Mathematics Subject Classification ID

Dynamic programming (90C39) Traffic problems in operations research (90B20)

Related Items (11)

Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework ⋮ Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs ⋮ A multi-period TSP with stochastic regular and urgent demands ⋮ The Period Vehicle Routing Problem and its Extensions ⋮ Recent Developments in Dynamic Vehicle Routing Systems ⋮ Online Vehicle Routing Problems: A Survey ⋮ Clever or smart: strategies for the online target date assignment problem ⋮ The dynamic dispatch waves problem for same-day delivery ⋮ Online traveling salesman problems with service flexibility ⋮ Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty ⋮ Management Policies in a Dynamic Multi Period Routing Problem

Cites Work

• Unnamed Item
• Unnamed Item
• News from the online traveling repairman.
• On-line algorithms for the dynamic traveling repair problem
• The Online TSP Against Fair Adversaries
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Approximation and Online Algorithms
• Algorithms for the on-line travelling salesman

This page was built for publication: Competitive analysis of a dispatch policy for a dynamic multi-period routing problem