Skip to main content
Log in

Historical knowledge-based MBO for global optimization problems and its application to clustering optimization

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Monarch butterfly optimization (MBO), which is a simple and widely used algorithm, has some limitations, such as utilizing the obtained experiential knowledge about the search space inefficiently, the lack of exploration, and being rotational variance. This paper proposes a new variation of MBO, which is called knowledge-based MBO (KMBO), to address these limitations. KMBO is proposed by introducing new operators that are linearized and can utilize the population's experimental knowledge. Furthermore, KMBO adopts the re-initialization operator to enhance the exploration ability and increase the diversity of the population. To verify KMBO’s performance, it is tested on 23 well-known optimization benchmark functions and compared with MBO and five other state-of-the-art evolutionary algorithms. Experimental results confirm the superior performance of our proposed algorithm compared with MBO in terms of solution accuracy and convergence speed. Also, results demonstrate that KMBO performs better than or provides competitive performance with the other six algorithms. In addition, the real-world application of KMBO on clustering optimization is presented. The results prove that KMBO is applicable to solve real-world problems and achieve superior results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. https://archive.ics.uci.edu/.

References

  • Alcalá-Fdez J, et al (2011) Keel data-mining software tool: data set repository, integration of algorithms and experimental analysis framework. J Multiple-Valued Log Soft Comput 17

  • Alcalá-Fdez J et al (2009) KEEL: a software tool to assess evolutionary algorithms for data mining problems. Soft Comput 13(3):307–318

    Article  Google Scholar 

  • Bacanin N et al (2020) Monarch butterfly optimization based convolutional neural network design. Mathematics 8(6):936

    Article  MathSciNet  Google Scholar 

  • Chen M (2020) An enhanced monarch butterfly optimization with self-adaptive crossover operator for unconstrained and constrained optimization problems. Nat Comput

  • Dubes RC, Jain AK (1988) Algorithms for clustering data. Prentice Hall, Englewood Cliffs

  • Engelbrecht AP (2007) Computational intelligence: an introduction. Wiley, New York

    Book  Google Scholar 

  • Faris H, Aljarah I, Mirjalili S (2018) Improved monarch butterfly optimization for unconstrained global search and neural network training. Appl Intell 48(2):445–464

    Article  Google Scholar 

  • Feng Y, et al (2017) Monarch butterfly optimization algorithm with differential evolution for the discounted {0–1} knapsack problem. Acta Electron Sin 45

  • Feng Y et al (2018a) Multi-strategy monarch butterfly optimization algorithm for discounted 0–1 knapsack problem. Neural Comput Appl 30(10):3019–3036

    Article  Google Scholar 

  • Feng Y et al (2018b) Solving 0–1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation. Memet Comput 10(2):135–150

    Article  Google Scholar 

  • Feng Y et al (2018c) Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0–1 knapsack problem. Comput Electr Eng 67:454–468

    Article  Google Scholar 

  • Ghetas M, Chan HY (2018) Integrating mutation scheme into monarch butterfly algorithm for global numerical optimization. Neural Comput Appl 1–17

  • Goudos SK (2020) Cognitive radio engine design for IoT using Monarch butterfly optimization and fuzzy decision making. In: Towards cognitive IoT networks. Springer, Berlin, pp 81–100

  • Heidari AA et al (2019) Harris hawks optimization: algorithm and applications. Future Gener Comput Syst 97:849–872

    Article  Google Scholar 

  • Hu H et al (2018) Improving monarch butterfly optimization algorithm with self-adaptive population. Algorithms 11(5):71

    Article  MathSciNet  Google Scholar 

  • Liang JJ et al (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10(3):281–295

    Article  Google Scholar 

  • 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

  • Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713

    Article  Google Scholar 

  • Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359

    Article  MathSciNet  Google Scholar 

  • Strumberger I et al (2018) Hybridized monarch butterfly algorithm for global optimization problems. Int J Comput 3

  • Strumberger I et al (2019) Cloudlet scheduling by hybridized monarch butterfly optimization algorithm. J Sensor Actuator Netw 8(3):44

    Article  Google Scholar 

  • Wang G-G et al (2018) A new Monarch butterfly optimization with an improved crossover operator. Oper Res Int J 18(3):731–755

    Article  Google Scholar 

  • Wang G-G et al (2019a) A comprehensive review of krill herd algorithm: variants, hybrids and applications. Artif Intell Rev 51(1):119–148

    Article  Google Scholar 

  • Wang G-G, Deb S, Cui Z (2019b) Monarch butterfly optimization. Neural Comput Appl 31(7):1995–2014

    Article  Google Scholar 

  • Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82

    Article  Google Scholar 

  • Yang D et al (2020) Improving monarch butterfly optimization through simulated annealing strategy. J Ambient Intell Human Comput 1–12

  • Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102

    Article  Google Scholar 

  • Yazdani S, Hadavandi E (2019) LMBO-DE: a linearized monarch butterfly optimization algorithm improved with differential evolution. Soft Comput 23(17):8029–8043

    Article  Google Scholar 

  • Yi J-H, Wang J, Wang G-G (2019) Using Monarch butterfly optimization to solve the emergency vehicle routing problem with relief materials in sudden disasters. Open Geosci 11(1):391–413

    Article  Google Scholar 

  • Zhang J, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Samaneh Yazdani.

Ethics declarations

Conflict of interest

The authors of the submitted research paper entitled “Historical Knowledge-Based MBO for Global Optimization Problems and Its Application to Clustering Optimization” declare they have no conflict of interest.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rahbar, M., Yazdani, S. Historical knowledge-based MBO for global optimization problems and its application to clustering optimization. Soft Comput 25, 3485–3501 (2021). https://doi.org/10.1007/s00500-020-05381-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05381-x

Keywords

Navigation