Name
Title | ||
|---|---|---|
A test function with full controllability over overlapping: estimation of distribution algorithms |
Abstract | ||
|---|---|---|
This work proposes a test function to study overlapping. The test function provides full controllability over overlapping. To achieve full controllability, the building block assigning problem is reduced to a bipartite matching problem which allow us to directly assign extent of overlapping to each gene. At the end, an experiment on overlapping shows that to four chosen crossover methods, the problem difficulty increases exponentially with the extent of overlapping. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2001858.2001895 | GECCO (Companion) |
Keywords | Field | DocType |
overlapping shows,building block,crossover method,full controllability,bipartite matching problem,problem difficulty increases exponentially,test function,distribution algorithm,estimation of distribution algorithm,assignment problem,overlap,genetic algorithm,bipartite matching | Mathematical optimization,Crossover,Controllability,Estimation of distribution algorithm,Computer science,Test functions for optimization,Bipartite graph,Genetic algorithm,Exponential growth | Conference |
Citations | PageRank | References |
1 | 0.37 | 1 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jen-Hao Chang | 1 | 19 | 2.83 |
| Chung-Hsiang Hsueh | 2 | 1 | 0.70 |
| Hsuan Lee | 3 | 4 | 0.78 |
| Tian-Li Yu | 4 | 430 | 35.28 |
| Tsung-Yu Ho | 5 | 16 | 2.78 |