Ant colony optimization for solving TSP with sub-route elimination constraints on Türkiye map

Abstract

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, one of the artificial intelligence techniques, ant colony method, is used to solve the traveling salesman problem. In the study applied on the map of T¨urkiye, it is aimed to plan the best route.