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

An Algorithm for Combining Truck Trips

Author

Listed:
  • B. Gavish

    (Technion, Israel Institute of Technology, Haifa, Israel)

  • P. Schweitzer

    (IBM T. J. Watson Research Center, Yorktown Heights, New York)

Abstract

This paper presents a method for serial combination of truck trips to minimize the total cost of deadheading, subject to constraints on the allowed combinations. The problem is initially formulated as an integer transportation problem with extra compatibility constraints, and then reduced to a classical transportation problem. Modifications of the classical algorithm led to a fifty-fold reduction in computer time, and permit solution of a 1000 × 1000 problem in less than two minutes of computer time. Implementation of the method led to considerable cost savings over the older manual procedure.

Suggested Citation

  • B. Gavish & P. Schweitzer, 1974. "An Algorithm for Combining Truck Trips," Transportation Science, INFORMS, vol. 8(1), pages 13-23, February.
  • Handle: RePEc:inm:ortrsc:v:8:y:1974:i:1:p:13-23
    DOI: 10.1287/trsc.8.1.13
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.8.1.13
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.8.1.13?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Caballini, Claudia & Sacone, Simona & Saeednia, Mahnam, 2016. "Cooperation among truck carriers in seaport containerized transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 38-56.

    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:8:y:1974:i:1:p:13-23. 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.