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

DOI10.1016/J.ORL.2007.02.006zbMATH Open1180.90049OpenAlexW2058479983MaRDI QIDQ2467440FDOQ2467440

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

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

zbMATH Keywords

dynamic vehicle routing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The online TSP against fair adversaries
• Algorithms for the on-line travelling salesman
• On-line algorithms for the dynamic traveling repair problem
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Approximation and Online Algorithms
• News from the online traveling repairman.

Cited In (13)

• Management policies in a dynamic multi period routing problem
• Online traveling salesman problems with service flexibility
• Clever or smart: strategies for the online target date assignment problem
• Online Vehicle Routing Problems: A Survey
• Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty
• 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
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Recent developments in dynamic vehicle routing systems
• The period vehicle routing problem and its extensions
• Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs

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)