Vehicle routing with stochastic demands and restricted failures
DOI10.1007/BF01415995zbMATH Open0804.90040OpenAlexW2038372192MaRDI QIDQ4201811FDOQ4201811
Authors: Moshe Dror, G. Laporte, François V. Louveaux 
Publication date: 29 August 1993
Published in: ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01415995
Recommendations
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Stochastic vehicle routing with modified savings algorithm
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- Vehicle routing with probabilistic capacity constraints
- A Vehicle Routing Problem with Stochastic Demand
Reliability, availability, maintenance, inspection in operations research (90B25) Transportation, logistics and supply chain management (90B06) Stochastic systems in control theory (general) (93E03)
Cites Work
- Stochastic vehicle routing: A comprehensive approach
- Models and exact solutions for a class of stochastic location-routing problems
- The vehicle routing problem: An overview of exact and approximate algorithms
- Some Simple Applications of the Travelling Salesman Problem
- Facet identification for the symmetric traveling salesman polytope
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Optimal Routing under Capacity and Distance Restrictions
- Solution of large-scale symmetric travelling salesman problems
- An exact algorithm for the asymmetrical capacitated vehicle routing problem
- Log-concavity and log-convexity in passage time densities of diffusion and birth-death processes
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- The monotonicity of the threshold detection probability in a stochastic accumulation process
Cited In (20)
- The stochastic vehicle routing problem revisited
- Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm
- The mixed capacitated general routing problem under uncertainty
- Vehicle routing with probabilistic capacity constraints
- Stochastic vehicle routing with recourse
- Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems
- Dynamic vehicle routing: Status and prospects
- Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands
- Exact algorithms for the chance-constrained vehicle routing problem
- Stochastic vehicle routing
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Routing problems: A bibliography
- Stochastic vehicle routing with modified savings algorithm
- Exact algorithms for the chance-constrained vehicle routing problem
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- The distributionally robust chance-constrained vehicle routing problem
- Generalized network design problems.
- Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
This page was built for publication: Vehicle routing with stochastic demands and restricted failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201811)
