Scatter search algorithm with chaos based stochasticity

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.