The aim of this paper is to develop an exact algorithm for the asymmetrical distance constrained vehicle routing problem. The problem is solved by means of a branch and bound tree in which subproblems are modified assignment problems subject to some restrictions. Computational results for problems involving up to 100 nodes are reported.
Paru en mars 1985 , 21 pages
Ce cahier a été révisé en juin 1986