Abstract: The Travelling Salesman Problem is one of the most extensively studied combinatorial optimizations, where we find the best solution of the given problem. It is an NP-Hard problem, which can ...