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

@article{Masehian2014SolvingTN, 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.}, year={2014}, volume={11}, pages={550-559} }

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

5 Citations

Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System

- Engineering
- 2016

- 4
- Highly Influenced
- Open Access

An imperialist competitive algorithm for service composition and optimal selection in cloud manufacturing

- Computer Science, Engineering
- 2017

- 3

A reactive bone route algorithm for solving the traveling salesman problem

- Mathematics
- 2015

- 2
- Open Access

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 26 REFERENCES

Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition

- Computer Science
- 2007

- 1,767
- Open Access

Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem

- Computer Science
- 1989

- 56

Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm

- Computer Science
- 2010

- 180
- Open Access