Corpus ID: 15658261

Solving the n-queens problem using a tuned hybrid imperialist competitive algorithm

  title={Solving the n-queens problem using a tuned hybrid imperialist competitive algorithm},
  author={E. Masehian and H. Akbaripour and Nasrin Mohabbati-Kalejahi},
  journal={Int. Arab J. Inf. Technol.},
  • E. Masehian, H. Akbaripour, Nasrin Mohabbati-Kalejahi
  • Published 2014
  • Computer Science
  • Int. Arab J. Inf. Technol.
  • The n queens problem is a classical combinatorial optimization problem which has been proved to be NP hard. The goal is to place n non attacking queens on an n×n chessboard. In this paper, the Imperialist Competitive Algorithm (ICA), which is a recent evolutionary metaheuristic method, has been applied for solving the n queens problem. As another variation, the ICA was combined with a local search method, resulting the Hybrid ICA (HICA). Since, the parameters of heuristic and metaheuristic… CONTINUE READING


    Publications referenced by this paper.
    Particle swarm optimization
    • 22,480
    • Open Access
    Nature-Inspired Metaheuristic Algorithms
    • 2,996
    Metaheuristics - From Design to Implementation
    • 2,196
    • Open Access
    Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition
    • 1,767
    • Open Access
    A survey of known results and research areas for n-queens
    • 138
    Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem
    • 56
    Solution of n-Queen problem using ACO
    • 36
    • Open Access
    Comparison of Heuristic Algorithms for the N-Queen Problem
    • 43
    • Open Access