Professional Documents
Culture Documents
Investigating Crossover Techniques For The 8-Queens Problem: Research
Investigating Crossover Techniques For The 8-Queens Problem: Research
net/publication/323858364
CITATIONS READS
0 1,201
2 authors:
All content following this page was uploaded by Aymen Jalil Abdulelah on 19 March 2018.
Ayman Jalil
College of Computer, Al-Anbar University
Ramadi, Iraq
Abstract: Crossover is one of the main steps of the genetic algorithm. This technique gives the genetic algorithm many advantages in finding
better solutions. There are many kinds of crossover techniques, all of them use the same general idea in choosing two randomly parents in order
to get two children that can be used in the next generation. This paper aims to investigate crossover techniques, this is done by choosing three
techniques of genetic algorithms crossover to be applied in solving the problem of eight-queens. The selected techniques are one point, two point
and uniform crossover. The obtained results show that, for the problem of eight-queens, one point crossover is better than the other two selected
techniques.
I. INTRODUCTION
III. BACKGROUN
become simpler. From result of their proposed technique, Step4: The 50 solutions that have the best fitness values are
unknown constants of regression equation can be easily selected as parents and retained for the next generation. Those
computed. parents are then used to create another 15 offspring using
Marko Božikovic, Marin Golub, and Leo Budin[6] crossover.
suggested a global parallel genetic algorithm GPGA for solving Step6: The new solutions are mutated.
n-queens problem. Successfully, they used three-way Step7: Repeat steps 3-6 until a new solution to the 8-queens
tournament selection. This way enabled slaves to run problem is found.
simultaneous selections and crossovers, freeing master process
from most tasks (population initialization and mutations during
the run were still performed by the master thread). GPGA is not
suitable for massive parallel processing, but it shows increase
in performance for a small number of parallel-processing units.
82 626 28 56 1 3 2 is the best. While the second one is to apply the same proposed
techniques to other problems in order to find if the
83 21 61 51 3 1 2
generalization is possible or not.
84 81 77 109 2 3 1
85 30 41 42 3 2 1 VIII. REFERENCES
86 15 52 90 3 2 1 [1] Hynek J., Genetic Algorithms for the N-Queens
87 45 24 58 2 3 1 Problem, In proceeding of: the 2008 International
Conference on Genetic and Evolutionary Methods, GEM
88 38 39 51 3 2 1 2008, Las Vegas, Nevada, USA, July 14-17, 2008.
89 36 21 69 2 3 1 [2] Sosič R. and Gu J., Efficient Local Search with Conflict
90 38 46 196 3 2 1 Minimization: A Case Study of the n-Queens Problem.
IEEE Transactions on Knowledge and Data Engineering.
91 44 17 831 2 3 1 Vol. 6, 5, pp. 661-668, Oct 1994.
92 29 42 58 3 2 1 [3] Eight queens puzzle. In Wikipedia. Retrieved August 14,
93 19 53 1863 3 2 1
2013,
from http://en.wikipedia.org/wiki/Eight_queens_puzzle .
94 83 34 16 1 2 3
[4] Coley D. A., An Introduction to Genetic Algorithms for
95 27 33 41 3 2 1 Scientists and Engineers, World Scientific, New York,.
1999.
96 12 52 5013 3 2 1
[5] Bhasin H. and Singla N., Genetic based Algorithm for N-
97 23 43 1004 3 2 1 Puzzle Problem, International Journal of Computer
98 26 19 49 2 3 1 Applications, Vol. 52, No.21, August 2012.
99 22 33 153 3 2 1 [6] Božikovic M., Golub M. and Budin L., Solving n-Queen
problem using global parallel genetic algorithm,
100 25 15 64 2 3 1 EUROCON 2003, Volume 2, 22-24 Sepetember
Total 242 218 141 2003Ljubljana, Slovenia.
[7] Crawford K.D., Solving the n-Queens Problem Using
Genetic Algorithms. In: Proceedings of ACM/SGAPP
Symposium on Applied Computing, Kansas City, March
VII. CONCLUSIONS AND FUTURE WORKS 1-3, 1992, pp. 1039-1047.
This paper aimed to find the best cross over technique that [8] Sastry K., Goldberg D. and Kendall G., Chapter 4:
can be used to solve the 8-queens problem using genetic Genetic Algorithms. In Search Methodologies:
algorithm. Three different experiments were done in order to Introductory Tutorials in Optimization and Decision
Support Techniques, pages 97-125, Springer, 2005.
achieve this aim.
The results showed that one point crossover is better than [9] Kumar M., Husian M., Upreti N. and Gupta D., Genetic
the other selected techniques as "Table 1" showed that one- Algorithm: Review and Application, International Journal
of Information Technology and Knowledge Management,
point crossover managed to get 242 points out of the possible Volume 2, No. 2, pp. 451-454, July-December 2010.
300 points, while two-point and uniform crossover managed to
score 218 and 141 respectively. Therefore it is recommended to [10] Alabsi F. and Naoum R., Comparison of Selection
Methods and Crossover Operations using Steady State
use the one-point crossover in solving the 8-queens problem. Genetic Based Intrusion Detection System, Journal of
There are two directions for the future works; the first one Emerging Trends in Computing and Information Sciences,
is to use more crossover techniques for solving the 8-queens VOL. 3, NO.7, July 2012.
problem in order to have a full investigation of which crossover