EventsThe 1st Online Conference on Algorithms
Event submissions
Published
with-doi10.3390/IOCA2021-10898 (registering DOI)
This submission belongs to the session B. Combinatorial Optimization, Graph and Network Algorithms of the event The 1st Online Conference on Algorithms
Published date
26 Sep, 2021
Academic Editor
author-avatarFrank Werner
Citation
Víctor Pacheco-Valencia, Nodari Vakhania, José Alberto Hernández, Juan Carlos Hernández-Gómez, <span>A Fast Algorithm for Euclidean Bounded Single-Depot Multiple Traveling Salesman Problem</span>, in Proceedings of The 1st Online Conference on Algorithms, 27 September–10 October 2021, MDPI: Basel, Switzerland, doi: 10.3390/IOCA2021-10898
Share
Email
FaceBook
Twitter
Linkedin

A Fast Algorithm for Euclidean Bounded Single-Depot Multiple Traveling Salesman Problem

Víctor Pacheco-Valencia 1
Nodari Vakhania 2
José Alberto Hernández 3
Juan Carlos Hernández-Gómez 4
1. Centro de Investigación en Ciencias UAEMor; Universidad Autónoma del Estado de Morelos, Av. Universidad 1001, Col.Chamilpa, post code 62209, Cuernavaca, Morelos, México.
2. Centro de Investigación en Ciencias UAEMor, Universidad Autónoma del Estado de Morelos, Cuernavaca 62209, Mexico
3. Facultad de Contaduría, Administración e Informática UAEMor; Universidad Autónoma del Estado de Morelos, Av. Universidad 1001, Col.Chamilpa, post code 62209, Cuernavaca, Morelos, México.
4. Facultad de Matemáticas UAGro; Universidad Autónoma de Guerrero, Carlos E. Adame No.54, Col.Garita, post code 39650, Acapulco, Guerrero, México.
Abstract
Keywords
Travelling Salesman Problem
Algorithm
time complexity