Ant Colony Optimization for Solving Tsp with Sub-Route Elimination Constraints on Turkiye Map
Loading...
Date
2025
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Turkic World Mathematical Soc
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
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 Turkiye, it is aimed to plan the best route.
Description
Keywords
Sub-Route Elimination Constraint, 68T20, Ant Colony Algorithm, Symmetric Traveling Salesman Problem, Metaheuristics, 90C27, Artificial Intelligence
Fields of Science
Citation
WoS Q
Scopus Q
Source
Turkish World Mathematical Society Journal of Applied and Engineering Mathematics
Volume
15
Issue
12
Start Page
2742
End Page
2751
