Log in

A multi-role steered artificial bee colony algorithm with variable dimensionality perturbation for multimodal optimization problems

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

To address the issues of slow and premature convergence of artificial bee colony (ABC) for handling complex multimodal optimization problems, this paper proposes a multi-role steered variable dimensionality perturbation ABC called MrABC-vdp. MrABC-vdp assigns the nectar sources four distinct roles based on their quality at each iteration. To strike the global exploration and local exploitation equilibrium of the solution space, the bee colony's search behavior is tightly controlled and corrected based on the synergistic relationship established between various preference search equations under multi-role nectar source guidance and the employed bee, onlooker bee, and scout bee phases. To achieve the dynamic trade-off of the global exploration speed and local convergence accuracy of the bee colony across the iteration, a variable dimensionality perturbation is imposed on the candidate nectar sources by a simulated binary crossover operator with time-varying crossover probability. Experimental results on the CEC 2017 multimodal benchmarks show that the proposed MrABC-vdp has a significant performance advantage and strong robustness versus nine advanced homogenous and heterogenous swarm-inspired intelligent algorithms.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Thailand)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Data availability

The data are available from the corresponding author on reasonable request.

References

  1. Gao WF, Liu SY, Jiang F, Zhang JK (2011) Hybrid artificial bee colony. Syst Eng Electron 33:1167–1170

    Google Scholar 

  2. Luo LF, Zou XJ, Yang Z, Li GQ, Song XP, Zhang C (2015) Grape image fast segmentation based on improved artificial bee colony and fuzzy clustering. Trans Chin Soc Agric Mach 46:23–28. https://doi.org/10.6041/j.issn.1000-1298.2015.03.004

    Article  Google Scholar 

  3. Li YS, Wan Y, Zhang Y, Kuang HY (2022) Path planning for ware-house robot based on the artificial bee colony-adaptive genetic algorithm. Chin J Sci Instrum 43:282–290. https://doi.org/10.6041/j.issn.1000-1298.2015.03.004

    Article  Google Scholar 

  4. Li HR, Gao L, Li XY (2023) Discrete artificial bee colony algorithm for multi-objective distributed heterogeneous no-wait flowshop scheduling problem. J Mech Eng 59:291–306. https://doi.org/10.3901/JME.2023.02.291

    Article  Google Scholar 

  5. Hu Q, Tian YQ, Qi HQ, Wu P, Liu QX (2023) Optimization method for cloud manufacturing service composition based on the improved artificial bee colony algorithm. J Commun 44:200–210. https://doi.org/10.11959/j.issn.1000-436x.2023024

    Article  Google Scholar 

  6. Yu HB, Zhu QN, Kang L, Qiao GZ, Zeng JC (2023) A Multi-Operator Collaborative Particle Swarm Optimization Algorithm with Biased Roulette. Control Decis. https://doi.org/10.13195/j.kzyjc.2022.1486

  7. Yan L, Ma JH, Chai XC, Yue CT, Yu KJ, Liang J, Qu BY (2022) Adaptive dynamic multimodal differential evolution algorithm based on knowledge guidance. Control Decis. https://doi.org/10.13195/j.kzyjc.2022.0168

  8. Zhu G, Kwong S (2010) Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput 217:3166–3173. https://doi.org/10.1016/j.amc.2010.08.049

    Article  MathSciNet  Google Scholar 

  9. Wang CF, Zhang YH (2016) An improved artificial bee colony algorithm for solving optimization problems. IAENG Int J Comput Sci 43:336–343

    Google Scholar 

  10. Peng H, Deng C, Wu Z (2018) Best neighbor-guided artificial bee colony algorithm for continuous optimization problems. Soft Comput 23:8723–8740. https://doi.org/10.1007/s00500-018-3473-6

    Article  Google Scholar 

  11. Meng HY, Wei BK (2020) An improved artificial bee colony algorithm based on elite solution and random individual neighborhood information. Control Decis 35:2169–2174. https://doi.org/10.13195/j.kzyjc.2018.1797

    Article  Google Scholar 

  12. Gao WF, Liu SY, Huang L-l (2013) A novel artificial bee colony algorithm based on modified search equation and orthogonal learning. IEEE Trans Cybern 43:1011–1024. https://doi.org/10.3233/IFS-141386

    Article  Google Scholar 

  13. Sun H, **e HH, Zhao J, Deng ZH (2019) Artificial bee algorithm with weighted center. Control Decis 34:2115–2124. https://doi.org/10.13195/j.kzyjc.2018.0139

    Article  Google Scholar 

  14. Kiran MS, Hakli H, Gunduz M, Uguz H (2015) Artificial bee colony algorithm with variable search strategy for continuous optimization. Inf Sci 300:140–157. https://doi.org/10.1016/j.ins.2014.12.043

    Article  MathSciNet  Google Scholar 

  15. Wang H, Wu Z, Rahnamayan S, Sun H, Liu Y, Pan J-s (2014) Multi-strategy ensemble artificial bee colony algorithm. Inf Sci 279:587–603. https://doi.org/10.1016/j.ins.2014.04.013

    Article  MathSciNet  Google Scholar 

  16. Wang H, Wang W, Zhou X, Zhao J, Wang Y, **ao S, Xu M (2021) Artificial bee colony algorithm based on knowledge fusion. Complex Intell Syst 7:1139–1152. https://doi.org/10.1007/s40747-020-00171-2

    Article  Google Scholar 

  17. Wang C, Shang P, Shen P (2022) An improved artificial bee colony algorithm based on Bayesian estimation. Complex Intell Syst. https://doi.org/10.1007/s40747-022-00746-1

    Article  Google Scholar 

  18. Wang YC, Liu JH, **ao RB (2022) Artificial bee colony algorithm based on stimulus-response labor division. Control Decis 37:881–891. https://doi.org/10.13195/j.kzyjc.2020.1346

    Article  Google Scholar 

  19. Zhou XY, Wu ZJ, Deng CS, Peng H (2015) Neighborhood search-based artificial bee colony algorithm. J Central South Univer (Sci Technol) 46:534–546. https://doi.org/10.11817/j.issn.1672-7207.2015.02.023

    Article  Google Scholar 

  20. Zhou X, Wu Y, Zhong M, Wang M (2021) Artificial bee colony algorithm based on multiple neighborhood topologies. Appl Soft Comput 111:107697. https://doi.org/10.1016/j.asoc.2021.107697

    Article  Google Scholar 

  21. Zhou X, Wu Y, Zhong M, Wang M (2022) Artificial bee colony algorithm based on adaptive neighborhood topologies. Inf Sci 610:1078–1101. https://doi.org/10.1016/j.ins.2022.08.001

    Article  Google Scholar 

  22. Zhou XY, Hu JC, Wu YL, Zhong MS, Wang MW (2022) A multi-strategy artificial bee colony algorithm based on fitness grou**. Pattern Recogn Artif Intell 35:688–700. https://doi.org/10.16451/j.cnki.issn1003-6059.202208002

    Article  Google Scholar 

  23. Gao W, Chan FT, Huang L, Liu S (2015) Bare bones artificial bee colony algorithm with parameter adaptation and fitness-based neighborhood. Inf Sci 316:180–200. https://doi.org/10.1016/j.ins.2015.04.006

    Article  Google Scholar 

  24. Wei FT, Yue MJ, Zheng JM (2019) Artificial bee colony algorithm based on improved neighborhood search strategy. Control Decis 34:965–972. https://doi.org/10.13195/j.kzyjc.2017.1506

    Article  Google Scholar 

  25. Liu XY (2004) Interpretation of the Paretoprinciple. Econ Theory Bus Manag 57–59

  26. Qin HQ, Zhao J, Ren LK, Li BJ (2022) Aero-engine performance degradation evaluation based on improved L-SHADE algorithm. Acta Aeronaut Astronaut Sin 1–12

  27. Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82–102. https://doi.org/10.1109/4235.771163

    Article  Google Scholar 

  28. Akay B, Karaboga D (2012) A modified artificial bee colony algorithm for real-parameter optimization. Inf Sci 192:120–142. https://doi.org/10.1016/j.ins.2010.07.015

    Article  Google Scholar 

  29. Bao L, Zeng JC (2011) A bi-group differential artificial bee colony algorithm. Control Theory Appl 28:266–272

    Google Scholar 

  30. Awad N, Ali M, Liang J, Qu B, Suganthan P (2016) Evaluation criteria for the CEC 2017 special session and competition on single objective real-parameter numerical optimization. Technol Rep 5–8

  31. Storn R, Price K (1997) Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341–359. https://doi.org/10.1023/A:1008202821328

    Article  MathSciNet  Google Scholar 

  32. Rao RV, Savsani VJ, Vakharia D (2012) Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci 183:1–15. https://doi.org/10.1016/j.ins.2011.08.006

    Article  MathSciNet  Google Scholar 

  33. Cheng R, ** Y (2015) A social learning particle swarm optimization algorithm for scalable optimization. Inf Sci 291:43–60. https://doi.org/10.1016/j.ins.2014.08.039

    Article  MathSciNet  Google Scholar 

  34. Cheng R, ** Y (2014) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45:191–204. https://doi.org/10.1109/TCYB.2014.2322602

    Article  Google Scholar 

  35. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82. https://doi.org/10.1109/4235.585893

    Article  Google Scholar 

  36. Cui L, Li G, Lin Q, Du Z, Gao W, Chen J, Lu N (2016) A novel artificial bee colony algorithm with depth-first search framework and elite-guided search equation. Inf Sci 367:1012–1044. https://doi.org/10.1016/j.ins.2016.07.022

    Article  Google Scholar 

  37. Aslan S, Badem H, Karaboga D (2019) Improved quick artificial bee colony (iqABC) algorithm for global optimization. Soft Comput 23:13161–13182. https://doi.org/10.1007/s00500-019-03858-y

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China (Grant Number 62106237), the Joint Funds of the National Natural Science Foundation of China (Grant Number U21A20524), the Shanxi Province Science Foundation for Youths (Grant Number 202203021222057), the Special Fund for Science and Technology Innovation Teams of Shanxi Province (Grant Number 202204051002026), and the Natural Science Research Project of Shanxi Province (Grant Number 202103021224218).

Author information

Authors and Affiliations

Authors

Contributions

Yaxin Kang: Software, Writing—Original Draft. Haibo Yu: Conceptualization, Methodology, Writing—Review & Editing. Li Kang: Formal analysis, Investigation. Gangzhu Qiao: Writing—Review& Editing. Dongpeng Guo: Investigation. Jianchao Zeng: Supervision.

Corresponding author

Correspondence to Haibo Yu.

Ethics declarations

Competing interests

The authors declare no competing interests.

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.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kang, Y., Yu, H., Kang, L. et al. A multi-role steered artificial bee colony algorithm with variable dimensionality perturbation for multimodal optimization problems. Memetic Comp. 16, 159–178 (2024). https://doi.org/10.1007/s12293-024-00411-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-024-00411-9

Keywords

Navigation