IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v40y1994i10p1276-1290.html
   My bibliography  Save this article

A Tabu Search Heuristic for the Vehicle Routing Problem

Author

Listed:
  • Michel Gendreau

    (Centre de recherche sur les transports Université de Montréal, C.P. 6128, succursale A, Montréal, Québec, Canada H3C 3J7)

  • Alain Hertz

    (Département de mathématiques, École Polytechnique Fédérale de Lausanne, Ecublens, CH-1015 Lausanne, Switzerland)

  • Gilbert Laporte

    (Centre de recherche sur les transports Université de Montréal, C.P. 6128, succursale A, Montréal, Québec, Canada H3C 3J7)

Abstract

The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algorithm considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route and reinserting it into another route. This is done by means of a generalized insertion procedure previously developed by the authors. During the course of the algorithm, infeasible solutions are allowed. Numerical tests on a set of benchmark problems indicate that tabu search out performs the best existing heuristics, and TABUROUTE often produces the best known solutions.

Suggested Citation

  • Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    • Handle: RePEc:inm:ormnsc:v:40:y:1994:i:10:p:1276-1290
    DOI: 10.1287/mnsc.40.10.1276
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.40.10.1276
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.40.10.1276?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:ormnsc:v:40:y:1994:i:10:p:1276-1290. 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.