Online Vehicle Routing Problems: A Survey
From MaRDI portal
Publication:3564358
DOI10.1007/978-0-387-77778-8_10zbMath1187.90055MaRDI QIDQ3564358
Michael R. Wagner, Patrick Jaillet
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_10
90B06: Transportation, logistics and supply chain management
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Dynamic pickup and delivery problems, Online graph exploration: New results on old and new algorithms, The covering Canadian traveller problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the on-line quota traveling salesman problem
- Online algorithms. The state of the art
- Competitive snoopy caching
- A new measure for the study of on-line algorithms
- Constructing competitive tours from local information
- News from the online traveling repairman.
- Robust solutions of linear programming problems contaminated with uncertain data
- Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
- The Online TSP Against Fair Adversaries
- Toward Robust Revenue Management: Competitive Analysis of Online Booking
- Revenue Management with Limited Demand Information
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Routing and Scheduling on a Shoreline with Release Times
- Online Searching
- The Price of Robustness
- Bounds and Heuristics for Capacitated Routing Problems
- Special cases of traveling salesman and repairman problems with time windows
- Speed is as powerful as clairvoyance
- The Online Transportation Problem
- Beyond Competitive Analysis
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- Algorithms and Data Structures
- Online k-Server Routing Problems
- Computing and Combinatorics
- Theory and Applications of Models of Computation
- Combinatorial optimization. Theory and algorithms.
- Algorithms for the on-line travelling salesman
- On-line single-server dial-a-ride problems
