Dynamic cuckoo search algorithm based on Taguchi opposition-based search Online publication date: Mon, 04-Feb-2019
by Juan Li; Yuan-xiang Li; Sha-sha Tian; Jie Zou
International Journal of Bio-Inspired Computation (IJBIC), Vol. 13, No. 1, 2019
Abstract: The cuckoo search (CS) algorithm is a relatively new, nature-inspired intelligent algorithm that uses a whole updating and evaluation strategy to find solutions for continuous global optimisation problems. Despite its efficiency and wide use, CS suffers from premature convergence and poor balance between exploitation and exploration. These issues result from interference phenomena among dimensions that arise when solving multi-dimension function optimisation problems. To overcome these issues, we proposed an enhanced CS algorithm called dynamic CS with Taguchi opposition-based search (TOB-DCS) that employed two new strategies: Taguchi opposition-based search and dynamic evaluation. The Taguchi search strategy provided random generalised learning based on opposing relationships to enhance the exploration ability of the algorithm. The dynamic evaluation strategy reduced the number of function evaluations, and accelerated the convergence property. For this research, we conducted experiments on 22 classic benchmark functions, including unimodal, multi-modal and shifted test functions. Statistical comparisons of our experimental results showed that the proposed TOB-DCS algorithm made an appropriate trade-off between exploration and exploitation.
Online publication date: Mon, 04-Feb-2019
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org