Problem variant

VRPSD: Vehicle routing problem with stochastic demands

Acronym	VRPSD
Title	Vehicle routing problem with stochastic demands
Criterion	MIN
Description	The VRPSD consists in finding the set of routes of minimal expected cost to service the uncertain demands of a set of customers.

Datasets	Christiansen and Lysgaard 2007
References	Christiansen and Lysgaard 2007 \| A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands Gauvin et al. 2014 \| A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands Goodson et al. 2014 \| Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand Mendoza and Villegas 2013 \| A multi-space sampling heuristic for the vehicle routing problem with stochastic demands Mendoza et al. 2016 \| A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints