IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

A Tabu Search Heuristic for the Vehicle Routing Problem

Listed author(s):
  • 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)

Registered author(s):

    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.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 40 (1994)
    Issue (Month): 10 (October)
    Pages: 1276-1290

    in new window

    Handle: RePEc:inm:ormnsc:v:40:y:1994:i:10:p:1276-1290
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.