Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Cooperative coevolutionary differential evolution with adjacent intensity matrix with linkage identification for large-scale optimization problems in noisy environments

  • Research Paper
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

This paper proposes a novel decomposition method named Adjacent Intensity Matrix with Linkage Identification (ALI) which collaborates with the Cooperative Coevolution (CC) framework to solve large-scale optimization problems (LSOPs) in noisy environments. Conventional Differential Grouping (DG)-based methods in the CC framework can detect the interactions by the absolute interaction intensity. In noisy environments, the uncertainty of fitness will be amplified and the absolute interaction intensity is easily larger than the threshold, which results in all decision variables being grouped into one component. Although it is difficult to detect interactions through absolute interaction intensity in noisy environments, the relative difference between separable and non-separable decision variables may exist, which can help us determine the separability to form the sub-components. We propose the Adjacent Intensity Matrix (AIM) by an additive identification criterion and determine the significant intensity (SI) to classify the interactions by learning the regularity of intensity. Since the conventional performance indicator of decomposition accuracy (DA) cannot fully reflect the inner structure of a non-separable sub-component, we introduce a more rigorous metric to evaluate the decomposition named the similarity of dependency structure matrix (\(S_{DSM}\)). In the optimization phase after the decomposition, we employ an advanced optimizer named Modified Differential Evolution with Distance-based Selection (MDE-DS) to adapt to noisy environments. Experimental results on the CEC2013 Suite with noise show that our proposal has a broad prospect to solve LSOPs in noisy environments.

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
Algorithm 1
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Algorithm 2
Algorithm 3
Fig. 10
Fig. 11
Algorithm 4

Similar content being viewed by others

Explore related subjects

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

Data availibility

The dataset generated during the study is available from the corresponding author upon reasonable request.

