A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
type: Item
instance of: scholarly article
title: A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
zbMATH Open document ID: 1180.90059
author: K. Sörensen
author: Marc Sevaux
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2009-12-08T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5643724
zbMATH Keywords: Stochastic vehicle routing
zbMATH Keywords: Robustness
zbMATH Keywords: Flexibility
zbMATH Keywords: Monte Carlo sampling
zbMATH Keywords: Metaheuristics
zbMATH Keywords: Memetic algorithm
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10852-009-9113-5
OpenAlex ID: W2061082746
cites work: Coherent measures of risk
cites work: On a routing problem
cites work: A Vehicle Routing Problem with Stochastic Demand
cites work: A survey on metaheuristics for stochastic combinatorial optimization
cites work: State-of-the-Art-Survey—Stochastic Programming: Computation and Applications
cites work: Q4451075
cites work: Solving the vehicle routing problem with stochastic demands using the cross-entropy method
cites work: On computing ELECTRE's credibility indices under partial information
cites work: Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
cites work: Vehicle routing with stochastic demands and restricted failures
cites work: An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
cites work: Stochastic vehicle routing
cites work: Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
cites work: A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
cites work: Q4858094
cites work: Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models
cites work: The sample average approximation method for stochastic discrete optimization
cites work: Robust discrete optimization and its applications
cites work: An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
cites work: Q3951448
cites work: Robust Optimization of Large-Scale Systems
cites work: On optimal allocation of indivisibles under uncertainty
cites work: A branch and bound method for stochastic global optimization
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: Q4256716
cites work: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
cites work: A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
cites work: Analysis of a rollout approach to sequencing problems with stochastic routing applications
cites work: A framework for robust and flexible optimisation using metaheuristics, with applications in supply chain design
cites work: Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
cites work: Investigation of practical, robust and flexible decisions for facility location problems using tabu search and simulation
cites work: \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
cites work: Stochastic vehicle routing: A comprehensive approach
cites work: Q4955264
cites work: The sample average approximation method applied to stochastic routing problems: a computational study
cites work: Robust solutions and methods in decision-aid
cites work: The String-to-String Correction Problem
DOI: 10.1007/S10852-009-9113-5
description: scientific article; zbMATH DE number 5643724