Optimal Routing under Capacity and Distance Restrictions
Gilbert Laporte, Yves Nobert, Martin Desrochers
Operations Research · 1985 · Volume 33 · Issue 5
Abstract
This paper describes an integer linear programming algorithm for vehicle routing problems involving capacity and distance constraints. The method uses constraint relaxation and a new class of subtour elimination constraints. Two versions of the algorithm are presented, depending upon the nature of the distance matrix. Exact solutions are obtained for problems involving up to sixty cities.
Keywords
483 distance algorithms, 491 traveling salesman
Enable JavaScript for citation tools and additional paper interactions.