Comparison of Swarm and Graph Algorithms for Solving Travelling Salesman Problems
Stefan Eggenschwiler, Maja Spahic-Bogdanovic, Thomas Hanne, Rolf Dornberger · 2020
In this paper, we compare different nature-inspired, swarm algorithms (4 variants of ACO and PSO) and five graph algorithms for solving the travelling salesman problem based on defined key metrics. We focus on describing the experimental setup including input data and the outline of the metrics applied in the analysis part. The aim is to compare the performance of metaheuristics (nature-based) algorithms with traditional algorithms used for solving travelling salesman problems (TSP).