Travelling salesperson problem, Iterative Hill Climbing, 2-Opt Local Search Algorithm, General Purpose Graphical Processing units
1 article · search the full text for this term
-
Parallelization of Metaheuristics for the Optimization of Travelling Salesman Problem
Abstract: Travelling salesman problem is a combinatorial NP-Hard Problem. It has vast number of applications in many other fields like engineering, transportation and logistics. In the area of combinatorial Optimization Problems, it is one of the most studied problem. This Problem is acting as benchmark for many other NP-Hard Problems. Even for 20 cities CPU’s takes 100’s of years to get the optimal solution. So, for computing NP-Hard problems we require …
Published in Recent Trends in Parallel Computing · Vol. 8, Issue 2, 2021 · pp. 20–26 Read article