Abstract
The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most promising ACO algorithms. In this paper, we apply cAS to solving QAP. We focus our main attention on the effects of applying local search and parallelization of the cAS. Results show promising performance of cAS on QAP.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.: Ant colony optimization with cunning ant. Transactions of the Japanese Society for Artificial Intelligence 22(1), 29–36 (2007)
Stützle, T., Hoos, H.: Max-min ant system. Future Generation Computer Systems 16(9), 889–914 (2000)
Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23, 555–565 (1976)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Massachusetts (2004)
Tsutsui, S., Liu, L.: Solving quadratic assignment problems with the cunning ant system. In: Proc. of the 2007 CEC (to appear)
Acan, A.: An external memory implementation in ant colony optimization. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 73–84. Springer, Heidelberg (2004)
Acan, A.: An external partial permutations memory for ant colony optimization. In: Proc. of the 5th European Conf. on Evolutionary Computation in Combinatorial Optimization, pp. 1–11 (2005)
Wiesemann, W., Stützle, T.: An experimental study for the the quadratic assignment problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 179–190. Springer, Heidelberg (2006)
QAPLIB-A Quadratic Assignment Problem Library, http://www.opt.math.tu-graz.ac.at/qaplib/
Taillard, É.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17, 443–455 (1991)
Taillard, E.: Robust tabu search implementation, http://mistic.heig-vd.ch/taillard/
Cantu-Paz, E.: Efficient and Accurate Parallel Genetic Algorithm. Kluwer Academic Publishers, Boston (2000)
Tsutsui, S., Fujimoto, Y., Ghosh, A.: Forking gas: Gas with search space division schemes. Evolutionary Computation 5(1), 61–80 (1997)
Manfrin, M., Birattari, M., Stützle, T., Dorigo, M.: Parallel ant colony optimization for the traveling salesman problems. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 224–234. Springer, Heidelberg (2006)
Sun Microsystems, Inc.: Java 2 Platform, Standard Edition, v1.4.2 at API Specification, http://java.sun.com/j2se/1.4.2/docs/api/
Apache Software Foundation: Apache HTTP server project, http://httpd.apache.org/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsutsui, S. (2007). Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization. In: Ghosh, A., De, R.K., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2007. Lecture Notes in Computer Science, vol 4815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77046-6_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-77046-6_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77045-9
Online ISBN: 978-3-540-77046-6
eBook Packages: Computer ScienceComputer Science (R0)