Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11844297_97 | PPSN |
Keywords | Field | DocType |
continuous chromosome reconfiguration,traditional genetic algorithm,building block,good performance,actual information,hierarchical problem,chromosomal structure,selecto-recombinative genetic algorithm,strong intra building block,proposed algorithm,2-point crossover,genetic algorithm | Mathematical optimization,Chromosome,Crossover,Parallel algorithm,Computer science,Algorithm,Separable space,Recombination operators,Chromosomal Structure,Genetic algorithm,Control reconfiguration | Conference |
Volume | ISSN | ISBN |
4193 | 0302-9743 | 3-540-38990-3 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiří Kubalík | 1 | 55 | 6.42 |
| Petr Pošík | 2 | 210 | 15.44 |
| Jan Herold | 3 | 0 | 0.34 |