The Stochastic Vehicle Routing Problem for Minimum Unmet Demand

DOI10.1007/978-0-387-88617-6_13MaRDI QIDQ3638510zbMATH OpenOpenAlexFDO

Authors Zhihong Shen, Fernando Ordóñez, Maged 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)

Recommendations

• Vehicle routing with probabilistic capacity constraints
• The Vehicle Routing Problem with Stochastic Travel Times
• A Vehicle Routing Problem with Stochastic Demand
• Vehicle routing problem with stochastic demand
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands

Cited in

(11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638510)