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

Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing

Author

Listed:
  • Thomas R. Sexton

    (State University of New York, Stony Brook, New York)

  • Lawrence D. Bodin

    (University of Maryland, College Park, Maryland)

Abstract

This is the second part of a two-part study treating the single vehicle many-to-many pickup and delivery problem with desired delivery times. Part I detailed the use of the single vehicle algorithm in a multivehicle context, presented a mathematical formulation of the problem, described the application of Benders' decomposition procedure to attack the problem through alternation between a routing, or sequencing, component and a scheduling component, and illustrated a noniterative optimal algorithm for the scheduling subproblem. This part focuses on the routing subproblem, presenting a heuristic algorithm for finding an initial route and a second heuristic algorithm for improving the route sequence. It then integrates the routing and scheduling algorithms, and describes the results of a number of computational experiments on actual data. An example of the complete routing and scheduling algorithm appears as an appendix.

Suggested Citation

  • Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing," Transportation Science, INFORMS, vol. 19(4), pages 411-435, November.
    • Handle: RePEc:inm:ortrsc:v:19:y:1985:i:4:p:411-435
    DOI: 10.1287/trsc.19.4.411
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.19.4.411
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.19.4.411?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:19:y:1985:i:4:p:411-435. 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.