Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/3627
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Al-kubaisi, Ali | - |
dc.date.accessioned | 2022-10-19T23:27:09Z | - |
dc.date.available | 2022-10-19T23:27:09Z | - |
dc.date.issued | 2014 | - |
dc.identifier.issn | 0976-5697 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/3627 | - |
dc.description.abstract | rossover 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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | International Journal of Advanced Research in Computer Science | en_US |
dc.subject | Genetic algorithm | en_US |
dc.subject | Evolutionary computation | en_US |
dc.title | Investigating Crossover Techniques for the 8-Queens Problem | en_US |
dc.type | Article | en_US |
Appears in Collections: | مركز الحاسبة الالكترونية |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1 Investigating Crossover Techniques for the 8-Queens Problem.pdf | 171.43 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.