OPTIMIZACIJA KOLONIJOM MRAVA
Abstract
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.
Fields of Study & Subjects
Metaheuristic Optimization Algorithms Research
Vehicle Routing Optimization Methods
Advanced Multi-Objective Optimization Algorithms
Publication details
- Journal / source
- Zbornik radova Fakulteta tehničkih nauka u Novom Sadu
- Volume
- 40
- Issue
- 11
- Pages
- 1195–1198
- Publication date
- 2 January 2026