Online Vehicle Routing Problems: A Survey
From MaRDI portal
Publication:3564358
DOI10.1007/978-0-387-77778-8_10zbMath1187.90055OpenAlexW39673021MaRDI QIDQ3564358
Patrick Jaillet, Michael R. Wagner
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
Transportation, logistics and supply chain management (90B06) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (18)
New Bounds for Maximizing Revenue in Online Dial-a-Ride ⋮ Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage ⋮ The Steiner traveling salesman problem with online advanced edge blockages ⋮ Online routing and searching on graphs with blocked edges ⋮ An online optimization approach for post-disaster relief distribution with online blocked edges ⋮ Online graph exploration: New results on old and new algorithms ⋮ Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands ⋮ Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures ⋮ Optimal online and offline algorithms for robot-assisted restoration of barrier coverage ⋮ From theory to practice: maximizing revenues for on-line dial-a-ride ⋮ The covering Canadian traveller problem ⋮ Improved bounds for revenue maximization in time-limited online dial-a-ride ⋮ Weighted online minimum latency problem with edge uncertainty ⋮ Pricing and allocation algorithm designs in dynamic ridesharing system ⋮ Dynamic pickup and delivery problems
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
This page was built for publication: Online Vehicle Routing Problems: A Survey
