Search

Migrating Birds Optimisation ( mbo ) is a nature-inspired approach which has been shown to be very effective when solving a variety of combinatorial optimisation problems. More recently, an adaptation of the algorithm has been proposed that enables it to deal with continuous search spaces. We extend this work in two ways. Firstly, a novel leader replacement strategy is proposed to counter the slow convergence of the existing mbo algorithms due to low selection pressure. Secondly, mbo is hybridised with adaptive neighbourhood operators borrowed from Differential Evolution ( de ) that promote exploration and exploitation. The new variants are tested on two sets of continuous large scale optimisation problems. Results show that mbo variants using adaptive, exploration -based operators outperform de on the cec benchmark suite with 1000 variables. Further experiments on a second suite of 19 problems show that mbo variants outperform de on 90% of these test-cases. [ABSTRACT FROM AUTHOR]