A Two Stage Method for the Multiple Traveling Salesman Problem

Azcarie Manuel Cabrera Cuevas, Jania Astrid Saucedo Martínez and José Antonio Marmolejo Saucedo
Additional contact information
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

International Journal of Applied Metaheuristic Computing (IJAMC), 2020, vol. 11, issue 3, 79-91

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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJAMC.2020070104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:11:y:2020:i:3:p:79-91

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().