DocumentCode
3187275
Title
Comparison of Heuristic Algorithms for the N-Queen Problem
Author
Martinjak, Ivica ; Golub, Marin
Author_Institution
Univ. of Zagreb, Zagreb
fYear
2007
fDate
25-28 June 2007
Firstpage
759
Lastpage
764
Abstract
This paper addresses the way in which heuristic algorithms can be used to solve the n-queen problem. Metaheuristics for algorithm simulated annealing, tabu search and genetic algorithm are shown, test results are demonstrated and upper bound complexity is determined. The efficiencies of algorithms are compared and their achievements are measured. Due to the reduction of the fitness function complexity to O(1) problem instances with large dimensions are solved.
Keywords
computational complexity; genetic algorithms; heuristic programming; search problems; simulated annealing; fitness function complexity; genetic algorithm; heuristic algorithm; n-queen problem; simulated annealing algorithm; tabu search algorithm; Computational modeling; Cooling; Genetic algorithms; Heuristic algorithms; Polynomials; Simulated annealing; Temperature dependence; Temperature distribution; Testing; Upper bound; genetic algorithm; heuristic algorithms; n-queen problem; simulated annealing; tabu search;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology Interfaces, 2007. ITI 2007. 29th International Conference on
Conference_Location
Cavtat
ISSN
1330-1012
Print_ISBN
953-7138-10-0
Electronic_ISBN
1330-1012
Type
conf
DOI
10.1109/ITI.2007.4283867
Filename
4283867
Link To Document