References

  1. Nicolaou CA, Brown N (2013) Multi-objective optimization methods in drug design. Drug Discov Today Technol 10(3):427–435. https://doi.org/10.1016/j.ddtec.2013.02.001

    Article  Google Scholar 

  2. Fadaee M, Radzi MAM (2012) Multi-objective optimization of a stand-alone hybrid renewable energy system by using evolutionary algorithms: a review. Renew Sustain Energy Rev 16(5):3364–3369. https://doi.org/10.1016/j.rser.2012.02.071

    Article  Google Scholar 

  3. Zhong R, Peng F, Yu J, Munetomo M (2024) Q-learning based vegetation evolution for numerical optimization and wireless sensor network coverage optimization. Alex Eng J 87:148–163. https://doi.org/10.1016/j.aej.2023.12.028

    Article  Google Scholar 

  4. Köppen M (2000) The curse of dimensionality. In: 5th Online world conference on soft computing in industrial applications (WSC5) vol 1, pp 4–8

  5. Bezerra LCT, López-Ibáñez M, Stützle T (2018) A large-scale experimental evaluation of high-performing multi- and many-objective evolutionary algorithms. Evol Comput 26(4):621–656. https://doi.org/10.1162/evco_a_00217

    Article  Google Scholar 

  6. Zhong R, Zhang C, Yu J (2024) Chaotic vegetation evolution: leveraging multiple seeding strategies and a mutation module for global optimization problems. Evol Intell. https://doi.org/10.1007/s12065-023-00892-6

    Article  Google Scholar 

  7. Shi M, Ma L, Yang G (2020) A new eda with dimension reduction technique for large scale many-objective optimization. In: Tan Y, Shi Y, Tuba M (eds) Advances in swarm intelligence. Springer, Cham, pp 374–385

    Chapter  Google Scholar 

  8. Yao X, Zhao Q, Gong D, Zhu S (2021) Solution of large-scale many-objective optimization problems based on dimension reduction and solving knowledge guided evolutionary algorithm. IEEE Trans Evol Comput. https://doi.org/10.1109/TEVC.2021.3110780

    Article  Google Scholar 

  9. Liu R, Ren R, Liu J, Liu J (2020) A clustering and dimensionality reduction based evolutionary algorithm for large-scale multi-objective problems. Appl Soft Comput 89:106120. https://doi.org/10.1016/j.asoc.2020.106120

    Article  Google Scholar 

  10. Potter MA, De Jong KA (1994) A cooperative coevolutionary approach to function optimization. Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) vol 866, pp 249–257

  11. Zhong R, Zhang E, Munetomo M (2023) Cooperative coevolutionary surrogate ensemble-assisted differential evolution with efficient dual differential grouping for large-scale expensive optimization problems. Complex Intell Syst. https://doi.org/10.1007/s40747-023-01262-6

    Article  Google Scholar 

  12. Omidvar MN, Yang M, Mei Y, Li X, Yao X (2017) DG2: a faster and more accurate differential grouping for large-scale black-box optimization. IEEE Trans Evol Comput 21(6):929–942. https://doi.org/10.1109/TEVC.2017.2694221

    Article  Google Scholar 

  13. Zhong R, Zhang E, Munetomo M (2023) Cooperative coevolutionary differential evolution with linkage measurement minimization for large-scale optimization problems in noisy environments. Complex Intell Syst 9:4439–4456. https://doi.org/10.1007/s40747-022-00957-6

    Article  Google Scholar 

  14. van den Bergh F, Engelbrecht AP (2004) A cooperative approach to particle swarm optimization. IEEE Trans Evol Comput 8(3):225–239. https://doi.org/10.1109/TEVC.2004.826069

    Article  Google Scholar 

  15. Yang Z, Tang K, Yao X (2007) Differential evolution for high-dimensional function optimization. In: 2007 IEEE congress on evolutionary computation, pp 3523–3530. https://doi.org/10.1109/CEC.2007.4424929

  16. Yang Z, Tang K, Yao X (2008) Large scale evolutionary optimization using cooperative coevolution. Inf Sci 178(15):2985–2999. https://doi.org/10.1016/j.ins.2008.02.017

    Article  MathSciNet  Google Scholar 

  17. Yang Z, Tang K, Yao X (2008) Multilevel cooperative coevolution for large scale optimization. In: 2008 IEEE congress on evolutionary computation (IEEE world congress on computational intelligence), pp. 1663–1670. https://doi.org/10.1109/CEC.2008.4631014

  18. Omidvar MN, Li X, Yang Z, Yao X (2010) Cooperative co-evolution for large scale optimization through more frequent random grouping. In: IEEE congress on evolutionary computation, pp 1–8. https://doi.org/10.1109/CEC.2010.5586127

  19. Omidvar MN, Li X, Yao X (2010) Cooperative co-evolution with delta grouping for large scale non-separable function optimization, pp 1–8. https://doi.org/10.1109/CEC.2010.5585979

  20. Munetomo M, Goldberg DE (1999) Linkage identification by non-monotonicity detection for overlapping functions. Evol Comput 7(4):377–398. https://doi.org/10.1162/evco.1999.7.4.377

    Article  Google Scholar 

  21. Tezuka M, Munetomo M, Akama K (2004) Linkage identification by nonlinearity check for real-coded genetic algorithms. Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics) vol 3103, pp 222–233

  22. Chen W, Weise T, Yang Z, Tang K (2010) Large-scale global optimization using cooperative coevolution with variable interaction learning, vol 6239, pp 300–309. https://doi.org/10.1007/978-3-642-15871-1_31

  23. Ma X, Liu F, Qi Y, Wang X, Li L, Jiao L, Yin M, Gong M (2016) A multiobjective evolutionary algorithm based on decision variable analyses for multiobjective optimization problems with large-scale variables. IEEE Trans Evol Comput 20(2):275–298. https://doi.org/10.1109/TEVC.2015.2455812

    Article  Google Scholar 

  24. Omidvar MN, Li X, Mei Y, Yao X (2014) Cooperative co-evolution with differential grouping for large scale optimization. IEEE Trans Evol Comput 18(3):378–393. https://doi.org/10.1109/TEVC.2013.2281543

    Article  Google Scholar 

  25. Sun Y, Kirley M, Halgamuge SK (2015) Extended differential grouping for large scale global optimization with direct and indirect variable interactions. In: GECCO ’15. Association for Computing Machinery, New York, NY, USA, pp 313–320. https://doi.org/10.1145/2739480.2754666

  26. Mei Y, Omidvar MN, Li X, Yao X (2016) A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization. ACM Trans Math Softw. https://doi.org/10.1145/2791291

    Article  MathSciNet  Google Scholar 

  27. Sun Y, Kirley M, Halgamuge SK (2018) A recursive decomposition method for large scale continuous optimization. IEEE Trans Evol Comput 22(5):647–661. https://doi.org/10.1109/TEVC.2017.2778089

    Article  Google Scholar 

  28. Sun Y, Omidvar MN, Kirley M, Li X (2018) Adaptive threshold parameter estimation with recursive differential grouping for problem decomposition. In: Proceedings of the genetic and evolutionary computation conference. GECCO ’18. Association for Computing Machinery, New York, NY, USA, pp 889–896. https://doi.org/10.1145/3205455.3205483

  29. Sun Y, Li X, Ernst A, Omidvar MN (2019) Decomposition for large-scale optimization problems with overlapping components. In: 2019 IEEE congress on evolutionary computation (CEC), pp 326–333. https://doi.org/10.1109/CEC.2019.8790204

  30. Yang M, Zhou A, Li C, Yao X (2021) An efficient recursive differential grouping for large-scale continuous problems. IEEE Trans Evol Comput 25(1):159–171. https://doi.org/10.1109/TEVC.2020.3009390

    Article  Google Scholar 

  31. Ma X, Huang Z, Li X, Wang L, Qi Y, Zhu Z (2022) Merged differential grouping for large-scale global optimization. IEEE Trans Evol Comput 26(6):1439–1451. https://doi.org/10.1109/TEVC.2022.3144684

    Article  Google Scholar 

  32. Wu Y, Peng X, Wang H, Jin Y, Xu D (2022) Cooperative coevolutionary CMA-ES with landscape-aware grouping in noisy environments. IEEE Trans Evol Comput. https://doi.org/10.1109/TEVC.2022.3180224

    Article  Google Scholar 

  33. Ghosh A, Das S, Mallipeddi R, Das AK, Dash SS (2017) A modified differential evolution with distance-based selection for continuous optimization in presence of noise. IEEE Access 5:26944–26964. https://doi.org/10.1109/ACCESS.2017.2773825

    Article  Google Scholar 

  34. Li X, Tang K, Omidvar MN, Yang Z, Qin K (2013) Benchmark functions for the CEC 2013 special session and competition on large-scale global optimization. Gene 7(33):8

    Google Scholar 

  35. Jia Y-H, Mei Y, Zhang M (2022) Contribution-based cooperative co-evolution for nonseparable large-scale problems with overlapping subcomponents. IEEE Trans Cybern 52(6):4246–4259. https://doi.org/10.1109/TCYB.2020.3025577

    Article  Google Scholar 

  36. Chen M, Du W, Tang Y, Jin Y, Yen GG (2022) A decomposition method for both additively and non-additively separable problems. IEEE Trans Evol Comput. https://doi.org/10.1109/TEVC.2022.3218375

    Article  Google Scholar 

  37. Cherniavsky Y (2011) A note on separation of variables. Int J Math Educ Sci Technol 42(1):129–131. https://doi.org/10.1080/0020739X.2010.519793

    Article  MathSciNet  Google Scholar 

  38. Li J-Y, Zhan Z-H, Tan KC, Zhang J (2022) Dual differential grouping: a more general decomposition method for large-scale optimization. IEEE Trans Cybern. https://doi.org/10.1109/TCYB.2022.3158391

    Article  Google Scholar 

  39. Munetomo M (2002) Linkage identification based on epistasis measures to realize efficient genetic algorithms. In: Proceedings of the 2002 congress on evolutionary computation. CEC’02, vol 2, pp 1332–13372. https://doi.org/10.1109/CEC.2002.1004436

  40. Storn R (1996) On the usage of differential evolution for function optimization. In: Proceedings of North American fuzzy information processing, pp 519–523. https://doi.org/10.1109/NAFIPS.1996.534789

  41. Du J-X, Huang D-S, Wang X-F, Gu X (2007) Shape recognition based on neural networks trained by differential evolution algorithm. Neurocomputing 70(4):896–903. https://doi.org/10.1016/j.neucom.2006.10.026

    Article  Google Scholar 

  42. He X, Zhang Q, Sun N, Dong Y (2009) Feature selection with discrete binary differential evolution. In: 2009 International conference on artificial intelligence and computational intelligence, vol 4, pp 327–330. https://doi.org/10.1109/AICI.2009.438

  43. Dragoi EN, Curteanu S (2016) The use of differential evolution algorithm for solving chemical engineering problems. Rev Chem Eng 32(2):149–180. https://doi.org/10.1515/revce-2015-0042

    Article  Google Scholar 

  44. Ghosh A, Das S, Mullick SS, Mallipeddi R, Das AK (2017) A switched parameter differential evolution with optional blending crossover for scalable numerical optimization. Appl Soft Comput 57:329–352. https://doi.org/10.1016/j.asoc.2017.03.003

    Article  Google Scholar 

  45. Kundu R, Mukherjee R, Das S, Vasilakos AV (2013) Adaptive differential evolution with difference mean based perturbation for dynamic economic dispatch problem. In: 2013 IEEE symposium on differential evolution (SDE), pp 38–45. https://doi.org/10.1109/SDE.2013.6601440

  46. MUNETOMO M (2002) Linkage identification with epistasis measure considering monotonicity conditions. In: Proceedings of the 4th Asia-Pacific conference on simulated evolution and learning

  47. Yu T-L, Goldberg DE, Sastry K, Lima CF, Pelikan M (2009) Dependency structure matrix, genetic algorithms, and effective recombination. Evol Comput 17(4):595–626. https://doi.org/10.1162/evco.2009.17.4.17409

    Article  Google Scholar 

  48. Scherfgen D Integral calculator. https://www.integral-calculator.com/

  49. Yu T-L, Goldberg DE (2004) Dependency structure matrix analysis: offline utility of the dependency structure matrix genetic algorithm. In: Genetic and evolutionary computation, pp 355–366.

  50. Yu T-L, Yassine A, Goldberg D (2003) A genetic algorithm for developing modular product architectures. In: International design engineering technical conferences and computers and information in engineering conference, pp 515–524. https://doi.org/10.1115/DETC2003/DTM-48647

  51. Painton L, Diwekar U (1995) Stochastic annealing for synthesis under uncertainty. Eur J Oper Res 83(3):489–502. https://doi.org/10.1016/0377-2217(94)00245-8

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by JSPS KAKENHI Grant Number JP20K11967, JST SPRING Grant Number JPMJSP2119, and Interdisciplinary large-scale computer system (Supercomputing system).

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan

    Rui Zhong & Enzhi Zhang

  2. School of Computation Information and Technology, Technical University of Munich, Munich, Germany

    Binnan Tu

  3. Information Initiative Center, Hokkaido University, Sapporo, Japan

    Masaharu Munetomo

Authors
  1. Rui Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Binnan Tu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Enzhi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Masaharu Munetomo
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Rui Zhong: conceptualization, methodology, investigation, writing—original draft, writing—review and editing, and funding acquisition. Binnan Tu: methodology, formal analysis, and data acquisition.Enzhi Zhang: investigation, methodology, formal analysis, and writing—review and editing. Masaharu Munetomo: writing—review and editing and project administration.

Corresponding author

Correspondence to Rui Zhong.

Ethics declarations

Conflict of interest

The authors have no conflict of interest 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.

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

Zhong, R., Tu, B., Zhang, E. et al. Cooperative coevolutionary differential evolution with adjacent intensity matrix with linkage identification for large-scale optimization problems in noisy environments. Evol. Intel. 17, 3483–3503 (2024). https://doi.org/10.1007/s12065-024-00941-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-024-00941-8

Keywords