This paper considers a vehicle routing problem with full loads and time limit constraints. This problem can be formulated as an asymmetrical travelling salesman problem with two types of restrictions. When these restrictions are not too stringent, the problem can be solved optimally for relatively large sizes.
Published November 1985 , 15 pages
This cahier was revised in February 1987