• 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 Hossein Akbaripour and Nasrin Mohabbati-Kalejahi},
  journal={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… 

Figures and Tables from this paper

The performance of the MA is found to be superior to that of a solitary algorithm like GA, being a combination of the Genetic Algorithm and a local search algorithm.
Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System
The computational result shows that the results of the proposed algorithm are competitive with other metaheuristic algorithms for solving the TSP in terms of better quality of solution and computational time respectively.
A reactive bone route algorithm for solving the traveling salesman problem
A reactive bone route algorithm called RBRA is used for solving the traveling salesman problem in which several local search algorithms as an improved procedure are applied and shows the efficiency of the proposed algorithm compared to other meta-heuristic algorithms.
Service composition and optimal selection in cloud manufacturing: landscape analysis and optimization by a hybrid imperialist competitive and local search algorithm
Computational results showed that transportation consideration is indispensable for obtaining more realistic solutions in cloud manufacturing and it was proved that algorithms incorporating both exploitation and exploration are able to solve the SCOS problem more efficiently.
An imperialist competitive algorithm for service composition and optimal selection in cloud manufacturing
A new Mixed Integer Programming (MIP) model for solving the SCOS with transportation consideration has been proposed and the results showed that the ICA is able to find the optimal solution faster than the CPLEX solver in GAMS optimization software.


Solution of n-Queen problem using ACO
The proposed solution will be applied to 8-Queen problem because the solution can very easily be extended to the generalized form of the problem for large values of ‘n’.
Presenting a new method based on cooperative PSO to solve permutation problems: A case study of n-queen problem
This paper presents a new cooperative PSO method to solve permutation problems, which has exceeded standard PSO algorithm and other compared metaheuristic methods.
Comparison of Heuristic Algorithms for the N-Queen Problem
  • I. Martinjak, M. Golub
  • Computer Science
    2007 29th International Conference on Information Technology Interfaces
  • 2007
The way in which heuristic algorithms can be used to solve the n-queen problem is addressed and the reduction of the fitness function complexity to O(1) problem instances with large dimensions are solved.
Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem
The N-queens problem and genetic algorithms
The authors determined how well the operators of genetic algorithms handled very difficult combinatorial and constraint satisfaction problems. The N-queens problem is a complex combinatorial problem.
Nature-Inspired Metaheuristic Algorithms
This book reviews and introduces the state-of-the-art nature-inspired metaheuristic algorithms in optimization, including genetic algorithms, bee algorithms, particle swarm optimization, simulated annealing, ant colony optimization, harmony search, and firefly algorithms.
A Dynamic Programming Solution to the n-Queens Problem
New decision rules for exact search in N-Queens
A set of new decision rules for exact search in N-Queens are presented, apart from new tiebreaking strategies for value and variable ordering, and the notion of `free diagonal' for decision taking at each step of the search is introduced.
Metaheuristics - From Design to Implementation
This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
A survey of known results and research areas for n-queens