Optimal Routing under Capacity and Distance Restrictions

Gilbert Laporte, Yves Nobert and Martin Desrochers
Additional contact information
Gilbert Laporte: École des Hautes Études Commerciales de Montréal, Québec, Canada
Yves Nobert: Université de Montréal, Québec, Canada
Martin Desrochers: Université de Montréal, Québec, Canada

Operations Research, 1985, vol. 33, issue 5, 1050-1073

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 (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (59)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.5.1050 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:33:y:1985:i:5:p:1050-1073

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().