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

A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows

Author

Listed:
  • Christophe Duhamel

    (Laboratoire d'Informatique et de Modélisation des Systémes, ISIMA, B.P. 125, 63173 Aubiére Cedex, France)

  • Jean-Yves Potvin

    (Département d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succursale Centre-Ville, Montréal, Québec H3C 3J7, Canada and Centre de recherche sur les transports, Université de Montréal, C.P. 6728, succursale Centre-Ville, Montréal, Québec H3C 3J7, Canada)

  • Jean-Marc Rousseau

    (Département d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succursale Centre-Ville, Montréal, Québec H3C 3J7, Canada and Giro Inc., 75 rue Port-Royal Est, Montréal, Québec H3L 3T1, Canada)

Abstract

This article describes a tabu search heuristic for the vehicle routing problem with backhauls and time windows. In this problem, the set of customers is partitioned into two subsets: linehaul customers where a given quantity of goods is delivered from a central depot, and backhaul customers where a given quantity of goods is collected and transported to the depot. Mixed routes with both linehaul and backhaul customers are constructed. A variant of this problem is examined where linehauls must precede bachhauls on each route. Furthermore, the time of beginning of service at each customer location must occur within a particular time interval. Computational results are reported on a standard set of test problems, and comparisons are made with other heuristic approaches and with optimal solutions.

Suggested Citation

  • Christophe Duhamel & Jean-Yves Potvin & Jean-Marc Rousseau, 1997. "A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows," Transportation Science, INFORMS, vol. 31(1), pages 49-59, February.
    • Handle: RePEc:inm:ortrsc:v:31:y:1997:i:1:p:49-59
    DOI: 10.1287/trsc.31.1.49
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.31.1.49
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.31.1.49?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:31:y:1997:i:1:p:49-59. 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.