Abstract
The efficiency speed-up strategies for evolutionary computation were discussed. Incorporation of the strategies with any known evolutionary algorithm leads to an accelerated version of the algorithm. An arbitrarily high-precision (resolution) solution of a high-dimensional problem was obtained by means of a successive low-resolution search in low-dimensional search spaces. The fast-genetic algorithms were experimentally tested with a test suit containing 10 complex multimodal function optimization problems.
| Original language | English |
|---|---|
| Pages (from-to) | 341-388 |
| Number of pages | 48 |
| Journal | Applied Mathematics and Computation |
| Volume | 142 |
| Issue number | 2-3 |
| DOIs | |
| State | Published - 10 Oct 2003 |
Keywords
- Efficiency speed-up
- Evolutionary computation
- Exclusion-based selection operator
- Genetic algorithms
- Refined cellular partioning
- Reinitialization
- Space discretization
- Space shrinking
- Splicing/decomposable representation scheme
Fingerprint
Dive into the research topics of 'Efficiency speed-up strategies for evolutionary computation: Fundamentals and fast-GAs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver