Skip to main content

Advertisement

Springer Nature Link
Log in

A multi-granular general evolutionary computation framework by fully utilizing the eliminated particles

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

In the evolutionary algorithm, an intuitive phenomenon is that the eliminated bad particles are also beneficial to convergence in evolutionary algorithms by preventing the generated particles from being close to those eliminated bad particles. Most existing algorithms do not take full advantage of the historical information of these particles or use surrogate models without guaranteeing approximation accuracy. In this study, we propose a multi-granularity general framework to divide the feasible region into different granularities by utilizing completely random trees and computing the spatial distribution of individuals. Secondly, through the sampling and migration strategy, make full use of the sparsity of the calculated individual space distribution and the locality of the best individual in history to replace the poor individual in the current population to speed up the local convergence speed of the algorithm. The time complexity of the algorithm using this framework is equal to the maximum between the time complexity of the evolutionary algorithm using this framework and O(tMlogM), where M denotes the number of points and historical particles generated in an iteration and t denotes the number of iterations. Therefore, the additional computational cost incurred by this framework is very low. Experiments on 12 classical functions, including high-dimensional functions, show that the proposed framework can improve four respective evolutionary algorithms and achieve significantly better results in terms of convergence performance and optimization accuracy.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability

The 12 classical functions that support the findings of this study are openly available at https://www.sfu.ca/~ssurjano/optimization.html.

