Swarm Refinement PSO for Solving N-queens Problem
In this paper, we introduce a hybrid approach of particle swarm optimization (PSO) for solving n-queens problem. Since the solution of n-queens problem is to create a set of non-conflict queens, we propose a swarm refinement technique to reduce conflicts in main swam and then locate final solutions by swapping permutations. The swarm refinement PSO (SR-PSO) performs much faster and more accurate than the original discrete PSO.