×

A new hybrid Cuckoo search and firefly optimization. (English) Zbl 1390.90620

Summary: In this paper, we present a new hybrid algorithm which is a combination of a hybrid Cuckoo search algorithm and Firefly optimization. We focus in this research on a hybrid method combining two heuristic optimization techniques, Cuckoo Search (CS) and Firefly Algorithm (FA) for the global optimization. Denoted as CS-FA. The hybrid CS-FA technique incorporates concepts from CS and FA and creates individuals in a new generation not only by random walk as found in CS but also by mechanisms of FA. To analyze the benefits of hybridization, we have comparatively evaluated the classical Cuckoo Search and Firefly Algorithms versus the proposed hybridized algorithms (CS-FA).

MSC:

90C90 Applications of mathematical programming
90C29 Multi-objective and goal programming
90C15 Stochastic programming
68W27 Online algorithms; streaming algorithms
68W40 Analysis of algorithms

Software:

CEC 05
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] I. Fister, Jr., M. Perc, S. M. Kamal and I. Fister, A review of chaos-based firefly algorithms: Perspectives and research challenges, Appl. Math. Comput. 252 (2015), 155-165.; Fister, Jr., I.; Perc, M.; Kamal, S. M.; Fister, I., A review of chaos-based firefly algorithms: Perspectives and research challenges, Appl. Math. Comput., 252, 155-165 (2015) · Zbl 1338.90470
[2] G. Kanagaraj, S. G. Ponnambalam and N. Jawahar, A hybrid cuckoo search and genetic algorithm for reliability-redundancy allocation problems, Comput. Ind. Eng. 66 (2013), no. 4, 1115-1124.; Kanagaraj, G.; Ponnambalam, S. G.; Jawahar, N., A hybrid cuckoo search and genetic algorithm for reliability-redundancy allocation problems, Comput. Ind. Eng., 66, 4, 1115-1124 (2013)
[3] V. Kelner, F. Capitanescu, O. Léonard and L. Wehenkel, A hybrid optimization technique coupling an evolutionary and a local search algorithm, J. Comput. Appl. Math. 215 (2008), no. 2, 448-456.; Kelner, V.; Capitanescu, F.; Léonard, O.; Wehenkel, L., A hybrid optimization technique coupling an evolutionary and a local search algorithm, J. Comput. Appl. Math., 215, 2, 448-456 (2008) · Zbl 1138.65047
[4] M. D. R. Payne, The Cuckoos, Oxford University Press, Oxford, 2005.; Payne, M. D. R., The Cuckoos (2005)
[5] G. Preet Singh and A. Singh, Comparative study of krill herd, firefly and cuckoo search algorithms for unimodal and multimodal optimization, Int. J. Intell. Syst. Appl. 2 (2014), no. 3, 35-49.; Preet Singh, G.; Singh, A., Comparative study of krill herd, firefly and cuckoo search algorithms for unimodal and multimodal optimization, Int. J. Intell. Syst. Appl., 2, 3, 35-49 (2014)
[6] A. Ouaarab, B. Ahiod and X. S. Yang, Discrete cuckoo search algorithm for the travelling salesman problem, Neural Comput. Appl. 24 (2014), no. 7-8, 1659-1669.; Ouaarab, A.; Ahiod, B.; Yang, X. S., Discrete cuckoo search algorithm for the travelling salesman problem, Neural Comput. Appl., 24, 7-8, 1659-1669 (2014)
[7] S. Salcedo-Sanz, Modern meta-heuristics based on nonlinear physics processes: A review of models and design procedures, Phys. Rep. 655 (2016), 1-70.; Salcedo-Sanz, S., Modern meta-heuristics based on nonlinear physics processes: A review of models and design procedures, Phys. Rep., 655, 1-70 (2016)
[8] S. S. Sankalap Arora and S. Singh, A conceptual comparison of firefly algorithm, bat algorithm and cuckoo search, 2013 International Conference on Control Computing Communication & Materials (Allahabad 2013), IEEE Press, Piscataway (2013), 1-4.; Sankalap Arora, S. S.; Singh, S., A conceptual comparison of firefly algorithm, bat algorithm and cuckoo search, 2013 International Conference on Control Computing Communication & Materials, 1-4 (2013)
[9] D. Shilane, J. Martikainen, S. Dudoit and S. J. Ovaska, A general framework for statistical performance comparison of evolutionary computation algorithms, Inform. Sci. 178 (2008), no. 14, 2870-2879.; Shilane, D.; Martikainen, J.; Dudoit, S.; Ovaska, S. J., A general framework for statistical performance comparison of evolutionary computation algorithms, Inform. Sci., 178, 14, 2870-2879 (2008)
[10] N. P. N. Suganthan, Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization, Technical Report, Nanyang Technological University, Singapore, 2005.; Suganthan, N. P. N., Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization (2005)
[11] D. A. Wood, Hybrid cuckoo search optimization algorithms applied to complex wellbore trajectories aided by dynamic, chaos-enhanced, fat-tailed distribution sampling and metaheuristic profiling, J. Natural Gas Sci. Eng. 34 (2016), no. 1, 236-252.; Wood, D. A., Hybrid cuckoo search optimization algorithms applied to complex wellbore trajectories aided by dynamic, chaos-enhanced, fat-tailed distribution sampling and metaheuristic profiling, J. Natural Gas Sci. Eng., 34, 1, 236-252 (2016)
[12] X.-S. Yang, Firefly algorithm, Lévy flights and global optimization, Research and Development in Intelligent Systems XXVI, Springer London (2010), 209-218.; Yang, X.-S., Firefly algorithm, Lévy flights and global optimization, Research and Development in Intelligent Systems XXVI, 209-218 (2010)
[13] X.-S. Yang and S. Deb, Cuckoo search via Lévy flights, World Congress on Nature and Biologically Inspired Computing (Coimbatore 2009), IEEE Press, Piscataway (2009), 210-214.; Yang, X.-S.; Deb, S., Cuckoo search via Lévy flights, World Congress on Nature and Biologically Inspired Computing, 210-214 (2009)
[14] X.-S. Yang and M. Karamanoglu, Swarm Intelligence and Bio-Inspired Computation: An Overview, Elsevier, Amsterdam, 2013.; Yang, X.-S.; Karamanoglu, M., Swarm Intelligence and Bio-Inspired Computation: An Overview (2013)
[15] Y. W. Zhang, L. Wang and Q. D. Wu, Dynamic adaptation cuckoo search algorithm, Control Decision 29 (2014), no. 4, 617-622.; Zhang, Y. W.; Wang, L.; Wu, Q. D., Dynamic adaptation cuckoo search algorithm, Control Decision, 29, 4, 617-622 (2014) · Zbl 1313.68211
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.