On the Performance of Genetic Operators and the Random Key Representation

13Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many evolutionary systems have been developed that solve various specific scheduling problems. In this work, one such permutation based system, which uses a linear GP type Genotype to Phenotype Mapping (GPM), known as the Random Key Genetic Algorithm is investigated. The role standard mutation plays in this representation is analysed formally and is shown to be extremely disruptive. To ensure small fixed sized changes in the phenotype a swap mutation operator is suggested for this representation. An empirical investigation reveals that swap mutation outperforms the standard mutation to solve a hard deceptive problem even without the use of crossover. Swap mutation is also used in conjunction with different crossover operators and significant boost has been observed in the performance especially in the case of headless chicken crossover that produced surprising results. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Ryan, E., Muhammad Atif Azad, R., & Ryan, C. (2004). On the Performance of Genetic Operators and the Random Key Representation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3003, 162–173. https://doi.org/10.1007/978-3-540-24650-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free