Abstract
The real-valued moth-flame optimization algorithm (MFO) is a new bio-inspired algorithm. It simulates the navigation mechanism of moth lateral positioning under moonlight. MFO has excellent performance in solving optimization problems and has strong ability in solving power optimization combination. In order to improve the global search ability of the algorithm, a complex-valued encoding moth-flame optimization algorithm (CMFO) is proposed. The real and imaginary parts of the population are updated by using the diploid structure of complex-valued encoding. The diversity of the population was increased. The effectiveness of CMFO algorithm has been verified by 4 benchmark problems. Statistically significant results and analysis show that the proposed complex-valued encoding moth-flame optimization algorithm is very promising and occasionally competitive compared with other well-established meta-heuristic techniques.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Fausto, F., Reyna-Orta, A., Cuevas, E., et al.: From ants to whales: metaheuristics for all tastes. Artif. Intell. Rev. (11) (2019). https://doi.org/10.1007/s10462-018-09676-2
Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51–67 (2016)
Faris, H., Mafarja, M.M., Heidari, A.A., et al.: An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl.-Based Syst. 154, 43–67 (2018)
Koza, J.R.: Genetic programming II: automatic discovery of reusable programs. Artif. Life 1(4), 439–441 (2014)
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: MHS 1995, Sixth International Symposium on Micro Machine and Human Science (2002)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39(3), 459–471 (2007)
Rutenbar, R.A.: Simulated annealing algorithms: an overview. IEEE Circ. Devices Mag. 5(1), 19–26 (1989)
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)
Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf. Sci. 183(1), 1–15 (2012)
Mirjalili, S.: Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl.-Based Syst. 89, 228–249 (2015)
Miao, F., Zhou, Y., Luo, Q.: Complex-valued encoding symbiotic organisms search algorithm for global optimization. Knowl. Inf. Syst. 58(1), 209–248 (2019)
Chen, D.-B., Li, H.-J., Li, Z.: Particle swarm optimization based on complex-valued encoding and application in function optimization. Comput. Eng. Appl. 45, 59–61 (2009)
Gandomi, A.H., Yang, X.S., Alavi, A.H.: Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng. Comput. 29(2), 245 (2013)
Mirjalili, S.: SCA: a sine cosine algorithm for solving optimization problems. Knowl.-Based Syst. 96, 120–133 (2016)
Acknowledgments
This work is supported by National Science Foundation of China under Grant No. 61563008. Project of Guangxi University for Nationalities Science Foundation under Grant No. 2018GXNSFAA138146.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, P., Zhou, Y., Luo, Q., Fan, C., Xiang, Z. (2019). A Complex-Valued Encoding Moth-Flame Optimization Algorithm for Global Optimization. In: Huang, DS., Bevilacqua, V., Premaratne, P. (eds) Intelligent Computing Theories and Application. ICIC 2019. Lecture Notes in Computer Science(), vol 11643. Springer, Cham. https://doi.org/10.1007/978-3-030-26763-6_69
Download citation
DOI: https://doi.org/10.1007/978-3-030-26763-6_69
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26762-9
Online ISBN: 978-3-030-26763-6
eBook Packages: Computer ScienceComputer Science (R0)