Skip to main content
SpringerLink
Log in

Research on natural computing method of multi-spatially cooperative game based on clustering

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The exploration ability and exploitation ability of natural computing methods are two abilities that restrict each other. In order to balance the search breadth of the algorithm to the target space and the convergence accuracy of the algorithm, and improve the effect of the algorithm, this paper proposes a natural computing method of multi-spatially cooperative game based on clustering, and analyzes its convergence. Based on the idea of population space grouping, the algorithm performs the game calculation of fusion cosine similarity reverse strategy for particles in the same space, and performs binary crossover and polynomial mutation. In this paper, the algorithm is compared with the classical algorithm and the excellent algorithm in recent years on 12 classical test functions, and the 28 standard functions of CEC2013 are used for experimental evaluation. Finally, the algorithm is applied to the split torque transmission optimization of the main reducer. The experimental results show that the multi-space division of the population based on clustering is conducive to the population jumping out of the local extreme value, and the game calculation integrating cosine similarity is conducive to improving the convergence accuracy of the population. The practical engineering application also proves that the method has good universality and effectiveness.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

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

Similar content being viewed by others

References

  1. Kang Q, An J, Wang L, Wu Q-D (2012) Nature-inspired computation: A survey. Dianzi Xuebao (Acta Electron Sin) 40(3):548–558

    Google Scholar 

  2. Bharti K K, Singh P K (2016) Opposition chaotic fitness mutation based adaptive inertia weight bpso for feature selection in text clustering. Appl Soft Comput 43:20–34

    Article  Google Scholar 

  3. Hsieh F-S, Guo Y-H (2019) A discrete cooperatively coevolving particle swarm optimization algorithm for combinatorial double auctions. Appl Intell 49(11):3845–3863

    Article  Google Scholar 

  4. Liang J, Ge SL, Qu BY, Yu KJ (2020) Improved particle swarm optimization algorithm for solving power system economic dispatch problem. Control Decis 35(08):1813–1822

    Google Scholar 

  5. Ismail A M, Mohamad M S, Majid H A, Abas K H, Deris S, Zaki N, Hashim S Z M, Ibrahim Z, Remli M A (2017) An improved hybrid of particle swarm optimization and the gravitational search algorithm to produce a kinetic parameter estimation of aspartate biochemical pathways. Biosystems 162:81–89

    Article  Google Scholar 

  6. Hasanzadeh M, Meybodi M R, Ebadzadeh M M (2013) Adaptive cooperative particle swarm optimizer. Appl Intell 39(2):397–420

    Article  Google Scholar 

  7. Si W, Qin B, Li Q, Liu H (2019) A novel adaptive wavelet threshold estimation based on hybrid particle swarm optimization for partial discharge signal denoising. Optik 181:175–184

    Article  Google Scholar 

  8. Zhao X, Zhou Y, Xiang Y (2019) A grouping particle swarm optimizer. Appl Intell 49 (8):2862–2873

    Article  Google Scholar 

  9. Chen K, Zhou F, Yin L, Wang S, Wang Y, Wan F (2018) A hybrid particle swarm optimizer with sine cosine acceleration coefficients. Inf Sci 422:218–241

    Article  Google Scholar 

  10. Zhou J, Fang W, Wu X, Sun J, Cheng S (2016) An opposition-based learning competitive particle swarm optimizer. In: 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 515–521

  11. Xu L, Huang Z, Yang Z, et al. (2019) A mixed particle swarm optimization algorithm with multistage disturbances [j]. Ruan Jian Xue Bao/J Softw 30(6):1835–1852

    MATH  Google Scholar 

  12. SUN H, DENG Z-, ZHAO J, WANG H, XIE H- (2019) Hybrid mean center opposition-based learning particle swarm optimization. Acta Electon Sin 47(9):1809

    Google Scholar 

  13. WANG Y, WANG K-, ZHANG M-, LI J Hybrid double particle swarm optimization algorithm based on intuitionistic fuzzy memetic framework. Acta Electon Sin 49(6):1041

  14. Cheng R, Jin Y (2014) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191–204

    Article  Google Scholar 

  15. Tanabe R, Fukunaga A (2013) Success-history based parameter adaptation for differential evolution. In: 2013 IEEE congress on evolutionary computation. IEEE, pp 71–78

  16. Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput 15(1):55–66

    Article  Google Scholar 

  17. Mallipeddi R, Suganthan P N, Pan Q-K, Tasgetiren M F (2011) Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl Soft Comput 11(2):1679–1696

    Article  Google Scholar 

  18. Zhang J, Sanderson A C (2009) Jade: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958

    Article  Google Scholar 

  19. Qian W, Chai J, Xu Z, Zhang Z (2018) Differential evolution algorithm with multiple mutation strategies based on roulette wheel selection. Appl Intell 48(10):3612–3629

    Article  Google Scholar 

  20. Koufakou A, Georgiopoulos M (2010) A fast outlier detection strategy for distributed high-dimensional data sets with mixed attributes. Data Min Knowl Disc 20(2):259–289

    Article  Google Scholar 

  21. Han S, Zhao C, Meng W, Li C (2015) Cosine similarity based fingerprinting algorithm in wlan indoor positioning against device diversity. In: 2015 IEEE international conference on communications (ICC). IEEE, pp 2710–2714

  22. ZHANG M-, LONG D-, WANG X, YANG J (2020) Research on convergence of grey wolf optimization algorithm based on markov chain. Acta Electon Sin 48(8):1587

    Google Scholar 

  23. Feng P, Xiao-Ting LI, Qian ZHOU, Wei-Xing LI, Qi GAO (2013) Analysis of standard particle swarm optimization algorithm based on markov chain. Acta Autom Sin 39(4):381–389

    Google Scholar 

  24. Solis F J, Wets R J-B (1981) Minimization by random search techniques. Math Oper Res 6 (1):19–30

    Article  MATH  Google Scholar 

  25. 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  MATH  Google Scholar 

  26. Wang H, Wu Z, Rahnamayan S, Liu Y, Ventresca M (2011) Enhancing particle swarm optimization using generalized opposition-based learning. Inf Sci 181(20):4699–4714

    Article  Google Scholar 

  27. Wang H, Li H, Liu Y, Li C, Zeng S (2007) Opposition-based particle swarm algorithm with cauchy mutation. In: 2007 IEEE congress on evolutionary computation. IEEE, pp 4750–4756

  28. Mendes R, Kennedy J, Neves J (2004) The fully informed particle swarm: simpler, maybe better. IEEE Trans Evol Comput 8(3):204–210

    Article  Google Scholar 

  29. Zhang C, Chen J Design of split-torque transmission system base on improved particle swarm optimization. Mech Eng Autom 2021(4):41–43

