A selecto-recombinative genetic algorithm with continuous chromosome reconfiguration

  • Authors:
  • Jiří Kubalík;Petr Pošík;Jan Herold

  • Affiliations:
  • Department of Cybernetics, CTU Prague, Prague 6, Czech Republic;Department of Cybernetics, CTU Prague, Prague 6, Czech Republic;Department of Cybernetics, CTU Prague, Prague 6, Czech Republic

  • Venue:
  • PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.