Title :
Do evolutionary algorithms indeed require randomness?
Author :
Zelinka, Ivan ; Senkerik, Roman ; Pluhacek, Michal
Author_Institution :
Dept. of Comput. Sci., FEI VSB Tech. Univ. of Ostrava, Ostrava, Czech Republic
Abstract :
Inherent part of evolutionary algorithms that are based on Darwin theory of evolution and Mendel theory of genetic heritage, are random processes. In this participation we discuss whether random processes really are needed in evolutionary algorithms. We use n periodic deterministic processes instead of random number generators and compare performance of evolutionary algorithms powered by those processes and by pseudo-random number generators. Deterministic processes used in this participation are based on deterministic chaos and are used to generate periodical series with different length. Results presented here are numerical demonstration rather than mathematical proofs. We propose that certain class of deterministic processes can be used instead of random number generators without lowering the performance of evolutionary algorithms.
Keywords :
chaos; evolutionary computation; random processes; Darwin theory of evolution; Mendel theory of genetic heritage; deterministic chaos; evolutionary algorithms; mathematical proofs; n-periodic deterministic process; pseudorandom number generators; random processes; Chaos; Equations; Evolutionary computation; Generators; Logistics; Mathematical model; Orbits;
Conference_Titel :
Evolutionary Computation (CEC), 2013 IEEE Congress on
Conference_Location :
Cancun
Print_ISBN :
978-1-4799-0453-2
Electronic_ISBN :
978-1-4799-0452-5
DOI :
10.1109/CEC.2013.6557841