A good performance of traditional genetic algorithm is determined by its ability to identify building blocks and grow them to larger ones. To attain this objective a properly arranged chromosome is needed to ensure that building blocks will survive the application of recombination operators. The proposed algorithm periodically rearranges the order of genes in the chromosome while the actual information about the inter-gene dependencies is calculated on-line through the run. Standard 2-point crossover, operating on the adapted chromosomal structure, is used to generate new solutions. Experimental results show that this algorithm is able to solve separable problems with strong intra building block dependencies among genes as well as the hierarchical problems. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Kubalík, J., Pošík, P., & Herold, J. (2006). A selecto-recombinative genetic algorithm with continuous chromosome reconfiguration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 959–968). Springer Verlag. https://doi.org/10.1007/11844297_97
Mendeley helps you to discover research relevant for your work.