IDEAS home Printed from https://ideas.repec.org/a/igg/jsds00/v1y2010i2p82-92.html
   My bibliography  Save this article

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

Author

Listed:
  • Gilbert Laporte

    (HEC Montréal, Canada)

Abstract

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

Suggested Citation

  • Gilbert Laporte, 2010. "The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization," International Journal of Strategic Decision Sciences (IJSDS), IGI Global, vol. 1(2), pages 82-92, April.
    • Handle: RePEc:igg:jsds00:v:1:y:2010:i:2:p:82-92
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jsds.2010040104
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bismark Singh & Lena Oberfichtner & Sergey Ivliev, 2023. "Heuristics for a cash-collection routing problem with a cluster-first route-second approach," Annals of Operations Research, Springer, vol. 322(1), pages 413-440, March.

    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:igg:jsds00:v:1:y:2010:i:2:p:82-92. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.