Authors: Juan Li; Yuan-xiang Li; Sha-sha Tian; Jie Zou
Addresses: School of Computer, Wuhan University, Wuhan, China; School of Information Engineering, Wuhan Technology and Business University, Wuhan, China ' School of Computer, Wuhan University, Wuhan, China ' School of Computer, Wuhan University, Wuhan, China ' School of Information Engineering, Wuhan Technology and Business University, Wuhan, China
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.
Keywords: cuckoo search algorithm; dynamic evaluation; orthogonal opposition-based learning; Taguchi opposition-based search; TOB-DCS.
International Journal of Bio-Inspired Computation, 2019 Vol.13 No.1, pp.59 - 69
Available online: 04 Feb 2019 *Full-text access for editors Access for subscribers Purchase this article Comment on this article