A Hybrid Cuckoo Search and Simulated Annealing Algorithm
Open Access
- 23 September 2017
- journal article
- research article
- Published by Walter de Gruyter GmbH in Journal of Intelligent Systems
- Vol. 28 (4) , 683-698
Abstract
Simulated annealing (SA) proved its success as a single-state optimization search algorithm for both discrete and continuous problems. On the contrary, cuckoo search (CS) is one of the well-known population-based search algorithms that could be used for optimizing some problems with continuous domains. This paper provides a hybrid algorithm using the CS and SA algorithms. The main goal behind our hybridization is to improve the solutions generated by CS using SA to explore the search space in an efficient manner. More precisely, we introduce four variations of the proposed hybrid algorithm. The proposed variations together with the original CS and SA algorithms were evaluated and compared using 10 well-known benchmark functions. The experimental results show that three variations of the proposed algorithm provide a major performance enhancement in terms of best solutions and running time when compared to CS and SA as stand-alone algorithms, whereas the other variation provides a minor enhancement. Moreover, the experimental results show that the proposed hybrid algorithms also outperform some well-known optimization algorithms.Keywords
This publication has 29 references indexed in Scilit:
- Bat algorithm: a novel approach for global engineering optimizationEngineering Computations, 2012
- An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problemsInternational Journal of Bio-Inspired Computation, 2012
- A self-adaptive global best harmony search algorithm for continuous optimization problemsApplied Mathematics and Computation, 2010
- Engineering optimisation by cuckoo searchInternational Journal of Mathematical Modelling and Numerical Optimisation, 2010
- Global-best harmony searchApplied Mathematics and Computation, 2008
- A simulated annealing and hill-climbing algorithm for the traveling tournament problemEuropean Journal of Operational Research, 2006
- Fast simulated annealingPhysics Letters A, 1987
- Applications of the annealing algorithm to combinatorial problems in statisticsBiometrika, 1985
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Optimization by Simulated AnnealingScience, 1983