References

  1. He C, Zhang Y, Gong D, Ji X (2023) A review of surrogate-assisted evolutionary algorithms for expensive optimization problems, Expert Systems with Applications, p. 119495

  2. AL. da Costa Oliveira, A Britto, R Gusmão (2023) A framework for inverse surrogate modeling for fitness estimation applied to multi-objective evolutionary algorithms, Applied Soft Computing, p. 110672

  3. Zhao Y, Jiang C, Vega MA, Todd MD, Hu Z (2023) Surrogate modeling of nonlinear dynamic systems: a comparative study. J Comput Inf Sci Eng 23(1):011001

    Google Scholar 

  4. Shang X, Su L, Fang H, Zeng B, Zhang Z (2023) An efficient multi-fidelity kriging surrogate model-based method for global sensitivity analysis. Reliab Eng Syst Safety 229:108858

    Google Scholar 

  5. Z. Li, T. Gao, K. Tian, and B. Wang (2022) Elite-driven surrogate-assisted cma-es algorithm by improved lower confidence bound method, Engineering with Computers, pp. 1–21

  6. S. PAÇACI, O. BİNGÖL, and U. GÜVENÇ, A novel hybrid algorithm based on stochastic fractal search algorithm and cma-es, Düzce Üniversitesi Bilim ve Teknoloji Dergisi, vol. 11, no. 2, pp. 868–907, 2023

  7. Stanovov V, Akhmedova S, Semenkin E (2022) The automatic design of parameter adaptation techniques for differential evolution with genetic programming. Knowl-Based Syst 239:108070

    Google Scholar 

  8. Li Y, Han T, Tang S, Huang C, Zhou H, Wang Y (2023) An improved differential evolution by hybridizing with estimation-of-distribution algorithm. Inf Sci 619:439–456

    Google Scholar 

  9. Al-Omari AI, Abdallah MS (2023) Estimation of the distribution function using moving extreme and minimax ranked set sampling. Communications in Statistics-Simulation and Computation 52(5):1909–1925

    MathSciNet  Google Scholar 

  10. Wu C-G, Wang L, Wang J-J (2021) A path relinking enhanced estimation of distribution algorithm for direct acyclic graph task scheduling problem. Knowl-Based Syst 228:107255

    Google Scholar 

  11. Li J, Mei C, Xu W, Qian Y (2015) Concept learning via granular computing: a cognitive viewpoint. Inf Sci 298:447–467

    MathSciNet  Google Scholar 

  12. Pedrycz W (2005) From granular computing to computational intelligence and human-centric systems. IEEE Connections 3(2):6–11

    Google Scholar 

  13. Li J, Huang C, Qi J, Qian Y, Liu W (2017) Three-way cognitive concept learning via multi-granularity. Inf Sci 378:244–263

    Google Scholar 

  14. Liu D, Yang X, Li T (2020) Three-way decisions: beyond rough sets and granular computing. Int J Mach Learn Cybern 11:989–1002

    Google Scholar 

  15. Yu W, Zhang Z, Zhong Q (2021) Consensus reaching for magdm with multi-granular hesitant fuzzy linguistic term sets: a minimum adjustment-based approach. Ann Oper Res 300:443–466

    MathSciNet  Google Scholar 

  16. Lambora A, Gupta K, Chopra K, Genetic algorithm-a literature review, in, (2019) international conference on machine learning, big data, cloud and parallel computing (COMITCon). IEEE 2019:380–384

  17. Hassan BA (2021) Cscf: a chaotic sine cosine firefly algorithm for practical application problems. Neural Comput Appl 33(12):7011–7030

    Google Scholar 

  18. Deng W, Shang S, Cai X, Zhao H, Song Y, Xu J (2021) An improved differential evolution algorithm and its application in optimization problem. Soft Comput 25:5277–5298

    Google Scholar 

  19. Zeng Z, Zhang M, Chen T, Hong Z (2021) A new selection operator for differential evolution algorithm. Knowl-Based Syst 226:107150

    Google Scholar 

  20. Xu X, Hao J, Zheng Y (2020) Multi-objective artificial bee colony algorithm for multi-stage resource leveling problem in sharing logistics network. Computers & Industrial Engineering 142:106338

    Google Scholar 

  21. Mitchell M (1998) An introduction to genetic algorithms. MIT press

  22. Li M, Zhang J, Song J, Li Z, Lu S (2022) A clinical-oriented non-severe depression diagnosis method based on cognitive behavior of emotional conflict. IEEE Transactions on Computational Social Systems 10(1):131–141

    Google Scholar 

  23. Ren Z, Zhen X, Jiang Z, Gao Z, Li Y, Shi W (2023) Underactuated control and analysis of single blade installation using a jackup installation vessel and active tugger line force control. Mar Struct 88:103338

    Google Scholar 

  24. M. Sefrioui and J. Périaux, A hierarchical genetic algorithm using multiple models for optimization, in Parallel Problem Solving from Nature PPSN VI: 6th International Conference Paris, France, September 18–20 (2000) Proceedings 6. Springer 2000:879–888

  25. J. R. Koza et al., Hierarchical genetic algorithms operating on populations of computer programs. in International Joint Conference on Artificial Intelligence (IJCAI), vol. 89, 1989, pp. 768–774

  26. Mokshin AV, Mokshin VV, Sharnin LM (2019) Adaptive genetic algorithms used to analyze behavior of complex system. Commun Nonlinear Sci Numer Simul 71:174–186

    MathSciNet  Google Scholar 

  27. Srinivas M, Patnaik LM (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Syst Man Cybern 24(4):656–667

    Google Scholar 

  28. Xue Y, Zhu H, Liang J, Słowik A (2021) Adaptive crossover operator based multi-objective binary genetic algorithm for feature selection in classification. Knowl-Based Syst 227:107218

    Google Scholar 

  29. Jing Z, Chen J, Li X (2019) Rbf-ga: An adaptive radial basis function metamodeling with genetic algorithm for structural reliability analysis. Reliability Engineering & System Safety 189:42–57

    Google Scholar 

  30. S. Wu, F. Zhang, X. Wang, and N. Xia, Attribute reduction method using adaptive genetic algorithm and particle swarm optimization, in 2021 7th International Conference on Computing and Artificial Intelligence, 2021, pp. 278–283

  31. Harada T, Alba E (2020) Parallel genetic algorithms: a useful survey. ACM Computing Surveys (CSUR) 53(4):1–39

    Google Scholar 

  32. E. Cantu-Paz, Implementing fast and flexible parallel genetic algorithms, in Practical handbook of genetic algorithms. CRC press, 2019, pp. 65–84

  33. Reddy GT, Reddy MPK, Lakshmanna K, Rajput DS, Kaluri R, Srivastava G (2020) Hybrid genetic algorithm and a fuzzy logic classifier for heart disease diagnosis. Evol Intel 13:185–196

    Google Scholar 

  34. Zhou Y, Wang Y, Wang K, Kang L, Peng F, Wang L, Pang J (2020) Hybrid genetic algorithm method for efficient and robust evaluation of remaining useful life of supercapacitors. Appl Energy 260:114169

    Google Scholar 

  35. dos Santos Coelho L, de Andrade Bernert DL, Mariani VC, A chaotic firefly algorithm applied to reliability-redundancy optimization, in, (2011) IEEE congress of evolutionary computation (CEC). Ieee 2011:517–521

  36. M. Bidar, S. Sadaoui, M. Mouhoub, and M. Bidar, Improving firefly algorithm performance using fuzzy logic, in 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2017, pp. 2111–2116

  37. Moghaddasi SS, Faraji N (2020) A hybrid algorithm based on particle filter and genetic algorithm for target tracking. Expert Syst Appl 147:113188

    Google Scholar 

  38. Arora S, Singh H, Sharma M, Sharma S, Anand P (2019) A new hybrid algorithm based on grey wolf optimization and crow search algorithm for unconstrained function optimization and feature selection. Ieee Access 7:26343–26361

    Google Scholar 

  39. Long W, Cai S, Jiao J, Xu M, Wu T (2020) A new hybrid algorithm based on grey wolf optimizer and cuckoo search for parameter extraction of solar photovoltaic models. Energy Convers Manage 203:112243

    Google Scholar 

  40. Liu Q, Liu M, Wang F, Xiao W (2022) A dynamic stochastic search algorithm for high-dimensional optimization problems and its application to feature selection. Knowl-Based Syst 244:108517

    Google Scholar 

  41. Taylor C, Touré YT, Carnahan J, Norris DE, Dolo G, Traoré SF, Edillo FE, Lanzaro GC (2001) Gene flow among populations of the malaria vector, anopheles gambiae, in mali, west africa. Genetics 157(2):743–750

    Google Scholar 

  42. Sabar NR, Abawajy J, Yearwood J (2016) Heterogeneous cooperative co-evolution memetic differential evolution algorithm for big data optimization problems. IEEE Trans Evol Comput 21(2):315–327

    Google Scholar 

  43. Qiu X, Xu J-X, Xu Y, Tan KC (2017) A new differential evolution algorithm for minimax optimization in robust design. IEEE transactions on cybernetics 48(5):1355–1368

    Google Scholar 

  44. Yuan B, Li B, Chen H, Yao X (2014) A new evolutionary algorithm with structure mutation for the maximum balanced biclique problem. IEEE transactions on cybernetics 45(5):1054–1067

    Google Scholar 

  45. Zeng Y-R, Peng L, Zhang J, Wang L (2016) An effective hybrid differential evolution algorithm incorporating simulated annealing for joint replenishment and delivery problem with trade credit. International Journal of Computational Intelligence Systems 9(6):1001–1015

    Google Scholar 

  46. Li G, Niu P, Xiao X (2012) Development and investigation of efficient artificial bee colony algorithm for numerical function optimization. Appl Soft Comput 12(1):320–332

    Google Scholar 

  47. Li J-Q, Pan Q-K, Duan P-Y (2015) An improved artificial bee colony algorithm for solving hybrid flexible flowshop with dynamic operation skipping. IEEE transactions on cybernetics 46(6):1311–1324

    Google Scholar 

  48. Sun H, Wang K, Zhao J, Yu X (2016) Artificial bee colony algorithm with improved special centre. Int J Comput Sci Math 7(6):548–553

    MathSciNet  Google Scholar 

  49. Xue Y, Jiang J, Zhao B, Ma T (2018) A self-adaptive artificial bee colony algorithm based on global best for global optimization. Soft Comput 22:2935–2952

    Google Scholar 

  50. Zhou X, Cai X, Zhang H, Zhang Z, Jin T, Chen H, Deng W (2023) Multi-strategy competitive-cooperative co-evolutionary algorithm and its application. Inf Sci 635:328–344

    Google Scholar 

  51. Deng W, Xu J, Gao X-Z, Zhao H (2020) An enhanced msiqde algorithm with novel multiple strategies for global optimization problems. IEEE Transactions on Systems, Man, and Cybernetics: Systems 52(3):1578–1587

    Google Scholar 

  52. Song Y, Wang F, Chen X (2019) An improved genetic algorithm for numerical function optimization. Appl Intell 49:1880–1902

    Google Scholar 

  53. Ali MZ, Awad NH, Suganthan PN, Shatnawi AM, Reynolds RG (2018) An improved class of real-coded genetic algorithms for numerical optimization. Neurocomputing 275:155–166

    Google Scholar 

  54. Xia S, Xiong Z, Luo Y, Dong L, Zhang G (2015) Location difference of multiple distances based k-nearest neighbors algorithm. Knowl-Based Syst 90:99–110

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chongqing University of Posts and Telecommunications, Chongqing, China

    Yiping Xiong, Shuyin Xia, Caoxiao Li, Xiaoyu Lian, Bin Hou & Guoyin Wang

Authors
  1. Yiping Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuyin Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Caoxiao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaoyu Lian
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bin Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Guoyin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuyin Xia.

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

Xiong, Y., Xia, S., Li, C. et al. A multi-granular general evolutionary computation framework by fully utilizing the eliminated particles. Int. J. Mach. Learn. & Cyber. 15, 1927–1948 (2024). https://doi.org/10.1007/s13042-023-02006-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-023-02006-1

Keywords

Search

Navigation