Abstract
Big bang---big crunch (BBBC) algorithm is a fairly novel gradient-free optimisation algorithm. It is based on theories of evolution of the universe, namely the big bang and big crunch theory. The big challenge in BBBC is that it is easily trapped in local optima. In this paper, chaotic-based strategies are incorporated into BBBC to tackle this challenge. Five various chaotic-based BBBC strategies with three different chaotic map functions are investigated and the best one is selected as the proposed chaotic strategy for BBBC. The results of applying the proposed chaotic BBBC to different unimodal and multimodal benchmark functions vividly show that chaotic-based BBBC yields quality solutions. It significantly outperforms conventional BBBC, cuckoo search optimisation and gravitational search algorithm.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call