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

DOI10.1016/J.ORL.2007.02.006MaRDI QIDQ2467440zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Serving requests with on-line routing
• Management policies in a dynamic multi period routing problem
• Online k-Server Routing Problems
• Online k-server routing problems

Cites work

• scientific article; zbMATH DE number 1629830 (Why is no real title available?)
• scientific article; zbMATH DE number 192876 (Why is no real title available?)
• Algorithms for the on-line travelling salesman
• Approximation and Online Algorithms
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• News from the online traveling repairman.
• On-line algorithms for the dynamic traveling repair problem
• The online TSP against fair adversaries

Cited in

(13)

• Online traveling salesman problems with service flexibility
• Management policies in a dynamic multi period routing problem
• Clever or smart: strategies for the online target date assignment problem
• Online Vehicle Routing Problems: A Survey
• A multi-period TSP with stochastic regular and urgent demands
• The dynamic dispatch waves problem for same-day delivery
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
• Analysis of the best double frequency policy in the single link problem with discrete shipping times
• Robust multiperiod vehicle routing under customer order uncertainty
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
• Recent developments in dynamic vehicle routing systems
• The period vehicle routing problem and its extensions

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

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