Download references

Funding

National Natural Science Foundation of China(31971015). Natural Science Foundation of Heilongjiang Province in 2021(LH2021F037). Special research project on scientific and technological innovation talents of Harbin Science and Technology Bureau(2017RAQXJ050).

Author information

Author notes

    Authors and Affiliations

    1. School of Computer Science and Information Engineering, Harbin Normal University, Harbin, 150025, HeiLongjiang, People’s Republic of China

      Xu Wang, Yuxuan Gong, Weidong Ji & Guohui Zhou

    Authors
    1. Xu Wang
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. Yuxuan Gong
      View author publications

      You can also search for this author in PubMed Google Scholar

    3. Weidong Ji
      View author publications

      You can also search for this author in PubMed Google Scholar

    4. Guohui Zhou
      View author publications

      You can also search for this author in PubMed Google Scholar

    Contributions

    Contributions of all authors to this article are unanimous

    Corresponding author

    Correspondence to Weidong Ji.

    Ethics declarations

    Competing Financial Interests

    The authors have no competing interests to declare that are relevant to the content of this article.

    Additional information

    Publisher’s note

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

    Editorial Board Members and Editors

    The author has no competitive interest with members of the Editorial Committee and Editors.

    These authors contributed equally to this work.

    Rights and permissions

    Reprints and permissions

    About this article

    Check for updates. Verify currency and authenticity via CrossMark

    Cite this article

    Wang, X., Gong, Y., Ji, W. et al. Research on natural computing method of multi-spatially cooperative game based on clustering. Appl Intell 53, 4841–4858 (2023). https://doi.org/10.1007/s10489-022-03641-x

    Download citation

    • Accepted:

    • Published:

    • Issue Date:

    • DOI: https://doi.org/10.1007/s10489-022-03641-x

    Keywords

    Search

    Navigation