Vehicle routing

Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios

The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands

The capacitated vehicle routing problem with stochastic demands (CVRPSD) is a variant of the deterministic capacitated vehicle routing problem where customer demands are random variables. While the most successful formulations for several …

The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem

The Capacitated Vehicle Routing Problem (CVRP) consists of finding the cheapest way to serve a set of customers with a fleet of vehicles of a given capacity. While serving a particular customer, each vehicle picks up its demand and carries its weight …

Robust branch-and-cut-and-price for the capacitated vehicle routing problem