The discrete time window assignment vehicle routing problem
We provide a time window assignment model in a VRP setting with demand uncertainty. We develop a state-of-the-art exact branch-price-and-cut method. We develop column generation heuristics for good solutions in large instances. Numerical experiments show that using multiple demand scenarios is better than one.
time window assignment vehicle routing column generation uncertain demand