Journal
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION
Volume 13, Issue 1, Pages 59-69Publisher
INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/IJBIC.2019.097728
Keywords
cuckoo search algorithm; dynamic evaluation; orthogonal opposition-based learning; Taguchi opposition-based search; TOB-DCS
Funding
- scientific research project of Hubei Provincial Department of Education [B2017314]
- National Natural Science Foundation of China [61672391]
- Innovation team of the Provincial Education Department [T201631]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available