Name
Abstract | ||
|---|---|---|
Optimization algorithms typically operate only within a fixed-sized design space, solving problems with a fixed number of parameters. However, many optimization problems allow for a variable number of components, where the optimal number may not be known a priori. These problems may be solved by using a genetic algorithm that utilizes a variable-length genome. A particular challenge when using variable-length genomes is the recombination of two parent solutions to produce meaningful children. The performances of several crossover operators are investigated and compared using a sensor placement testbed problem. It is shown that the optimal number of sensors may be determined by each operator, and that performance is improved when care is taken to preserve similarities between parent solutions. Performance may also be further improved by introducing a bias when pairing parents for recombination based on their relative genome lengths. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/2330784.2330996 | GECCO (Companion) |
Keywords | Field | DocType |
relative genome length,variable-length genome,parent solution,optimization algorithm,optimization problem,variable-length genomes,variable number,optimal number,variable length genomes,pairing parent,fixed number,meaningful representation,representations,genetic algorithm,genetic algorithms | Genome,Mathematical optimization,Crossover,Computer science,A priori and a posteriori,Testbed,Algorithm,Pairing,Operator (computer programming),Optimization problem,Genetic algorithm | Conference |
Citations | PageRank | References |
2 | 0.37 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matt Ryerkerk | 1 | 2 | 0.71 |
| Ron Averill | 2 | 2 | 0.37 |
| Kalyanmoy Deb | 3 | 21058 | 1398.01 |
| Erik Goodman | 4 | 145 | 15.19 |