Scatter search algorithm with chaos based stochasticity

Davendra, Donald David; Šenkeřík, Roman; Zelinka, Ivan; Pluháček, Michal

dc.title	Scatter search algorithm with chaos based stochasticity	en
dc.contributor.author	Davendra, Donald David
dc.contributor.author	Šenkeřík, Roman
dc.contributor.author	Zelinka, Ivan
dc.contributor.author	Pluháček, Michal
dc.relation.ispartof	Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
dc.identifier.isbn	9781479914883
dc.date.issued	2014
dc.citation.spage	860
dc.citation.epage	866
dc.event.title	2014 IEEE Congress on Evolutionary Computation, CEC 2014
utb.event.state-en	China
utb.event.state-cs	Čína
dc.event.sdate	2014-07-06
dc.event.edate	2014-07-11
dc.type	conferenceObject
dc.language.iso	en
dc.publisher	Institute of Electrical and Electronics Engineers Inc.
dc.identifier.doi	10.1109/CEC.2014.6900273
dc.relation.uri	https://ieeexplore.ieee.org/document/6900273
dc.relation.uri	https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6900273
dc.description.abstract	In this paper, we introduce a Scatter Search algorithm which is driven using a set of four chaos maps. The chaos maps of Tinkerbell, Delayed Logistics, Lozi and Burgers are used as chaotic pseudorandom number generators in the Scatter Search algorithm. These variants of the algorithm are used to solve the flowshop with blocking problem. The results are compared with the Mersenne Twister version of Scatter Search. The new chaos driven Scatter Search algorithm is shown to have superior performance when compared with state of the art heuristics in literature.	en
utb.faculty	Faculty of Applied Informatics
dc.identifier.uri	http://hdl.handle.net/10563/1004646
utb.identifier.obdid	43871919
utb.identifier.scopus	2-s2.0-84908577196
utb.identifier.wok	000356684601034
utb.source	d-scopus
dc.date.accessioned	2015-06-04T12:54:40Z
dc.date.available	2015-06-04T12:54:40Z
utb.contributor.internalauthor	Šenkeřík, Roman
utb.contributor.internalauthor	Pluháček, Michal