Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
From MaRDI portal
Publication:3057127
DOI10.1002/net.20338zbMath1206.90024OpenAlexW4244421641MaRDI QIDQ3057127
Emrah Uyar, Savelsbergh, Martin W. P., Alan L. Erera
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20338
Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)
Related Items (14)
A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility ⋮ Consolidating home meal delivery with limited operational disruption ⋮ A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times ⋮ On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows ⋮ Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands ⋮ Approximation algorithms for the a priori traveling repairman ⋮ A multi-space sampling heuristic for the vehicle routing problem with stochastic demands ⋮ The consistent production routing problem ⋮ The time‐consistent dial‐a‐ride problem ⋮ A vehicle routing problem with multiple service agreements ⋮ Comments on: ``Disruption management in vehicle routing and scheduling for road freight transport: a review ⋮ The dynamic dispatch waves problem for same-day delivery ⋮ An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
Cites Work
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints