查看文章

A modified cuckoo search algorithm is proposed in this paper to solve the n-queens problem. For solving the problem, the host nests are treated as permutations of a cluster of distinctive values. The main idea is that the cuckoos change their eggs (permutations) randomly using Lévy flight approach without affecting the distinctive characteristics of the solution. During evolution of the optimal solution, a cuckoo search parameter, namely fraction of worst nests F_w, is also fine-tuned. The results obtained show that the proposed cuckoo search method is favorable in solving the similar constraint satisfaction problem.