Abstract
Rotationally variance nature-inspired algorithms are not efficient for solving non-separable problems. One way for solving this limitation is utilizing the concept of covariance-based learning to transform the original space into the new space in which the interactions among variables are revealed and operators perform in an appropriate coordinate system. In this paper, Monarch butterfly optimization (MBO), a new nature-inspired and rotation-variance algorithm, is studied. By focusing on making MBO more rotationally invariant, a covariance-based clustered MBO (CCMBO) is presented. In the CCMBO, two primary operators of MBO are modified. An eigenvector-based migration operator and a linearized adjusting operator are utilized to make MBO more rotationally invariant. CCMBO employs a re-initialization operator to improve its exploration ability. Also, to allow exploiting obtained information about the search space, CCMBO utilizes self-organizing map clustering. The CCMBO is evaluated on an extensive set of optimization benchmark functions. It is compared with MBO, two of its improvements, and six other state-of-the-art evolutionary algorithms. The results illustrate that CCMBO obtains significantly better performance and would be a valuable and practical algorithm for optimization problems.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
Ceil(x) rounds x to the nearest integer greater than or equal to x.
The Matlab code for CEC’17 test functions can be found in the website: https://github.com/P-N-Suganthan/CEC2017-BoundContrained.
The MATLAB code of MBO is available in the website: https://github.com/ggw0122/Monarch-Butterfly-Optimization.
The MATLAB code of GCMBO is available in: http://www.mathworks.com/matlabcentral/fileexchange/55339-gcmbo.
References
Wang G-G, Deb S, Cui Z (2015) Monarch butterfly optimization. Neural Comput Appl, 1–20
Ghanem WA, Jantan A (2018) Hybridizing artificial bee colony with monarch butterfly optimization for numerical optimization problems. Neural Comput Appl 30(1):163–181
Ghetas M, Yong CH, Sumari P (2015) Harmony-based monarch butterfly optimization algorithm. In: 2015 IEEE international conference on control system, computing and engineering (ICCSCE). IEEE
Wang G-G, et al (2016) A new monarch butterfly optimization with an improved crossover operator. Oper Res, 1–25
Wang G-G, et al (2016) A discrete monarch butterfly optimization for Chinese TSP problem. In: International conference in swarm intelligence. Springer
Chen S, Chen R, Gao J (2017) A monarch butterfly optimization for the dynamic vehicle routing problem. Algorithms 10(3):107
Ghetas M, Chan HY (2020) Integrating mutation scheme into monarch butterfly algorithm for global numerical optimization. Neural Comput Appl 32(7):2165–2181
Chen M (2020) An enhanced monarch butterfly optimization with self-adaptive crossover operator for unconstrained and constrained optimization problems. Nat Comput
Feng Y, Yu X, Wang G-G (2019) A novel monarch butterfly optimization with global position updating operator for large-scale 0–1 Knapsack problems. Mathematics 7(11):1056
Rahbar M, Yazdani S (2020) Historical knowledge-based MBO for global optimization problems and its application to clustering optimization. Soft Comput, 1–17
Chen X et al (2016) Biogeography-based optimization with covariance matrix based migration. Appl Soft Comput 45:71–85
Guo S-M, Yang C-C (2015) Enhancing differential evolution utilizing eigenvector-based crossover operator. IEEE Trans Evol Comput 19(1):31–49
Wang Y et al (2014) Differential evolution based on covariance matrix learning and bimodal distribution parameter setting. Appl Soft Comput 18:232–247
Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evol Comput 9(2):159–195
Baumgartner B, Sbalzarini IF (2009) Particle swarm CMA evolution strategy for the optimization of multi-funnel landscapes. In: IEEE Congress on evolutionary computation, 2009. CEC'09. IEEE
Hansen N et al (2011) Impacts of invariance in search: When CMA-ES and PSO face ill-conditioned and non-separable problems. Appl Soft Comput 11(8):5755–5769
Caraffini F, Iacca G, Yaman A (2019) Improving (1+ 1) covariance matrix adaptation evolution strategy: a simple yet efficient approach. In: AIP conference proceedings. AIP Publishing LLC
Chen H et al (2020) Solving large-scale many-objective optimization problems by covariance matrix adaptation evolution strategy with scalable small subpopulations. Inf Sci 509:457–469
Cai Y, et al (2020) Self-organizing neighborhood-based differential evolution for global optimization. Swarm Evolut Comput, 100699
Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE Congress on evolutionary computation, 2007. CEC 2007. 2007. IEEE
Yazdani S, Hadavandi E (2018) LMBO-DE: a linearized monarch butterfly optimization algorithm improved with differential evolution. Soft Comput, 1–15
Kohonen T (1998) The self-organizing map. Neurocomputing 21(1–3):1–6
Cai Z et al (2011) A clustering-based differential evolution for global optimization. Appl Soft Comput 11(1):1363–1379
Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: Computational intelligence for modelling, control and automation, 2005 and international conference on intelligent agents, web technologies and internet commerce, 2005. IEEE
Stewart G (1985) A Jacobi-like algorithm for computing the Schur decomposition of a nonhermitian matrix. SIAM J Sci Stat Comput 6(4):853–864
Zheng Y-J, Ling H-F, Xue J-Y (2014) Ecogeography-based optimization: enhancing biogeography-based optimization with ecogeographic barriers and differentiations. Comput Oper Res 50:115–127
Suganthan PN et al (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL Rep 2005005:2005
Awad NH, Ali MZ, Suganthan PN (2017) Ensemble sinusoidal differential covariance matrix adaptation with Euclidean neighborhood for solving CEC2017 benchmark problems. In: 2017 IEEE congress on evolutionary computation (CEC). 2017. IEEE
Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67
Li S et al (2020) Slime mould algorithm: a new method for stochastic optimization. Futur Gener Comput Syst 111:300–323
Liang JJ et al (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10(3):281–295
Zhang J, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958
Gong W, Cai Z, Ling CX (2010) DE/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization. Soft Comput 15(4):645–665
Chu X et al (2020) Learning–interaction–diversification framework for swarm intelligence optimizers: a unified perspective. Neural Comput Appl 32(6):1789–1809
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
There is not any conflict of interest in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Yazdani, S., Hadavandi, E. & Mirzaei, M. CCMBO: a covariance-based clustered monarch butterfly algorithm for optimization problems. Memetic Comp. 14, 377–394 (2022). https://doi.org/10.1007/s12293-022-00359-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12293-022-00359-8