PARALLELIZATION STRATEGY FOR ANT COLONY OPTIMIZATION METAHEURISTIC

Ant Colony Optimization (ACO) is a metaheuristic for complex combinatorial optimization problems. Recent research in ACO algorithms has strongly focused on improving the performance of ACO algorithms. This paper presents the possibility of speeding up the algorithm by using parallel processing and presents a parallelization strategy for ACO metaheuristic.