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

An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints

Author

Listed:
  • Yiannis A. Koskosidis

    (The City College of CUNY, New York, New York, 10031)

  • Warren B. Powell

    (Princeton University, Princeton, New Jersey 08544)

  • Marius M. Solomon

    (College of Business Administration, Northeastern University, Boston, Massachusetts 02155)

Abstract

The Vehicle Routing and Scheduling Problem with Time Window constraints is formulated as a mixed integer program, and optimization-based heuristics which extend the cluster-first, route-second algorithm of Fisher and Jaikumar are developed for its solution. We present a new formulation based on the treatment of the time window constraints as soft constraints that can be violated at a cost and we heuristically decompose the problem into an assignment/clustering component and a series of routing and scheduling components. Numerical results based on randomly generated and benchmark problem sets indicate that the algorithm compares favorably to state-of-the-art local insertion and improvement heuristics.

Suggested Citation

  • Yiannis A. Koskosidis & Warren B. Powell & Marius M. Solomon, 1992. "An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints," Transportation Science, INFORMS, vol. 26(2), pages 69-85, May.
    • Handle: RePEc:inm:ortrsc:v:26:y:1992:i:2:p:69-85
    DOI: 10.1287/trsc.26.2.69
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.26.2.69
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.26.2.69?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:26:y:1992:i:2:p:69-85. 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.