Reference Hub1
A Two Stage Method for the Multiple Traveling Salesman Problem

A Two Stage Method for the Multiple Traveling Salesman Problem

Azcarie Manuel Cabrera Cuevas, Jania Astrid Saucedo Martínez, José Antonio Marmolejo Saucedo
Copyright: © 2020 |Volume: 11 |Issue: 3 |Pages: 13
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781799802860|DOI: 10.4018/IJAMC.2020070104
Cite Article Cite Article

MLA

Cuevas, Azcarie Manuel Cabrera, et al. "A Two Stage Method for the Multiple Traveling Salesman Problem." IJAMC vol.11, no.3 2020: pp.79-91. http://doi.org/10.4018/IJAMC.2020070104

APA

Cuevas, A. M., Martínez, J. A., & Saucedo, J. A. (2020). A Two Stage Method for the Multiple Traveling Salesman Problem. International Journal of Applied Metaheuristic Computing (IJAMC), 11(3), 79-91. http://doi.org/10.4018/IJAMC.2020070104

Chicago

Cuevas, Azcarie Manuel Cabrera, Jania Astrid Saucedo Martínez, and José Antonio Marmolejo Saucedo. "A Two Stage Method for the Multiple Traveling Salesman Problem," International Journal of Applied Metaheuristic Computing (IJAMC) 11, no.3: 79-91. http://doi.org/10.4018/IJAMC.2020070104

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.