Online Vehicle Routing Problems: A Survey
From MaRDI portal
Publication:3564358
DOI10.1007/978-0-387-77778-8_10zbMATH Open1187.90055OpenAlexW39673021MaRDI QIDQ3564358FDOQ3564358
Authors: 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
Recommendations
- A survey of vehicle routing optimization problems and solution methods
- The online vehicle routing problem with occasional drivers
- Online-Optimization of Large-Scale Vehicle Dispatching Problems
- Vehicle Routing
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- A review of dynamic vehicle routing problems
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06)
Cites Work
- The Price of Robustness
- Title not available (Why is that?)
- Speed is as powerful as clairvoyance
- Online algorithms. The state of the art
- Robust solutions of linear programming problems contaminated with uncertain data
- Title not available (Why is that?)
- Bounds and Heuristics for Capacitated Routing Problems
- Competitive snoopy caching
- A new measure for the study of on-line algorithms
- Title not available (Why is that?)
- The online TSP against fair adversaries
- Algorithms for the on-line travelling salesman
- Algorithms for the on-line quota traveling salesman problem
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Routing and Scheduling on a Shoreline with Release Times
- Special cases of traveling salesman and repairman problems with time windows
- Computing and Combinatorics
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Title not available (Why is that?)
- Beyond Competitive Analysis
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- Constructing competitive tours from local information
- Toward Robust Revenue Management: Competitive Analysis of Online Booking
- The Online Transportation Problem
- Combinatorial optimization. Theory and algorithms.
- Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
- Revenue management with limited demand information
- On-line single-server dial-a-ride problems
- News from the online traveling repairman.
- Algorithms and Data Structures
- Online k-Server Routing Problems
- Theory and Applications of Models of Computation
- Online Searching
Cited In (27)
- Online disjoint vehicle routing with application to AGV routing.
- Pricing and allocation algorithm designs in dynamic ridesharing system
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
- Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery
- Computing and Combinatorics
- Comparison of anticipatory algorithms for a dial-a-ride problem
- Online graph exploration: New results on old and new algorithms
- Weighted online minimum latency problem with edge uncertainty
- Heuristic algorithms based on column generation for an online product shipping problem
- The Steiner traveling salesman problem with online advanced edge blockages
- Dynamic pickup and delivery problems
- Online pickup and delivery problem with constrained capacity to minimize latency
- The \(m\)-Steiner traveling salesman problem with online edge blockages
- New Bounds for Maximizing Revenue in Online Dial-a-Ride
- Online routing and searching on graphs with blocked edges
- Single vehicle's package delivery strategy with online traffic congestion of certain delay time
- An online optimization approach for post-disaster relief distribution with online blocked edges
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- Online-Optimization of Large-Scale Vehicle Dispatching Problems
- On line routing per mobile phone a case on subsequent deliveries of newspapers
- Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures
- From theory to practice: maximizing revenues for on-line dial-a-ride
- Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
- Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
- The covering Canadian traveller problem
- Improved bounds for revenue maximization in time-limited online dial-a-ride
This page was built for publication: Online Vehicle Routing Problems: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564358)
