loading...
Combining Meta-Heuristics to Solve the Rook Problem
Timisoara, Romania September 26-September 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2006.25Eighth International Symposium on Sym ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Camelia-M. Pintea, Camelia Chira, D. Dumitrescu, "Combining Meta-Heuristics to Solve the Rook Problem," Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on, pp. 239-243, Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/SYNASC.2006.25,
author = {Camelia-M. Pintea and Camelia Chira and D. Dumitrescu},
title = {Combining Meta-Heuristics to Solve the Rook Problem},
journal ={Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on},
volume = {0},
year = {2006},
isbn = {0-7695-2740-X},
pages = {239-243},
doi = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2006.25},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
TI - Combining Meta-Heuristics to Solve the Rook Problem
SN - 0-7695-2740-X
SP239
EP243
A1 - Camelia-M. Pintea,
A1 - Camelia Chira,
A1 - D. Dumitrescu,
PY - 2006
KW - null
VL - 0
JA - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
ER -
 
Camelia-M. Pintea, 'Babes-Bolyai' University, Romania
Camelia Chira, 'Babes-Bolyai' University, Romania
D. Dumitrescu, 'Babes-Bolyai' University, Romania
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.
Citation:
Camelia-M. Pintea, Camelia Chira, D. Dumitrescu, "Combining Meta-Heuristics to Solve the Rook Problem," synasc, pp.239-243, Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.