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

Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search

Author

Listed:
  • J. N. Hooker

    (Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

  • N. R. Natraj

    (Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

Abstract

We modify the classical chain decomposition model for vehicle routing in order to formulate a very general class of vehicle routing and scheduling problems with time windows, in which vehicles may pick up loads while on the way to deliver others. We use the model as a framework for a tabu search heuristic that exploits the constraint structure these problems have in common while accommodating complex side constraints and objective functions. We test the heuristic computationally on several random problems and a problem supplied by the U.S. Military Airlift Command.

Suggested Citation

  • J. N. Hooker & N. R. Natraj, 1995. "Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search," Transportation Science, INFORMS, vol. 29(1), pages 30-44, February.
    • Handle: RePEc:inm:ortrsc:v:29:y:1995:i:1:p:30-44
    DOI: 10.1287/trsc.29.1.30
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.29.1.30
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.29.1.30?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:29:y:1995:i:1:p:30-44. 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.