Performance Analysis and Tuning for Parallelization of Ant Colony Optimization by Using OpenMP - Computer Information Systems and Industrial Management Access content directly
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
978-3-319-24369-6_6_Chapter.pdf (476.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01444506 , version 1 (24-01-2017)

Licence

Attribution

Identifiers

Cite

Ahmed A. Abouelfarag, Walid Mohamed Aly, Ashraf Gamal 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⟩
77 View
250 Download

Altmetric

Share

Gmail Facebook X LinkedIn More