Abstract
Monarch butterfly optimization (MBO) is a recently developed evolutionary algorithm which has been used in many optimization problems. Migration and adjusting operators of MBO have a significant effect on the performance of it. These two operators change candidate variables of each individual independently. So, they are rotationally variant and this is one of the limitations of MBO which can degrade its performance on non-separable problems. There are interactions among variables in non-separable problems and MBO’s operators have not any consideration to it. In this paper, we propose a linearized version of MBO to overcome the above-mentioned limitation of MBO. In other words, migration and adjusting operators of MBO are linearized. Moreover, DE’s mutation operator is integrated in our proposed algorithm to improve exploration of MBO. Our proposed algorithm which is a linearized and hybrid version of MBO (LMBO-DE) is validated by 18 benchmark functions in different dimensionality and is compared with original MBO, one of recently MBO’s improvements, and three other evolutionary algorithms (jDE, JADE, and CLPSO). Experimental results show that our proposed algorithm significantly outperforms the original MBO and its improvement in terms of solution quality and convergence rate. In comparison with the other three algorithms, LMBO-DE can find more accurate solutions.
Similar content being viewed by others
Notes
Ceil(x) rounds x to the nearest integer greater than or equal to x.
Matlab source code of MBO were downloaded from: https://github.com/ggw0122/Monarch-Butterfly- ptimization.
Matlab source code of GCMBO can be downloaded from: http://www.mathworks.com/matlabcentral/fileexchange/55339-gcmbo.
It is important to mention that in Wang et al. (2016b) the FEs is set to 8000 for the first experiments similar to ours but when D = 20.
References
Brest J, Greiner S, Boskovic B, Mernik M, Zumer V (2006) Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans Evolut Comput 10:646–657
Devikanniga D (2018) Classification of osteoporosis by artificial neural network based on monarch butterfly optimization algorithm. Healthc Technol Lett 5:70
Dorigo M (1992) Optimization, learning and natural algorithms Ph.D. Thesis, Politecnico di Milano
Eberhart R, Kennedy JA (1995) New optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, 1995. MHS’95. IEEE, pp 39–43
Eiben AE, Smith JE (2003) Introduction to evolutionary computing, vol 53. Springer, Berlin
Faris H, Aljarah I, Mirjalili S (2018) Improved monarch butterfly optimization for unconstrained global search and neural network training. Appl Intell 48:445–464
Feng Y, Yang J, Wu C, Lu M, Zhao X-J (2016) Solving 0–1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation. Memet Comput 10:1–16
Feng Y, Wang G-G, Dong J, Wang L (2017) Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem. Comput Electr Eng 67:454
García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. J Heuristics 15:617–644
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, pp 156–161
Goldberg DE (1989) Genetic alogorithms in search optimization & machine learning. Mach Learn 32:95
Gong W, Cai Z, Ling CX (2010) DE/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization. Soft Comput 15:645–665
Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39:459–471
Khatib W, Fleming PJ (1998) The stud GA: a mini revolution? In: International conference on parallel problem solving from nature. Springer, pp 683–691
Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evolut Comput 10:281–295
Liang J, Qu B, Suganthan P (2013) Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore
Maitre O, Krüger F, Querry S, Lachiche N, Collet P (2012) EASEA: specification and execution of evolutionary algorithms on GPGPU. Soft Comput 16:261–279. https://doi.org/10.1007/s00500-011-0718-z
Miller JF, Thomson P (2000) Cartesian genetic programming. In: European conference on genetic programming. Springer, pp 121–132
Simon D (2008) Biogeography-based optimization. IEEE Trans Evolut Comput 12:702–713
Simon D, Omran MG, Clerc M (2014) Linearized biogeography-based optimization with re-initialization and local search. Inf Sci 267:140–157
Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11:341–359
Wang G-G, Deb S, Cui Z (2015) Monarch butterfly optimization. Neural Comput Appl. https://doi.org/10.1007/s00521-015-1923-y
Wang G-G, Deb S, Gandomi AH, Zhang Z, Alavi AH (2016a) Chaotic cuckoo search. Soft Comput 20:3349–3362
Wang G-G, Deb S, Zhao X, Cui Z (2016b) A new monarch butterfly optimization with an improved crossover operator. Oper Res 15:1–25
Yazdani S, Shanbehzadeh J (2015) Balanced Cartesian Genetic Programming via migration and opposition-based learning: application to symbolic regression. Genet Program Evol Mach 16:133–150
Yazdani S, Shanbehzadeh J, Hadavandi E (2017) MBCGP-FE: a modified balanced cartesian genetic programming feature extractor. Knowl Based Syst 135:89–98
Yazdani S, Hadavandi E, Hower J, Chehreh Chelgani S (2018) A novel nature-inspired optimization based neural network simulator to predict coal grindability index. Eng Comput 35:1003
Zhang J, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13:945–958
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no Conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Yazdani, S., Hadavandi, E. LMBO-DE: a linearized monarch butterfly optimization algorithm improved with differential evolution. Soft Comput 23, 8029–8043 (2019). https://doi.org/10.1007/s00500-018-3439-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-018-3439-8