IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v11y2020i3p79-91.html
   My bibliography  Save this article

A Two Stage Method for the Multiple Traveling Salesman Problem

Author

Listed:
  • Azcarie Manuel Cabrera Cuevas

    (Universidad Autónoma de Nuevo León, San Nicolás de los Garza, Mexico)

  • Jania Astrid Saucedo Martínez

    (Universidad Autónoma de Nuevo León, San Nicolás de los Garza, Mexico)

  • José Antonio Marmolejo Saucedo

    (Universidad Panamericana, Facultad de Ingeniería, Ciudad de México, Mexico)

Abstract

The variation of the traveling salesman problem (TSP) with multiple salesmen (m-TSP) has been studied for many years resulting in diverse solution methods, both exact and heuristic. However, the high difficulty level on finding optimal (or acceptable) solutions has opposed the many efforts of doing so. The proposed method regards a two stage procedure which implies a modified version of the p-Median Problem (PMP) alongside the TSP, making a partition of the nodes into subsets that will be assigned to each salesman, solving it with Branch & Cut (B&C), in the first stage. This is followed by the routing, applying an Ant Colony Optimization (ACO) metaheuristic algorithm to solve a TSP for each subset of nodes. A case study was reviewed, detailing the positioning of five vehicles in strategic places in the Mexican Republic.

Suggested Citation

  • Azcarie Manuel Cabrera Cuevas & Jania Astrid Saucedo Martínez & José Antonio Marmolejo Saucedo, 2020. "A Two Stage Method for the Multiple Traveling Salesman Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 11(3), pages 79-91, July.
    • Handle: RePEc:igg:jamc00:v:11:y:2020:i:3:p:79-91
    as

    Download full text from publisher

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

    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:jamc00:v:11:y:2020:i:3:p:79-91. 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.