ANT COLONY OPTIMIZATION
DOI:
https://doi.org/10.24867/32JV01JosicKeywords:
Ant Colony Optimization , Traveling Salesman Problem, PythonAbstract
In this paper, the Ant Colony Optimization (ACO) algorithm, used for solving complex optimization problems, is investigated. Special focus is placed on the Traveling Salesman Problem (TSP), where the objective is to find the shortest possible route that passes through a given set of cities. The practical part of the study was conducted in the Python programming language. The ACO algorithm was implemented, various parameters were experimented with, and the algorithm's performance was analyzed. The results demonstrated the efficiency and adaptability of the ACO algorithm, as well as the impact of different parameters on its performance.
References
[1] Dorigo, M., Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy, 1992.
[2] Dorigo, M., and Gambardella, L.M., Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem, IEEE Transactions on Evolutionary Computation, 1, 53-66, (1997).
[3] Dorigo, M., and Gambardella, L.M., Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem, IEEE Transactions on Evolutionary Computation, 1, 53-66, (1997).
[4] Lučić, P., and Teodorović, D., Transportation Modeling: An Artificial Life Approach, Proceedings of the 14th IEEE “International Conference on Tools with Artificial Intelligence”, pp. 216-223, November 4-6, 2002 Washington D.C.
[5] Teodorović, D., Šelmić, M., Računarska inteligencija u saobraćaju, Beograd, 2019.
