Abstract
Recently symmetric multi processing (SMP) has become available at a reasonable cost. In this paper, we propose several types of parallel ACO algorithms with SMP for solving the quadratic assignment problem (QAP). These models include the master-slave models and the island models. We evaluated each parallel algorithm with a condition that the run time for each parallel algorithm and the base sequential algorithm are the same. The results suggest that using the master-slave model with increased iteration of ACO algorithms is promising in solving QAPs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Stützle, T.: Parallelization strategies for ant colony optimization. In: 5th International Conf. on Parallel Problem Solving for Nature (PPSN-V), pp. 722–731 (1998)
Manfrin, M., Birattari, M., Stützle, T., Dorigo, M.: Parallel ant colony optimization for the traveling salesman problems. In: Ant Colony Optimization and Swarm Intelligence, 5th International Workshop, ANTS 2006, pp. 224–234 (2006)
Tsutsui, S.: cAS: Ant colony optimization with cunning ants. In: Proc. of the 9th Int. Conf. on Parallel Problem Solving from Nature (PPSN IX), pp. 162–171 (2006)
Tsutsui, S.: Cunning ant system for quadratic assignment problem with local search and parallelization. In: Ghosh, A., De, R.K., Pal, S.K. (eds.) PReMI 2007. LNCS, vol. 4815, pp. 269–278. Springer, Heidelberg (2007)
Randall, M., Lewis, A.: A parallel implementation of ant colony optimization. Journal of Parallel and Distributed Computing 62(9), 1421–1432 (2002)
Benkner, S., Doerner, K., Hartl, R., Kiechle, G., Lucka, M.: Communication strategies for parallel cooperative ant colony optimization on clusters and grids. In: Complimentary Proc. of PARA 2004 Workshop on State-of-the-art in Scientific Computing, pp. 3–12 (2005)
Bullnheimer, B., Kotsis, G., Strauss, C.: Parallelization strategies for the ant system. High Performance Algorithms and Software in Nonlinear Optimization, 87–100 (1998)
Middendorf, M., Reischle, F., Schmeck, H.: Multi colony ant alorithms. Journal of Heuristics 8(3), 3005–3200 (2002)
Lv, Q., Xia, X., Qian, P.: A parallel aco approach based on one pheromone matrix. In: Ant Colony Optimization and Swarm Intelligence, 5th International Workshop, ANT 2006, pp. 332–339 (2006)
Talbi, E., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Generation Computer System 17, 441–449 (2001)
Stützle, T., Hoos, H.: MAX-MIN ant system. Future Generation Computer Systems 16(9), 889–914 (2000)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Trans. on SMC-Part B 26(1), 29–41 (1996)
Taillard, É.D.: The robust taboo search code, http://mistic.heig-vd.ch/taillard/
Taillard, É.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17, 443–455 (1991)
QAPLIB – A Quadratic Assignment Problem Library, http://www.seas.upenn.edu/qaplib/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsutsui, S. (2008). Parallel Ant Colony Optimization for the Quadratic Assignment Problems with Symmetric Multi Processing. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2008. Lecture Notes in Computer Science, vol 5217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87527-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-87527-7_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87526-0
Online ISBN: 978-3-540-87527-7
eBook Packages: Computer ScienceComputer Science (R0)