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&...
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: | |
Online Access: | https://www.mdpi.com/2075-1680/11/9/439 |
Similar Items
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
by: Yongliang Lu, et al.
Published: (2022-06-01) -
Simulation and hardware implementation of travelling salesman problem /
by: 454156 Ang, Chin Keong
Published: (2002) -
The traveling salesman : computational solutions for TSP applications /
by: 304805 Reinelt, Gerhard
Published: (1994) -
Review of Multiple Traveling Salesman Model and Its Application
by: ZHANG Shuohang, GUO Gaizhi
Published: (2022-07-01) -
The traveling salesman problem : a computational study /
by: Applegate, David L.
Published: (2007)