TBU Publications
Repository of TBU Publications

Do evolutionary algorithms indeed require randomness?

DSpace Repository

Show simple item record

dc.title Do evolutionary algorithms indeed require randomness? en
dc.contributor.author Zelinka, Ivan
dc.contributor.author Šenkeřík, Roman
dc.contributor.author Pluháček, Michal
dc.relation.ispartof 2013 IEEE Congress on Evolutionary Computation, CEC 2013
dc.identifier.isbn 978-1-4799-0453-2
dc.identifier.isbn 978-1-4799-0452-5
dc.date.issued 2013
dc.citation.spage 2283
dc.citation.epage 2289
dc.event.title IEEE Congress on Evolutionary Computation
dc.event.location Cancún
utb.event.state-en Mexico
utb.event.state-cs Mexiko
dc.event.sdate 2013-06-20
dc.event.edate 2013-06-23
dc.type conferenceObject
dc.language.iso en
dc.publisher IEEE
dc.identifier.doi 10.1109/CEC.2013.6557841
dc.relation.uri https://ieeexplore.ieee.org/document/6557841
dc.relation.uri https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6557841
dc.description.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. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1003777
utb.identifier.obdid 43870785
utb.identifier.scopus 2-s2.0-84881567697
utb.identifier.wok 000326235302038
utb.source d-wok
dc.date.accessioned 2014-07-07T13:43:54Z
dc.date.available 2014-07-07T13:43:54Z
utb.contributor.internalauthor Šenkeřík, Roman
utb.contributor.internalauthor Pluháček, Michal
utb.fulltext.affiliation Ivan Zelinka Department of Computer Science, FEI, VSB Technical University of Ostrava, Tr. 17. Listopadu 15, Ostrava, Czech Republic Email: ivan.zelinka@vsb.cz | http://www.ivanzelinka.eu Roman Senkerik, Michal Pluhacek Department of Informatics and Artificial Intelligence, FAI, Tomas Bata Univerzity in Zlin, Nad Stranemi 4511, Zlin 76001, Czech Republic Email: senkerik@fai.utb.cz
utb.fulltext.dates -
utb.fulltext.sponsorship The following 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, further was supported by European Regional Development Fund under the projectCEBIA-Tech No. CZ.1.05/2.1.00/03.0089
utb.fulltext.projects GACR P103/13/08195S
utb.fulltext.projects CZ.1.07/2.3.00/20.0072
utb.fulltext.projects CZ.1.05/2.1.00/03.0089
utb.fulltext.faculty Faculty of Applied Informatics
utb.fulltext.ou Department of Informatics and Artificial Intelligence
Find Full text

Files in this item

Show simple item record