ANALYZING GA AND ACO TO SOLVE THE PROBLEM OF TRAVELING SALESMEN

Abstract

Despite the widespread and quick advancements in technology today, several complex real-world NP problems continue to baffle researchers. The Travelling Salesman Problem (TSP), Knapsack Problem, Graph Colouring, Vehicle Routing, and other similarly complex puzzles have attracted the interest of numerous academics over the past few decades. TSP has shown to be a useful testing ground for comparing a variety of both old and new algorithms. The TSP issue appears to be fairly straightforward; however it is actually one of the more challenging traditional optimisation problems. It has been demonstrated that trying to solve TSP using standard methods may take more years than we have lived on the planet. Consequently, using heuristic techniques is the only practical choice left.