Do evolutionary algorithms indeed require random numbers? Extended study

DOI10.1007/978-3-319-00542-3_8MaRDI QIDQ2848269zbMATH OpenOpenAlexFDO

Authors Ivan Zelinka, Donald Davendra, Roman Senkerik, Michal Pluhacek, Jouni A. Lampinen, Mohammed Chadli

Publication date 26 September 2013

Published in Nostradamus 2013: Prediction, Modeling and Analysis of Complex Systems (Search for Journal in Brave)

Full work available at URL http://publikace.k.utb.cz/handle/10563/1003428

Mathematics Subject Classification ID

General systems (93A10)

Recommendations

• Comparison of pseudorandom numbers generators and chaotic numbers generators used in differential evolution
• scientific article; zbMATH DE number 1754585
• Hidden periodicity -- chaos dependance on numerical precision
• scientific article; zbMATH DE number 2065676
• Evolutionary algorithms for chaos researchers

Cited in

(3)

• Analytic programming powered by chaotic dynamics
• Scheduling the flowshop with zero intermediate storage using chaotic discrete artificial bee algorithm
• Unconventional algorithms and hidden chaotic attractors

Describes a project that uses

Uses Software

• HC12
• GAHC

This page was built for publication: Do evolutionary algorithms indeed require random numbers? Extended study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848269)