Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems

Gilbert Laporte, Yves Nobert and Serge Taillefer
Additional contact information
Gilbert Laporte: Université de Montréal, Montréal, Québec, Canada
Yves Nobert: Université du Québec à Montréal, Montreal, Québec, Canada
Serge Taillefer: Université de Montréal, Montreal, Québec, Canada

Transportation Science, 1988, vol. 22, issue 3, 161-172

Abstract: This paper examines a class of asymmetrical multi-depot vehicle routing problems and location-routing problems, under capacity or maximum cost restrictions. By using an appropriate graph representation, and then a graph extension, the problems are transformed into equivalent constrained assignment problems. Optimal solutions are then found by means of a branch and bound tree. Problems involving up to 80 nodes can be solved without difficulty.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (45)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.3.161 (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:ortrsc:v:22:y:1988:i:3:p:161-172

Access Statistics for this article

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