Comparison of Heuristic Algorithms for the N-Queen Problem
Comparison of Heuristic Algorithms for the N-Queen Problem
复制标题
N 皇后问题的启发式算法比较
DOI：
10.1109/iti.2007.4283867
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Marin Golub
中科院分区：
文献类型：
--
作者：
Ivica Martinjak;Marin Golub
本文讨论了启发式算法在求解n皇后问题中的应用。给出了模拟退火法、禁忌搜索法和遗传算法的元启发式算法，并给出了测试结果，确定了算法的复杂度上限。对各种算法的效率进行了比较，并对它们的性能进行了衡量。由于将适应度函数的复杂度降低到O(1)，解决了大维的问题实例。
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.