PARALLELIZATION STRATEGY FOR ANT COLONY OPTIMIZATION METAHEURISTIC
Štefan Baboš
Abstract
Štefan Baboš
Abstract
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Parallel metaheuristic, Metaheuristic, Ant colony optimization algorithms, Travelling salesman problem, Computer science, Extremal optimization, Ant colony, Mathematical optimization