A new approach for the genetic algorithm
| dc.contributor.author | Çelebi, M | |
| dc.date.accessioned | 2024-07-18T11:46:39Z | |
| dc.date.available | 2024-07-18T11:46:39Z | |
| dc.description.abstract | This paper proposes a new approach based on two explicit rules of Mendel experiments and Mendel's population genetics for the genetic algorithm (GA). These rules are the segregation and independent assortment of alleles, respectively. This new approach has been simulated for the optimization of certain test functions. The doctrinal sense of GA is conceptually improved by this approach using a Mendelian framework. The new approach is different than the conventional one in terms of crossover, recombination, and mutation operators. The results obtained here are in agreement with those of the conventional GA, and even better in some cases. These results suggest that the new approach is overall more sensitive and accurate than the conventional one. Possible ways of improving the approach by including more genetic formulae in the code are also discussed. | |
| dc.identifier.issn | 0094-9655 | |
| dc.identifier.other | 1563-5163 | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/2891 | |
| dc.language.iso | English | |
| dc.publisher | TAYLOR & FRANCIS LTD | |
| dc.title | A new approach for the genetic algorithm | |
| dc.type | Article |