Advertisement

Hybrid biogeography-based optimization with enhanced mutation and CMA-ES for global optimization problem

  • Fuqing ZhaoEmail author
  • Songlin Du
  • Yi Zhang
  • Weimin Ma
  • Houbin Song
Original Research Paper
  • 9 Downloads

Abstract

In recent years, scheduling problems have attracted enormous attentions from practitioners and researches in manufacturing systems, for instance, the scheduling of computing resource in cloud infrastructure and cloud services. The scheduling problems in cloud services, big data and other service-oriented computing problems are regarded as non-separable problems. In this paper, a hybrid biogeography-based optimization with the enhanced mutation operator and CMA-ES (HBBO-CMA) is proposed to enhance the ability of exploitation on non-separable problems and alleviate the rotational variance. In the migration operator, the rotationally invariant migration operator is designed to reduce the dependence of BBO on the coordinate system and control the diversity of population. In the mutation operator, an enhanced mutation operator, which is sampled from the mean value and stand deviation of the variables of population, is employed to effectively escape the local optimum. Furthermore, the CMA-ES, which has outstanding performance on the non-separable problem, is applied to extend the exploitation of HBBO-CMA. Experimental results on CEC-2017 demonstrated the effectiveness of the proposed HBBO-CMA.

Keywords

Biogeography-based optimization CMA-ES Non-separable problems Enhanced mutation operator Rotational variance 

Notes

Acknowledgements

This work was financially supported by the National Natural Science Foundation of China under Grant Numbers 61663023. It was also supported by the Key Research Programs of Science and Technology Commission Foundation of Gansu Province (2017GS10817), Lanzhou Science Bureau project (2018-rc-98), Zhejiang Provincial Natural Science Foundation (LGJ19E050001), Wenzhou Public Welfare Science and Technology project (G20170016), respectively.

References

  1. 1.
    Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713CrossRefGoogle Scholar
  2. 2.
    Guo WA, Chen M, Wang L, Mao YF, Wu QD (2017) A survey of biogeography-based optimization. Neural Comput Appl 28(8):1909–1926CrossRefGoogle Scholar
  3. 3.
    Ma HP (2010) An analysis of the equilibrium of migration models for biogeography-based optimization. Inf Sci 180(18):3444–3464CrossRefGoogle Scholar
  4. 4.
    Guo WA, Wang L, Ge S, Ren HL, Mao YF (2015) Drift analysis of mutation operations for biogeography-based optimization. Soft Comput 19(7):1881–1892CrossRefGoogle Scholar
  5. 5.
    Ma HP, Simon D, Fei MR (2016) Statistical mechanics approximation of biogeography-based optimization. Evol Comput 24(3):427–458CrossRefGoogle Scholar
  6. 6.
    Guo WA, Wang L, Si CY, Zhang YW, Tian HJ, Hu JJ (2017) Novel migration operators of biogeography-based optimization and Markov analysis. Soft Comput 21(22):6605–6632CrossRefGoogle Scholar
  7. 7.
    Zhao FQ, Qin S, Zhang Y, Ma WM, Zhang C, Song HB (2019) A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem. Expert Syst Appl 126:321–339CrossRefGoogle Scholar
  8. 8.
    Feng QX, Liu SY, Zhang JK, Yang GP, Yong LQ (2017) Improved biogeography-based optimization with random ring topology and Powell’s method. Appl Math Modell 41:630–649MathSciNetCrossRefGoogle Scholar
  9. 9.
    Chen X, Tianfield H, Mei CL, Du WL, Liu GH (2017) Biogeography-based learning particle swarm optimization. Soft Comput 21(24):7519–7541CrossRefGoogle Scholar
  10. 10.
    Khademi G, Mohammadi H, Simon D (2017) Hybrid invasive weed/biogeography-based optimization. Eng Appl Artif Intell 64:213–231CrossRefGoogle Scholar
  11. 11.
    Chen X, Tianfield H, Du WL, Liu GH (2016) Biogeography-based optimization with covariance matrix based migration. Appl Soft Comput 45:71–85CrossRefGoogle Scholar
  12. 12.
    Al-Roomi AR, El-Hawary ME (2016) Metropolis biogeography-based optimization. Inf Sci 360:73–95CrossRefGoogle Scholar
  13. 13.
    Lin J (2016) A hybrid discrete biogeography-based optimization for the permutation flowshop scheduling problem. Int J Prod Res 54(16):4805–4814CrossRefGoogle Scholar
  14. 14.
    Liu SF, Wang PF, Zhang JC (2018) An improved biogeography-based optimization algorithm for blocking flow shop scheduling problem. Chin J Electron 27(2):351–358CrossRefGoogle Scholar
  15. 15.
    Zhang XM, Wang DD, Chen HY (2019) Improved biogeography-based optimization algorithm and its application to clustering optimization and medical image segmentation. IEEE Access 7:28810–28825CrossRefGoogle Scholar
  16. 16.
    Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evolut Comput 9(2):159–195CrossRefGoogle Scholar
  17. 17.
    Civicioglu Pinar (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144MathSciNetzbMATHGoogle Scholar
  18. 18.
    Mehrabian AR, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inf 1(4):355–366CrossRefGoogle Scholar
  19. 19.
    Feng QX, Liu SY, Zhang JK, Yang GP, Yong LQ (2014) Biogeography-based optimization with improved migration operator and self-adaptive clear duplicate operator. Appl Intell 41(2):563–581CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2020

Authors and Affiliations

  1. 1.School of Computer and Communication TechnologyLanzhou University of TechnologyLanzhouChina
  2. 2.School of Mechanical EngineeringXijin UniversityXi’anChina
  3. 3.School of Economics and ManagementTongji UniversityShanghaiChina

Personalised recommendations