Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
From MaRDI portal
Publication:2467440
DOI10.1016/J.ORL.2007.02.006zbMATH Open1180.90049OpenAlexW2058479983MaRDI QIDQ2467440FDOQ2467440
Martin W. P. Savelsbergh, 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
Cites Work
- 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.
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Recent Developments in Dynamic Vehicle Routing Systems
- The Period Vehicle Routing Problem and its Extensions
- 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
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
- Management Policies in a Dynamic Multi Period Routing Problem
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)
