IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v45y1997i3p395-406.html
   My bibliography  Save this article

An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation

Author

Listed:
  • Niklas Kohl

    (The Technical University of Denmark, Lyngby, Denmark)

  • Oli B. G. Madsen

    (The Technical University of Denmark, Lyngby, Denmark)

Abstract

Our paper presents a new optimization method for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the Vehicle Routing Problem, where the service of a customer must start within a given time interval—a so-called time window. Our method is based on a Lagrangian relaxation of the constraint set requiring that each customer must be serviced. The master problem consists of finding the optimal Lagrangian multipliers and the subproblem is a Shortest Path Problem with Time Windows and Capacity Constraints. The optimal multipliers are found using a method exploiting the benefits of subgradient methods as well as a bundle method. The method has been implemented and tested on a series of well-known benchmark problems of size up to 100 customers. Our algorithm turns out to be very competitive compared to algorithms considered in the literature, and we have succeeded in solving several previously unsolved problems.

Suggested Citation

  • Niklas Kohl & Oli B. G. Madsen, 1997. "An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation," Operations Research, INFORMS, vol. 45(3), pages 395-406, June.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:3:p:395-406
    DOI: 10.1287/opre.45.3.395
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.3.395
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.3.395?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
    ---><---

    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:oropre:v:45:y:1997:i:3:p:395-406. 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.