Article
Version 1
Preserved in Portico This version is not peer-reviewed
TSP Algorithm based on Convex Hull Insertion Method
Version 1
: Received: 24 June 2024 / Approved: 25 June 2024 / Online: 25 June 2024 (10:25:15 CEST)
How to cite: Zheng, M. TSP Algorithm based on Convex Hull Insertion Method. Preprints 2024, 2024061760. https://doi.org/10.20944/preprints202406.1760.v1 Zheng, M. TSP Algorithm based on Convex Hull Insertion Method. Preprints 2024, 2024061760. https://doi.org/10.20944/preprints202406.1760.v1
Abstract
The algorithm described in this paper inherits the concepts of layered fusion, insertion, and set from four convex hull-based heuristic algorithms. It summarizes relevant definitions and theorems, proposes valuable research hypotheses, combines grouping and insertion, and innovatively introduces the practice of "grouped insertion."
Keywords
TSP; Convex Hull; Improved Algorithm
Subject
Computer Science and Mathematics, Data Structures, Algorithms and Complexity
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment