Name
Title | ||
|---|---|---|
A novel selection mechanism for evolutionary algorithms with metameric variable-length representations. |
Abstract | ||
|---|---|---|
Metameric problems are variable-length optimization problems whose representations take on an at least partially segmented structure. This is referred to as a metameric representation. Frequently, each of these segments defines one of a number of analogous components in the solution. Examples include the nodes in a coverage network or turbines in a wind farm. Locating optimal solutions requires, in part, determining the optimal number of components. Evolutionary algorithms can be applied but require modifications to the traditional fixed-length operators. This study proposes a new selection operator for metameric problems: length niching selection. First, the population is partitioned into several niches based on solution length. A window function determines at which lengths a niche is formed. Local selection is then applied within each niche independently, resulting in a new parent population formed by a diverse set of solution lengths. A coverage and a wind farm problem are used to demonstrate the effectiveness of the new operator. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s00500-020-04953-1 | SOFT COMPUTING |
Keywords | DocType | Volume |
Metameric representations,Evolutionary algorithms,Variable-length algorithms | Journal | 24.0 |
Issue | ISSN | Citations |
21.0 | 1432-7643 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matt Ryerkerk | 1 | 2 | 0.71 |
| Ronald C. Averill | 2 | 5 | 1.83 |
| Kalyanmoy Deb | 3 | 21058 | 1398.01 |
| Erik Goodman | 4 | 145 | 15.19 |