DocumentCode
238677
Title
Scatter Search Algorithm with chaos based stochasticity
Author
Davendra, Donald ; Senkerik, Roman ; Zelinka, Ivan ; Pluhacek, Michal
Author_Institution
Dept. of Comput. Sci., VSB-Tech. Univ. of Ostrava, Ostrava-Poruba, Czech Republic
fYear
2014
fDate
6-11 July 2014
Firstpage
860
Lastpage
866
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.
Keywords
chaos; evolutionary computation; search problems; Burgers map; Lozi map; Mersenne Twister version; Tinkerbell map; chaos based stochasticity; chaos maps; chaotic pseudorandom number generators; delayed logistics map; flowshop with blocking problem; scatter search algorithm; Chaos; Generators; Genetic algorithms; Logistics; Optimized production technology; Sociology; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2014 IEEE Congress on
Conference_Location
Beijing
Print_ISBN
978-1-4799-6626-4
Type
conf
DOI
10.1109/CEC.2014.6900273
Filename
6900273
Link To Document