Problem variant

MC-VRPSD: Multicompartment vehicle routing problem with stochastic demands

Acronym	MC-VRPSD
Title	Multicompartment vehicle routing problem with stochastic demands
Criterion	MIN
Description	MC-VRPSD consists of designing transportation routes to satisfy the uncertain demands of a set of customers for several products that, because of incompatibility constraints, must be loaded in independent vehicle compartments

Datasets	Mendoza et al. 2010
References	Goodson 2014 \| A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands Mendoza et al. 2010 \| A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands Mendoza et al. 2011 \| Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands