Abstract
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implementation. Our aim is to show that the shared memory approach is a competitive strategy for the parallelization of ACO algorithms. The sequential ACO algorithm on which are based both parallelization schemes is first described, followed by the parallelization strategies themselves. Through experiments, we compare speedup and efficiency measures on four TSP problems varying from 318 to 657 cities. We then discuss factors that explain the difference in performance of the two approaches. Further experiments are presented to show the performance of the shared memory implementation when varying numbers of ants are distributed among the available processors. In this last set of experiments, the solution quality obtained is taken into account when analyzing speedup and efficiency measures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.S., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
Randall, M., Lewis, A.: A Parallel Implementation of Ant Colony Optimization. Journal of Parallel and Distributed Computing. Academic Press Inc., London 62(2), 1421–1432 (2002)
Dorigo, M., Gambardella, L.M.: Ant colonies for the Traveling Salesman Problem. BioSystems 43, 73–81 (1997)
Bullnheimer, B., Kotsis, G., Strauss, C.: Parallelization Strategies for the Ant System. In: De Leone, R., Murli, A., Pardalos, P., Toraldo, G. (eds.) High Performance Algorithms and Software in Non-linear Optimization, pp. 87–100. Kluwer Academic Publishers, Dordrecht (1998)
Stützle, T.: Parallelization Strategies for Ant Colony Optimization. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 722–731. Springer, Heidelberg (1998)
Talbi, E.-G., Roux, O., Fonlupt, C., Robillard, D.: Parallel Ant Colonies for Combinatorial Optimization Problems. In: Rolim, J., Juan, S., Rico, P. (eds.) BioSP3 Workshop on Biologically Inspired Solutions to Parallel Processing Systems, IEEE IPPS/SPDP 1999 (Int. Parallel Processing Symposium / Symposium on Parallel and Distributed Processing). Springer, Heidelberg (1999)
Michel, R., Middendorf, M.: An Ant System for the Shortest Common Supersequence Problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in optimization, pp. 51–61 (1999)
Middendorf, M., Reischle, F., Schmeck, H.: Information Exchange in Multi Colony Ant Algorithms. In: Rolim, J.D.P. (ed.) IPDPS-WS 2000. LNCS, vol. 1800, pp. 645–652. Springer, Heidelberg (2000)
Barr, H., Hickman, B.: Reporting computational experiments with parallel algorithms: Issues, measures and experts’ opinions. ORSA Journal of Computing 5, 2–18 (1993)
Delisle, P., Gravel, M., Krajecki, M., Gagné, C., Price, W.L.: A Shared Memory Parallel Implementation of Ant Colony Optimization. Working Paper. Université du Québec à Chicoutimi (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delisle, P., Gravel, M., Krajecki, M., Gagné, C., Price, W.L. (2005). Comparing Parallelization of an ACO: Message Passing vs. Shared Memory. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2005. Lecture Notes in Computer Science, vol 3636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546245_1
Download citation
DOI: https://doi.org/10.1007/11546245_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28535-9
Online ISBN: 978-3-540-31898-9
eBook Packages: Computer ScienceComputer Science (R0)