Big bang-big crunch optimization algorithm with local directional moves

The big bang-big crunch (BB-BC) algorithm has been proposed as a novel optimization method that relies on one of the theories of the evolution of the universe, namely the big bang and big crunch theory. It has been shown that this algorithm is capable of quick convergence, even in long, narrow parabolic-shaped flat valleys or in the existence of several local extremes. In this work, the BB-BC optimization algorithm is hybridized with local search moves in between the banging and crunching phases of the algorithm. These 2 original phases of the BB-BC algorithm are preserved, but the representative point (best or fittest point) attained after the crunching phase of the iteration is modified with some local directional moves, using the previous representative points so far attained, with the hope that a better representative point would be obtained. The effect of imposing local directional moves is inspected by comparing the results of the original and enhanced BB-BC algorithm on various benchmark test functions. Moreover, the crunching phase of the algorithm is improved with the addition of a simplex-based local search routine. The results of the new hybridized algorithm are compared with the state-of-the-art variants of widely used evolutionary computation methods, namely genetic algorithms, covariance matrix adaptation evolutionary strategies, and particle swarm optimization. The results over the benchmark test functions have proven that the BB-BC algorithm, enhanced with local directional moves, has provided more accuracy with the same computation time or for the same number of function evaluations.