.png){kind=icon}
Return
Evolutionary programming using mutations based on the Levy probability distribution
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2003.816583.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
\This paper studies evolutionary programming with mutations based on the Levy probability distribution. The Levy probability distribution has an infinite second moment and is, therefore, more likely to generate an offspring that is farther away from its parent than the commonly employed Gaussian mutation. Such likelihood depends on a parameter alpha in the Levy distribution. We propose an evolutionary,programming algorithm using adaptive as well as nonadaptive Levy mutations. The proposed algorithm was applied to multivariate functional optimization. Empirical evidence shows that, in the case of functions having many local optima, the performance of the proposed algorithm was better than that of classical evolutionary programming using Gaussian mutation.
Keywords:
evolutionary optimization
evolutionary programming
Levy mutation
Levy probability distribution
mean-square displacement
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveAcceleration of anterograde axonal transport in cat sciatic nerve by diisopropyl phosphorofluoridate
PREAI
ShareSavePost-collisional ultrapotassic volcanism in the Tangra Yumco-Xuruco graben, south Tibet: Constraints from geochemistry and Sr–Nd–Pb isotope.png)
Lithos
LithosIF0
PREAI
ShareSaveShareSave
ShareSave no more
no more