Reducing the time needed to solve a traveling salesman problem by clustering with a Hierarchy-based algorithm

Anahita Sabagh Nejad (University of Debrecen)
Gabor Fazekas (University of Debrecen)

IAES International Journal of Artificial Intelligence (IJ-AI)
Vol 12, No 4: December 2023

In this study, we compare a cluster-based whale optimization algorithm (WOA) with an uncombined method to find a more optimized solution for a traveling salesman problem (TSP). The main goal is to reduce the time of solving a TSP. First, we solve the TSP with the Whale optimization algorithm, later we solve it with the combined method of solving TSP which uses the clustering method, called BIRCH (balanced iterative reducing and clustering using hierarchies). Birch builds a clustering feature (CF) tree and then applies one of the clustering methods (for ex. K-means) to cluster data. Experiments performed on three datasets show that the convergence time improves by using the combined algorithm.