Title :
Combining Meta-Heuristics to Solve the Rook Problem
Author :
Pintea, Camelia-M ; Chira, Camelia ; Dumitrescu, D.
Author_Institution :
Fac. of Math. & Comput.-Sci., ´´Babes-Bolyai´´ Univ., Cluj-Napoca
Abstract :
The combination of various meta-heuristics to solve NP-hard problems has great potential to produce good results. Ant algorithms and multi-agent system are proposed to solve a chess problem. The problem is about how to place n rooks on a chessboard so that they are all mutually non-attacking. The introduced algorithms produce reasonable results and have several advantages. A combination between the two meta-heuristics is presented and some possible crossover improvements of the proposed algorithms are suggested
Keywords :
computational complexity; games of skill; multi-agent systems; optimisation; NP-hard problems; ant algorithms; chess problem; meta-heuristics; multiagent system; rook problem; Ant colony optimization; Artificial intelligence; Autonomous agents; Biochemistry; Insects; Legged locomotion; Mathematics; Multiagent systems; Object oriented modeling; Object oriented programming;
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing, 2006. SYNASC '06. Eighth International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
0-7695-2740-X
DOI :
10.1109/SYNASC.2006.25
