Parallel ant colony optimization for the quadratic assignment problems with symmetric multi processing

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

Volumn 5217 LNCS, Issue , 2008, Pages 363-370

  Tsutsui, Shigeyoshi ^a  

^a HANNAN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CELLULAR AUTOMATA; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; SEQUENTIAL SWITCHING; SHAPE MEMORY EFFECT; TRAVELING SALESMAN PROBLEM; VORTEX SHEDDING;

ACO ALGORITHMS; ISLAND MODELS; PARALLEL ANT COLONY OPTIMIZATIONS; QUADRATIC ASSIGNMENT PROBLEMS; RUN TIMES; SEQUENTIAL ALGORITHMS; SLAVE MODELS; SYMMETRIC MULTI-PROCESSING;

PARALLEL ALGORITHMS;

EID: 56449086788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87527-7_38     Document Type: Conference Paper

References (15)

1. 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)
2. 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)
3. 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)
4. 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)
5. Randall, M., Lewis, A.: A parallel implementation of ant colony optimization. Journal of Parallel and Distributed Computing 62(9), 1421-1432 (2002)
6. 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)
7. Bullnheimer, B., Kotsis, G., Strauss, C: Parallelization strategies for the ant system. High Performance Algorithms and Software in Nonlinear Optimization, 87- 100 (1998)
8. Middendorf, M., Reischle, F., Schmeck, H.: Multi colony ant alorithms. Journal of Heuristics 8(3), 3005-3200 (2002)
9. 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)
10. Talbi, E., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Generation Computer System 17, 441-449 (2001)
11. Stützle, T., Hoos, H.: MAX-MIN ant system. Future Generation Computer Systems 16(9), 889-914 (2000)
12. 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)
13. Taillard, É.D.: The robust taboo search code, http: //mistic.heig-vd. ch/taillard/
14. Taillard, É.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17, 443-455 (1991)
15. QAPLIB -AQuadratic Assignment Problem Library, http://www.seas.upenn.edu/ qaplib/