Computer Science > Artificial Intelligence
[Submitted on 5 Feb 2023 (v1), last revised 3 Jul 2024 (this version, v5)]
Title:A Convex Hull Cheapest Insertion Heuristic for the Non-Euclidean TSP
View PDF HTML (experimental)Abstract:The convex hull cheapest insertion heuristic produces good solutions to the Euclidean Traveling Salesperson Problem, but it has never been extended to the non-Euclidean problem. This paper uses multidimensional scaling to first project the points from a non-Euclidean space into a Euclidean space, enabling the generation of a convex hull that initializes the algorithm. To evaluate the proposed algorithm, non-Euclidean spaces are created by adding separators to the TSPLIB data-set, or by using the L1 norm as a metric.
Submission history
From: Mithun Goutham [view email][v1] Sun, 5 Feb 2023 13:56:19 UTC (231 KB)
[v2] Sat, 27 Jan 2024 19:29:15 UTC (897 KB)
[v3] Thu, 27 Jun 2024 09:09:14 UTC (1,197 KB)
[v4] Mon, 1 Jul 2024 15:56:49 UTC (1,203 KB)
[v5] Wed, 3 Jul 2024 02:54:12 UTC (1,200 KB)
Current browse context:
cs.AI
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.