A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling

DOI10.1007/s10852-009-9113-5zbMath1180.90059OpenAlexW2061082746MaRDI QIDQ1043366

Kenneth Sörensen, Marc Sevaux

Publication date: 8 December 2009

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-009-9113-5

zbMATH Keywords

Monte Carlo samplingRobustnessMetaheuristicsFlexibilityMemetic algorithmStochastic vehicle routing

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items

Periodic supply vessel planning under demand and weather uncertainty ⋮ A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations ⋮ A vehicle routing problem with multiple service agreements ⋮ A GRASP with evolutionary path relinking for the truck and trailer routing problem ⋮ A methodology to create robust job rotation schedules

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
• A survey on metaheuristics for stochastic combinatorial optimization
• Stochastic vehicle routing: A comprehensive approach
• Stochastic vehicle routing
• A branch and bound method for stochastic global optimization
• Robust discrete optimization and its applications
• Analysis of a rollout approach to sequencing problems with stochastic routing applications
• A framework for robust and flexible optimisation using metaheuristics, with applications in supply chain design
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• The sample average approximation method applied to stochastic routing problems: a computational study
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
• Coherent Measures of Risk
• On Optimal Allocation of Indivisibles Under Uncertainty
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• On a routing problem
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models
• Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
• Vehicle routing with stochastic demands and restricted failures
• Robust solutions and methods in decision-aid
• On computing ELECTRE's credibility indices under partial information
• State-of-the-Art-Survey—Stochastic Programming: Computation and Applications
• The String-to-String Correction Problem
• Robust Optimization of Large-Scale Systems
• A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
• Investigation of practical, robust and flexible decisions for facility location problems using tabu search and simulation
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Vehicle Routing Problem with Stochastic Demand