In this paper we consider the Cumulative Capacitated Vehicle Routing Problem (CCVRP), which is a variation of the well-known Capacitated Vehicle Routing Problem (CVRP). In this problem, the traditional objective of minimizing total distance or time traveled by the vehicles is replaced by...

This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing <p> Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived <p> from precedence constraints in the Asymmetric Traveling Salesman Problem with Time <p> Windows and to k-path cuts for...</p></p></p>

In this article we introduce a new exact solution approach to the Capacitated Vehicle Routing Problem with Stochastic Demands (CVRPSD). In particular, we consider the case where all customer demands are distributed independently and where each customer’s demand follows a Poisson distribution....