Rethinking the design of real-coded evolutionary algorithms: Making discrete choices in continuous search domains |
| |
Authors: | William E. Hart |
| |
Affiliation: | (1) Sandia National Laboratories, P. O. Box 5800, MS 1110, Albuquerque, NM 87185-1110, USA |
| |
Abstract: | Although real-coded evolutionary algorithms (EAs) have been applied to optimization problems for over thirty years, the convergence properties of these methods remain poorly understood. We discuss the use of discrete random variables to perform search in real-valued EAs. Although most real-valued EAs perform mutation with continuous random variables, we argue that EAs using discrete random variables for mutation can be much easier to analyze. In particular, we present and analyze two simple EAs that make discrete choices of mutation steps. |
| |
Keywords: | Convergence Evolutionary algorithms Self-adaptation Real-coded Evolution Strategies |
本文献已被 SpringerLink 等数据库收录! |
|