Publikace UTB
Repozitář publikační činnosti UTB

Do evolutionary algorithms indeed require random numbers? Extended study

Repozitář DSpace/Manakin

Zobrazit minimální záznam


dc.title Do evolutionary algorithms indeed require random numbers? Extended study en
dc.contributor.author Zelinka, Ivan
dc.contributor.author Chadli, Mohammed
dc.contributor.author Davendra, Donald David
dc.contributor.author Šenkeřík, Roman
dc.contributor.author Pluháček, Michal
dc.contributor.author Lampinen, Jouni
dc.relation.ispartof Advances in Intelligent Systems and Computing
dc.identifier.issn 2194-5357 Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn 9783319005416
dc.date.issued 2013
utb.relation.volume 210
dc.citation.spage 61
dc.citation.epage 75
dc.type article
dc.language.iso en
dc.publisher Springer en
dc.identifier.doi 10.1007/978-3-319-00542-3_8
dc.relation.uri https://link.springer.com/chapter/10.1007/978-3-319-00542-3_8
dc.description.abstract An 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 are random processes really 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 a certain class of deterministic processes can be used instead of random number generators without lowering of evolutionary algorithms performance. © Springer International Publishing Switzerland 2013. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1003428
utb.identifier.obdid 43869941
utb.identifier.scopus 2-s2.0-84880384689
utb.source j-scopus
dc.date.accessioned 2013-08-02T09:10:23Z
dc.date.available 2013-08-02T09:10:23Z
utb.contributor.internalauthor Šenkeřík, Roman
utb.contributor.internalauthor Pluháček, Michal
utb.fulltext.affiliation Ivan Zelinka, Mohammed Chadli, Donald Davendra, Roman Senkerik, Michal Pluhacek, and Jouni Lampinen Ivan Zelinka · Donald Davendra VSB-Technical University of Ostrava, 17. listopadu 15 708 33, Ostrava-Poruba, Czech Republic e-mail: ivan.zelinka@vsb.cz Roman Senkerik · Michal Pluhacek Faculty of Applied Informatics, Tomas Bata University in Zlin e-mail: senkerik@fai.utb.cz Mohammed Chadli Laboratory of Modeling, Information and Systems (MIS), University of Picardie Jules Verne (UPJV), 33 rue Saint-Leu, 80039 Amiens Cedex 1, France e-mail: mchadli@u-picardie.fr Jouni Lampinen University of Vaasa, Department of Computer Science, P.O. Box 700, FI-65101 Vaasa, Finland e-mail: antlam@uwasa.fi
utb.fulltext.dates -
utb.fulltext.sponsorship The following two grants are acknowledged for the financial support provided for this research: Grant Agency of the Czech Republic - GACR P103/13/08195S, by the Development of human resources in research and development of latest soft computing methods and their application in practice project, reg. no. CZ.1.07/2.3.00/20.0072 funded by Operational Programme Education for Competitiveness, co-financed by ESF and state budget of the Czech Republic, partially supported by Grant of SGS No. SP2013/114, VSB - Technical University of Ostrava, Czech Republic, and by European Regional Development Fund under the project CEBIA-Tech No. CZ.1.05/2.1.00/03.0089.
Find Full text

Soubory tohoto záznamu

Zobrazit minimální záznam