Models, relaxations and exact approaches for the capacitated vehicle routing problem

Abstract

In this paper we review the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered. These algorithms have considerably increased the size of VRPs that can be solved with respect to earlier… (More)
DOI: 10.1016/S0166-218X(01)00351-1

Topics

3 Figures and Tables

Statistics

050100'02'04'06'08'10'12'14'16'18
Citations per Year

760 Citations

Semantic Scholar estimates that this publication has 760 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Toth2002ModelsRA, title={Models, relaxations and exact approaches for the capacitated vehicle routing problem}, author={Paolo Toth and Daniele Vigo}, journal={Discrete Applied Mathematics}, year={2002}, volume={123}, pages={487-512} }