The Simultaneous Origin-Destination Assignment and Vehicle Routing Problem

François Soumis, Michel Sauvé and Louis Le Beau
Additional contact information
François Soumis: GERAD and École Polytechnique, 2900, boul. Édouard-Monpetit, Case postale 6079, Succ. A, Montréal (Québec) Canada, H3C 3A7
Michel Sauvé: GERAD and École des Hautes Études Commerciales, 5255, avenue Decelles, Montréal (Québec) Canada, H3T 1V6
Louis Le Beau: GERAD and École Polytechnique, 2900, boul. Édouard-Monpetit, Case postale 6079, Succ. A, Montréal (Québec) Canada, H3C 3A7

Transportation Science, 1991, vol. 25, issue 3, 188-200

Abstract: The problem we consider is that of preparing a minimum cost transportation plan by simultaneously solving the following two subproblems: first the assignment of units available at a series of origins to satisfy demand at a series of destinations and second, the design of vehicle tours to transport these units, when the vehicles have to be brought back to their departure point. We present a solution method for this problem using a minimum cost flow model followed by heuristic tour construction and improvement procedures. This approach allows large problems to be solved quickly, and solutions to large test problems have been shown to be 1% or 2% from the optimum. Results are presented for a problem involving the transport of 24,000 students working on an environmental cleanup project.

Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.25.3.188 (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:25:y:1991:i:3:p:188-200

Access Statistics for this article

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