A Multi-Phase Method for Euclidean Traveling Salesman Problems

A Multi-Phase Method for Euclidean Traveling Salesman Problems

The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>n&...

Full description

Bibliographic Details
Main Authors: Víctor Hugo Pacheco-Valencia, Nodari Vakhania, Frank Ángel Hernández-Mira, José Alberto Hernández-Aguilar
Format: Article
Language:English
Published: MDPI AG 2022-08-01
Series:Axioms
Subjects:
traveling salesman problem
heuristic algorithm
time complexity
convex hull
two-dimensional Euclidean space
optimization
Online Access:https://www.mdpi.com/2075-1680/11/9/439

Internet

https://www.mdpi.com/2075-1680/11/9/439

Similar Items