Solving traveling salesman problem via clustering and new algorithm for merging tours
Keywords: ETSP, TSP, clustering, k-means, combining cycles
Abstract: The use of clustering-based methods to solve the large-scale Traveling Salesman Problem is a common approach among researchers. This approach consists of three main stages: clustering, solving the problem within each cluster, and combining the solutions into a single cycle. Our focus is on the last stage. An effective algorithm has been introduced for pairwise combinations of cycles. Additionally, the connection between the error and the stage of solving subproblems in the process of merging solutions has been investigated.
Submission Number: 50
Loading