Abstract
This paper describes a branch and bound algorithm for a general class of asymmetrical vehicle routeing problems. Vehicle routes start and end at a central depot. Visits are made to nodes grouped into clusters: every cluster must receive a minimum number of visits. But not all nodes must be visited: there are specified nodes and non-specified nodes. Vehicle routes are also constrained by capacity and distance restrictions. The problem is formulated as an integer linear program. It is then solved by a branch and bound algorithm which exploits the unimodular structure of the subproblems. Computational results are reported.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Laporte, G., Mercure, H. & Nobert, Y. A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems. J Oper Res Soc 43, 469–481 (1992). https://doi.org/10.1057/jors.1992.73
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1992.73