Comparison of Heuristic Algorithms for the N-Queen Problem (CROSBI ID 529814)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Martinjak, Ivica ; Golub, Marin
engleski
Comparison of Heuristic Algorithms for the N-Queen Problem
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.
n-queen problem; heuristic algorithms; simulated annealing; tabu search; genetic algorithm
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
759-764-x.
2007.
objavljeno
Podaci o matičnoj publikaciji
Proceedings of the 29th International Conference on Information Technology Interfaces , ITI 2007
Luzar-Stiffler, Vesna ; Hljuz Dobric, Vesna
Zagreb: Sveučilišni računski centar Sveučilišta u Zagrebu (Srce)
978-953-7138-09-7
1330-1012
Podaci o skupu
Information Technology Interfaces , ITI 2007
predavanje
25.06.2007-28.06.2007
Cavtat, Hrvatska