Branch and price for the vehicle routing problem with discrete split deliveries and time windows
Abstract
We develop a branch-and-price algorithm for the vehicle routing problem with discrete split deliveries and time windows. The pricing subproblem is solved via dynamic programming, and branching strategies are designed to handle the combinatorial structure of split deliveries. Computational results demonstrate effectiveness on benchmark instances.
BibTeX
@article{salani2011branch,
title={Branch and price for the vehicle routing problem with discrete split deliveries and time windows},
author={Salani, Matteo and Vacca, Ilaria},
journal={European Journal of Operational Research},
volume={213},
number={3},
pages={470--477},
year={2011},
publisher={North-Holland}
}