Cunning ant system for quadratic assignment problem with local search and parallelization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4815 LNCS, Issue , 2007, Pages 269-278

  Tsutsui, Shigeyoshi ^a  

^a HANNAN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

CUNNING ANT SYSTEMS; PARALLELIZATION; QUADRATIC ASSIGNMENT;

PARALLEL ALGORITHMS;

EID: 38149105780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77046-6_33     Document Type: Conference Paper

References (17)

1. 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)
2. Tsutsui, S.: Ant colony optimization with cunning ant. Transactions of the Japanese Society for Artificial Intelligence 22(1), 29-36 (2007)
3. Stützle, T., Hoos, H.: Max-min ant system. Future Generation Computer Systems 16(9), 889-914 (2000)
4. Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23, 555-565 (1976)
5. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Massachusetts (2004)
6. Tsutsui, S., Liu, L.: Solving quadratic assignment problems with the cunning ant system. In: Proc. of the 2007 CEC (to appear)
7. 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)
8. 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)
9. 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)
10. QAPLIB-A Quadratic Assignment Problem Library, http://www.opt.math. tugraz.ac.at/qaplib/
11. Taillard, É.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17, 443-455 (1991)
12. Taillard, E.: Robust tabu search implementation, http://mistic.heig-vd. ch/taillard/
13. Cantu-Paz, E.: Efficient and Accurate Parallel Genetic Algorithm. Kluwer Academic Publishers, Boston (2000)
14. Tsutsui, S., Fujimoto, Y., Ghosh, A.: Forking gas: Gas with search space division schemes. Evolutionary Computation 5(1), 61-80 (1997)
15. 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ützte, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 224-234. Springer, Heidelberg (2006)
16. Sun Microsystems, Inc.: Java 2 Platform, Standard Edition, v1.4.2 at API Specification, http://java.sun.com/j2se/1.4.2/docs/api/
17. Apache Software Foundation: Apache HTTP server project, http://httpd.apache.org/