Performance Analysis and Tuning for Parallelization of Ant Colony Optimization by Using OpenMP

Abstract : Ant colony optimization algorithm (ACO) is a soft computing metaheuristic that belongs to swarm intelligence methods. ACO has proven a well performance in solving certain NP-hard problems in polynomial time. This paper proposes the analysis, design and implementation of ACO as a parallel metaheuristics using the OpenMP framework. To improve the efficiency of ACO parallelization, different related aspects are examined, including scheduling of threads, race hazards and efficient tuning of the effective number of threads. A case study of solving the traveling salesman problem (TSP) using different configurations is presented to evaluate the performance of the proposed approach. Experimental results show a significant speedup in execution time for more than 3 times over the sequential implementation.
Complete list of metadatas

https://hal.inria.fr/hal-01444506
Contributor : Hal Ifip <>
Submitted on : Tuesday, January 24, 2017 - 10:41:56 AM
Last modification on : Monday, February 25, 2019 - 12:34:02 PM
Long-term archiving on : Tuesday, April 25, 2017 - 2:01:39 PM

File

978-3-319-24369-6_6_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Ahmed Abouelfarag, Walid Aly, Ashraf Elbialy. Performance Analysis and Tuning for Parallelization of Ant Colony Optimization by Using OpenMP. 14th Computer Information Systems and Industrial Management (CISIM), Sep 2015, Warsaw, Poland. pp.73-85, ⟨10.1007/978-3-319-24369-6_6⟩. ⟨hal-01444506⟩

Share

Metrics

Record views

87

Files downloads

234