Problem variant
Properties
| Acronym | VRPSD-DC (PP) |
| Title | Vehicle routing problem with stochastic demands and duration constraints (piecewise linear penalty formulation) |
| Criterion | MIN |
| Description | The VRPSD-DC consists in finding the set of routes minimal expected cost to service the uncertain demands of a set of customers. Routes are subject to a maximum duration constraint. In this formulation of the problem, expected violations to the duration constraints are penalized in the objective function using a piecewise penalty function (PP). |