The Traveling Salesman Problem is the famous optimization problem in the NP-hard class. Many problems with applications in computer science and engineering can be modeled using the Traveling Salesman Problem. In this study, ...