The Stochastic Vehicle Routing Problem for Minimum Unmet Demand

DOI10.1007/978-0-387-88617-6_13zbMath1172.90342OpenAlexW1579013900MaRDI QIDQ3638510

Zhihong Shen, Fernando Ordóñez, Maged M. Dessouky

Publication date: 27 October 2009

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-88617-6_13

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (10)

Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ A recourse goal programming approach for airport bus routing problem ⋮ A tabu search algorithm to solve a green logistics bi-objective bi-level problem ⋮ Risky traveling salesman problem ⋮ Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints ⋮ The robust vehicle routing problem with time windows: solution by branch and price and cut ⋮ Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance ⋮ A vehicle routing problem with distribution uncertainty in deadlines ⋮ A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem ⋮ New Notation and Classification Scheme for Vehicle Routing Problems

This page was built for publication: The Stochastic Vehicle Routing Problem for Minimum Unmet Demand