.png){kind=icon}
.png){kind=icon}
Return
Investigation on evolutionary algorithms powered by nonrandom processes
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-015-1689-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Inherent part of evolutionary algorithms that are based on Darwin's theory of evolution and Mendel's theory of genetic heritage, are random processes since genetic algorithms and evolutionary strategies are used. In this paper, we present extended experiments (of our previous) of selected evolutionary algorithms and test functions showing whether random processes really are needed in evolutionary algorithms. In our experiments we used differential evolution and SOMA algorithms with functions 2ndDeJong, Ackley, Griewangk, Rastrigin, SineWave and StretchedSineWave. We use n periodical deterministic processes (based on deterministic chaos principles) instead of pseudo-random number generators (PRGNs) and compare performance of evolutionary algorithms powered by those processes and by PRGNs. Results presented here are numerical demonstrations rather than mathematical proofs. We propose the hypothesis that a certain class of deterministic processes can be used instead of PRGNs without lowering the performance of evolutionary algorithms.
Keywords:
Evolutionary algorithms
Pseudo-random numbers
Deterministic chaos
Deterministic number series
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
View more organizations