IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v25y1991i3p188-200.html
   My bibliography  Save this article

The Simultaneous Origin-Destination Assignment and Vehicle Routing Problem

Author

Listed:
  • 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)

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.

Suggested Citation

  • François Soumis & Michel Sauvé & Louis Le Beau, 1991. "The Simultaneous Origin-Destination Assignment and Vehicle Routing Problem," Transportation Science, INFORMS, vol. 25(3), pages 188-200, August.
    • Handle: RePEc:inm:ortrsc:v:25:y:1991:i:3:p:188-200
    DOI: 10.1287/trsc.25.3.188
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.25.3.188
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.25.3.188?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:25:y:1991:i:3:p:188-200. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.