{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T19:09:04Z","timestamp":1771355344865,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T00:00:00Z","timestamp":1673913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T00:00:00Z","timestamp":1673913600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP20K11967"],"award-info":[{"award-number":["JP20K11967"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many optimization problems suffer from noise, and the noise combined with the large-scale attributes makes the problem complexity explode. Cooperative coevolution (CC) based on divide and conquer decomposes the problems and solves the sub-problems alternately, which is a popular framework for solving large-scale optimization problems (LSOPs). Many studies show that the CC framework is sensitive to decomposition, and the high-accuracy decomposition methods such as differential grouping (DG), DG2, and recursive DG (RDG) are extremely sensitive to sampling accuracy, which will fail to detect the interactions in noisy environments. Therefore, solving LSOPs in noisy environments based on the CC framework faces unprecedented challenges. In this paper, we propose a novel decomposition method named linkage measurement minimization (LMM). We regard the decomposition problem as a combinatorial optimization problem and design the linkage measurement function (LMF) based on Linkage Identification by non-linearity check for real-coded GA (LINC-R). A detailed theoretical analysis explains why our proposal can determine the interactions in noisy environments. In the optimization, we introduce an advanced optimizer named modified differential evolution with distance-based selection (MDE-DS), and the various mutation strategy and distance-based selection endow MDE-DS with strong anti-noise ability. Numerical experiments show that our proposal is competitive with the state-of-the-art decomposition methods in noisy environments, and the introduction of MDE-DS can accelerate the optimization in noisy environments significantly.<\/jats:p>","DOI":"10.1007\/s40747-022-00957-6","type":"journal-article","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T04:39:21Z","timestamp":1673930361000},"page":"4439-4456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Cooperative coevolutionary differential evolution with linkage measurement minimization for large-scale optimization problems in noisy environments"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4605-5579","authenticated-orcid":false,"given":"Rui","family":"Zhong","sequence":"first","affiliation":[]},{"given":"Enzhi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Masaharu","family":"Munetomo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,17]]},"reference":[{"issue":"2","key":"957_CR1","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.advengsoft.2009.06.007","volume":"41","author":"D Greiner","year":"2010","unstructured":"Greiner D, Aznarez JJ, Maeso O, Winter G (2010) Single- and multi-objective shape design of y-noise barriers using evolutionary computation and boundary elements. Adv Eng Softw 41(2):368\u2013378. https:\/\/doi.org\/10.1016\/j.advengsoft.2009.06.007","journal-title":"Adv Eng Softw"},{"key":"957_CR2","doi-asserted-by":"publisher","unstructured":"Hughes EJ (2001) Evolutionary multi-objective ranking with uncertainty and noise. In: International conference on evolutionary multi-criterion optimization. Springer, pp 329\u2013343. https:\/\/doi.org\/10.1007\/3-540-44719-9_23","DOI":"10.1007\/3-540-44719-9_23"},{"issue":"6","key":"957_CR3","doi-asserted-by":"publisher","first-page":"4107","DOI":"10.1109\/TII.2021.3121287","volume":"18","author":"J Li","year":"2022","unstructured":"Li J, Zhou Q, Williams H, Xu H, Du C (2022) Cyber-physical data fusion in surrogate- assisted strength pareto evolutionary algorithm for phev energy management optimization. IEEE Trans Ind Inform 18(6):4107\u20134117. https:\/\/doi.org\/10.1109\/TII.2021.3121287","journal-title":"IEEE Trans Ind Inform"},{"key":"957_CR4","doi-asserted-by":"publisher","unstructured":"Sudholt D (2018) On the robustness of evolutionary algorithms to noise: refined results and an example where noise helps. In: Proceedings of the genetic and evolutionary computation conference, pp 1523\u20131530. https:\/\/doi.org\/10.1145\/3205455.3205595","DOI":"10.1145\/3205455.3205595"},{"key":"957_CR5","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.apacoust.2014.10.005","volume":"89","author":"J-S Kim","year":"2015","unstructured":"Kim J-S, Jeong U-C, Kim D-W, Han S-Y, Oh J-E (2015) Optimization of sirocco fan blade to reduce noise of air purifier using a metamodel and evolutionary algorithm. Appl Acoust 89:254\u2013266. https:\/\/doi.org\/10.1016\/j.apacoust.2014.10.005","journal-title":"Appl Acoust"},{"issue":"3","key":"957_CR6","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/0377-2217(94)00245-8","volume":"83","author":"L Painton","year":"1995","unstructured":"Painton L, Diwekar U (1995) Stochastic annealing for synthesis under uncertainty. Eur J Oper Res 83(3):489\u2013502. https:\/\/doi.org\/10.1016\/0377-2217(94)00245-8","journal-title":"Eur J Oper Res"},{"key":"957_CR7","first-page":"161","volume":"39","author":"J Diaz","year":"2015","unstructured":"Diaz J, Handl J (2015) Implicit and explicit averaging strategies for simulation-based optimization of a real-world production planning problem. Informatica (Slovenia) 39:161\u2013168","journal-title":"Informatica (Slovenia)"},{"issue":"9","key":"957_CR8","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/TCYB.2014.2360074","volume":"45","author":"WA Albukhanajer","year":"2014","unstructured":"Albukhanajer WA, Briffa JA, Jin Y (2014) Evolutionary multiobjective image feature extraction in the presence of noise. IEEE Trans Cybern 45(9):1757\u20131768. https:\/\/doi.org\/10.1109\/TCYB.2014.2360074","journal-title":"IEEE Trans Cybern"},{"key":"957_CR9","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2015.04.008","volume":"605","author":"Y Akimoto","year":"2015","unstructured":"Akimoto Y, Astete-Morales S, Teytaud O (2015) Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. Theor Comput Sci 605:42\u201350. https:\/\/doi.org\/10.1016\/j.tcs.2015.04.008","journal-title":"Theor Comput Sci"},{"key":"957_CR10","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2020.00002","author":"Y-W Chen","year":"2020","unstructured":"Chen Y-W, Song Q, Liu X, Sastry PS, Hu X (2020) On robustness of neural architecture search under label noise. Front Big Data. https:\/\/doi.org\/10.3389\/fdata.2020.00002","journal-title":"Front Big Data"},{"key":"957_CR11","unstructured":"Qian C, Shi J-C, Yu Y, Tang K, Zhou Z-H (2017) Subset selection under noise. Adv Neural Inf Process Syst 30"},{"key":"957_CR12","unstructured":"K\u00f6ppen M (2000) The curse of dimensionality. In: 5th online world conference on soft computing in industrial applications (WSC5), vol 1, pp 4\u20138"},{"key":"957_CR13","unstructured":"Baluja S (1994) Population-based incremental learning. a method for integrating genetic search based function optimization and competitive learning. Technical report, Carnegie-Mellon University, Pittsburgh, Pa, Department of Computer Science"},{"issue":"1","key":"957_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M Pelikan","year":"2002","unstructured":"Pelikan M, Goldberg DE, Lobo FG (2002) A survey of optimization by building and using probabilistic models. Comput Optim Appl 21(1):5\u201320. https:\/\/doi.org\/10.1023\/A:1013500812258","journal-title":"Comput Optim Appl"},{"key":"957_CR15","unstructured":"Moscato P et al. (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P report 826, 1989"},{"key":"957_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.asoc.2016.04.035","volume":"46","author":"E Li","year":"2016","unstructured":"Li E, Wang H, Ye F (2016) Two-level multi-surrogate assisted optimization method for high dimensional nonlinear problems. Appl Soft Comput 46:26\u201336. https:\/\/doi.org\/10.1016\/j.asoc.2016.04.035","journal-title":"Appl Soft Comput"},{"key":"957_CR17","doi-asserted-by":"crossref","unstructured":"Potter MA, De\u00a0Jong 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) 866 LNCS, pp 249\u2013257","DOI":"10.1007\/3-540-58484-6_269"},{"issue":"5","key":"957_CR18","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/TEVC.2017.2778089","volume":"22","author":"Y Sun","year":"2017","unstructured":"Sun Y, Kirley M, Halgamuge SK (2017) A recursive decomposition method for large scale continuous optimization. IEEE Trans Evolut Comput 22(5):647\u2013661. https:\/\/doi.org\/10.1109\/TEVC.2017.2778089","journal-title":"IEEE Trans Evolut Comput"},{"issue":"3","key":"957_CR19","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1109\/TEVC.2013.2281503","volume":"18","author":"Y Mei","year":"2014","unstructured":"Mei Y, Li X, Yao X (2014) Cooperative coevolution with route distance grouping for large-scale capacitated arc routing problems. IEEE Trans Evolut Comput 18(3):435\u2013449. https:\/\/doi.org\/10.1109\/TEVC.2013.2281503","journal-title":"IEEE Trans Evolut Comput"},{"key":"957_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ins.2014.10.035","volume":"316","author":"E Sayed","year":"2015","unstructured":"Sayed E, Essam D, Sarker R, Elsayed S (2015) Decomposition-based evolutionary algorithm for large scale constrained problems. Inf Sci 316:457\u2013486. https:\/\/doi.org\/10.1016\/j.ins.2014.10.035. (nature-inspired algorithms for large scale global optimization)","journal-title":"Inf Sci"},{"key":"957_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3130838","author":"MN Omidvar","year":"2021","unstructured":"Omidvar MN, Li X, Yao X (2021) A review of population-based metaheuristics for large-scale black-box global optimization: part a. IEEE Trans Evolut Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3130838","journal-title":"IEEE Trans Evolut Comput"},{"key":"957_CR22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3130835","author":"Omidvar Mohammad Nabi","year":"2021","unstructured":"Nabi Omidvar Mohammad, Xiaodong Li, Xin Yao (2021) A review of population-based metaheuristics for large-scale black-box global optimization: part b. IEEE Trans Evolut Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3130835","journal-title":"IEEE Trans Evolut Comput"},{"issue":"4","key":"957_CR23","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1162\/evco.1999.7.4.377","volume":"7","author":"M Munetomo","year":"1999","unstructured":"Munetomo M, Goldberg DE (1999) Linkage identification by non-monotonicity detection for overlapping functions. Evol Comput 7(4):377\u2013398. https:\/\/doi.org\/10.1162\/evco.1999.7.4.377","journal-title":"Evol Comput"},{"issue":"3","key":"957_CR24","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1109\/TEVC.2013.2281543","volume":"18","author":"MN Omidvar","year":"2014","unstructured":"Omidvar MN, Li X, Mei Y, Yao X (2014) Cooperative co-evolution with differential grouping for large scale optimization. IEEE Trans Evolut Comput 18(3):378\u2013393. https:\/\/doi.org\/10.1109\/TEVC.2013.2281543","journal-title":"IEEE Trans Evolut Comput"},{"key":"957_CR25","doi-asserted-by":"publisher","unstructured":"Sun Y, Kirley M, Halgamuge SK (2015) Extended differential grouping for large scale global optimization with direct and indirect variable interactions. In: Proceedings of the 2015 annual conference on genetic and evolutionary computation. GECCO \u201915. Association for Computing Machinery, New York, NY, USA, pp 313\u2013320. https:\/\/doi.org\/10.1145\/2739480.27546661","DOI":"10.1145\/2739480.27546661"},{"issue":"6","key":"957_CR26","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TEVC.2017.2694221","volume":"21","author":"MN Omidvar","year":"2017","unstructured":"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 Evolut Comput 21(6):929\u2013942. https:\/\/doi.org\/10.1109\/TEVC.2017.2694221","journal-title":"IEEE Trans Evolut Comput"},{"key":"957_CR27","doi-asserted-by":"publisher","DOI":"10.1145\/2791291","author":"Y Mei","year":"2016","unstructured":"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","journal-title":"ACM Trans Math Softw"},{"issue":"1","key":"957_CR28","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/TEVC.2020.3009390","volume":"25","author":"M Yang","year":"2021","unstructured":"Yang M, Zhou A, Li C, Yao X (2021) An efficient recursive differential grouping for large-scale continuous problems. IEEE Trans Evolut Comput 25(1):159\u2013171. https:\/\/doi.org\/10.1109\/TEVC.2020.3009390","journal-title":"IEEE Trans Evolut Comput"},{"issue":"33","key":"957_CR29","first-page":"8","volume":"7","author":"X Li","year":"2013","unstructured":"Li X, Tang K, Omidvar MN, Yang Z, Qin K, China H (2013) Benchmark functions for the CEC 2013 special session and competition on large-scale global optimization. Gene 7(33):8","journal-title":"Gene"},{"key":"957_CR30","doi-asserted-by":"crossref","unstructured":"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\u2013233","DOI":"10.1007\/978-3-540-24855-2_20"},{"issue":"3","key":"957_CR31","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2004.826069","volume":"8","author":"F van den Bergh","year":"2004","unstructured":"van den Bergh F, Engelbrecht AP (2004) A cooperative approach to particle swarm optimization. IEEE Trans Evolut Comput 8(3):225\u2013239. https:\/\/doi.org\/10.1109\/TEVC.2004.826069","journal-title":"IEEE Trans Evolut Comput"},{"issue":"16","key":"957_CR32","doi-asserted-by":"publisher","first-page":"4735","DOI":"10.1007\/s00500-016-2081-6","volume":"21","author":"R-L Tang","year":"2017","unstructured":"Tang R-L, Wu Z, Fang Y-J (2017) Adaptive multi-context cooperatively coevolving particle swarm optimization for large-scale problems. Soft Comput 21(16):4735\u20134754. https:\/\/doi.org\/10.1007\/s00500-016-2081-6","journal-title":"Soft Comput"},{"issue":"1","key":"957_CR33","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/72.105415","volume":"3","author":"L Holmstrom","year":"1992","unstructured":"Holmstrom L, Koistinen P (1992) Using additive noise in back-propagation training. IEEE Trans Neural Netw 3(1):24\u201338. https:\/\/doi.org\/10.1109\/72.105415","journal-title":"IEEE Trans Neural Netw"},{"key":"957_CR34","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1103\/PhysRevA.26.1589","volume":"26","author":"JM Sancho","year":"1982","unstructured":"Sancho JM, Miguel MS, Katz SL, Gunton JD (1982) Analytical and numerical studies of multiplicative noise. Phys Rev A 26:1589\u20131609. https:\/\/doi.org\/10.1103\/PhysRevA.26.1589","journal-title":"Phys Rev A"},{"issue":"3","key":"957_CR35","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments\u2014a survey. IEEE Trans Evolut Comput 9(3):303\u2013317. https:\/\/doi.org\/10.1109\/TEVC.2005.846356","journal-title":"IEEE Trans Evolut Comput"},{"issue":"2","key":"957_CR36","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF00113893","volume":"3","author":"JM Fitzpatrick","year":"1988","unstructured":"Fitzpatrick JM, Grefenstette JJ (1988) Genetic algorithms in noisy environments. Mach Learn 3(2):101\u2013120","journal-title":"Mach Learn"},{"issue":"2","key":"957_CR37","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1162\/evco.1996.4.2.113","volume":"4","author":"BL Miller","year":"1996","unstructured":"Miller BL, Goldberg DE (1996) Genetic algorithms, selection schemes, and the varying effects of noise. Evolut Comput 4(2):113\u2013131. https:\/\/doi.org\/10.1162\/evco.1996.4.2.113","journal-title":"Evolut Comput"},{"key":"957_CR38","doi-asserted-by":"publisher","unstructured":"Sano Y, Kita H, Kamihira I, Yamaguchi M (2000) Online optimization of an engine controller by means of a genetic algorithm using history of search. In: 2000 26th annual conference of the IEEE Industrial Electronics Society. IECON 2000. 2000 IEEE International conference on industrial electronics, control and instrumentation. 21st century technologies, vol 4, pp 2929\u201329344. https:\/\/doi.org\/10.1109\/IECON.2000.972463","DOI":"10.1109\/IECON.2000.972463"},{"key":"957_CR39","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1080\/00207721.2011.598964","volume":"43","author":"G Iacca","year":"2012","unstructured":"Iacca G, Neri F, Mininno E (2012) Noise analysis compact differential evolution. Int J Syst Sci IJSySc 43:1248\u20131267. https:\/\/doi.org\/10.1080\/00207721.2011.598964","journal-title":"Int J Syst Sci IJSySc"},{"key":"957_CR40","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s12293-009-0029-4","volume":"2","author":"E Mininno","year":"2010","unstructured":"Mininno E, Neri F (2010) A memetic differential evolution approach in noisy optimization. Memet Comput 2:111\u2013135. https:\/\/doi.org\/10.1007\/s12293-009-0029-4","journal-title":"Memet Comput"},{"key":"957_CR41","doi-asserted-by":"publisher","unstructured":"Storn R (1996) On the usage of differential evolution for function optimization. In: Proceedings of North American fuzzy information processing, pp 519\u2013523. https:\/\/doi.org\/10.1109\/NAFIPS.1996.534789","DOI":"10.1109\/NAFIPS.1996.534789"},{"key":"957_CR42","doi-asserted-by":"publisher","unstructured":"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\u2013330. https:\/\/doi.org\/10.1109\/AICI.2009.438","DOI":"10.1109\/AICI.2009.438"},{"issue":"4","key":"957_CR43","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1016\/j.neucom.2006.10.026","volume":"70","author":"J-X Du","year":"2007","unstructured":"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\u2013903. https:\/\/doi.org\/10.1016\/j.neucom.2006.10.026. (advanced neurocomputing theory and methodology)","journal-title":"Neurocomputing"},{"key":"957_CR44","doi-asserted-by":"publisher","unstructured":"Slowik A, Bialko M (2008) Training of artificial neural networks using differential evolution algorithm. In: 2008 conference on human system interactions, pp 60\u201365. https:\/\/doi.org\/10.1109\/HSI.2008.4581409","DOI":"10.1109\/HSI.2008.4581409"},{"key":"957_CR45","doi-asserted-by":"publisher","unstructured":"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\u201326964. https:\/\/doi.org\/10.1109\/ACCESS.2017.2773825","DOI":"10.1109\/ACCESS.2017.2773825"},{"key":"957_CR46","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.asoc.2017.03.003","volume":"57","author":"A Ghosh","year":"2017","unstructured":"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\u2013352. https:\/\/doi.org\/10.1016\/j.asoc.2017.03.003","journal-title":"Appl Soft Comput"},{"key":"957_CR47","doi-asserted-by":"publisher","unstructured":"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\u201345. https:\/\/doi.org\/10.1109\/SDE.2013.6601440","DOI":"10.1109\/SDE.2013.6601440"},{"issue":"5","key":"957_CR48","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/TEVC.2017.2778089","volume":"22","author":"Y Sun","year":"2018","unstructured":"Sun Y, Kirley M, Halgamuge SK (2018) A recursive decomposition method for large scale continuous optimization. IEEE Trans Evolut Comput 22(5):647\u2013661. https:\/\/doi.org\/10.1109\/TEVC.2017.2778089","journal-title":"IEEE Trans Evolut Comput"},{"key":"957_CR49","doi-asserted-by":"publisher","unstructured":"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 \u201918. Association for Computing Machinery, New York, NY, USA, pp 889\u2013896. https:\/\/doi.org\/10.1145\/3205455.3205483","DOI":"10.1145\/3205455.3205483"},{"key":"957_CR50","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3180224","author":"Y Wu","year":"2022","unstructured":"Wu Y, Peng X, Wang H, Jin Y, Xu D (2022) Cooperative coevolutionary CMA-ES with landscape-aware grouping in noisy environments. IEEE Trans Evolut Comput. https:\/\/doi.org\/10.1109\/TEVC.2022.3180224","journal-title":"IEEE Trans Evolut Comput"},{"key":"957_CR51","doi-asserted-by":"publisher","unstructured":"Sun Y, Kirley M, Halgamuge SK (2015) Extended differential grouping for large scale global optimization with direct and indirect variable interactions. In: Proceedings of the 2015 annual conference on genetic and evolutionary computation. GECCO \u201915. Association for Computing Machinery, New York, NY, USA, pp 313\u2013320. https:\/\/doi.org\/10.1145\/2739480.2754666","DOI":"10.1145\/2739480.2754666"},{"key":"957_CR52","unstructured":"Munetomo M (2002) Linkage identification with epistasis measures considering monotonicity conditions. In: Proceedings of the 4th Asia-Pacific conference on simulated evolution and learning. https:\/\/cir.nii.ac.jp\/crid\/1570009750206806528"},{"key":"957_CR53","unstructured":"Zhong R, Munetomo M (2022) Random population-based decomposition method by linkage identification with non-linearity minimization on graph. In: Transactions on computational science and computational intelligence. Springer"},{"key":"957_CR54","unstructured":"De\u00a0Jong KA (1975) An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, USA. AAI7609381"},{"key":"957_CR55","doi-asserted-by":"publisher","unstructured":"Omidvar MN, Li X, Yao X (2010) Cooperative co-evolution with delta grouping for large scale non-separable function optimization, pp 1\u20138. https:\/\/doi.org\/10.1109\/CEC.2010.5585979","DOI":"10.1109\/CEC.2010.5585979"},{"issue":"15","key":"957_CR56","doi-asserted-by":"publisher","first-page":"2985","DOI":"10.1016\/j.ins.2008.02.017","volume":"178","author":"Z Yang","year":"2008","unstructured":"Yang Z, Tang K, Yao X (2008) Large scale evolutionary optimization using cooperative coevolution. Inf Sci 178(15):2985\u20132999. https:\/\/doi.org\/10.1016\/j.ins.2008.02.017. (nature inspired problem-solving)","journal-title":"Inf Sci"},{"issue":"1","key":"957_CR57","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evolut Comput"},{"key":"957_CR58","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1061\/40569(2001)94","volume":"5","author":"G Gopalakrishnan","year":"2001","unstructured":"Gopalakrishnan G, Minsker BS, Goldberg DE (2001) Optimal sampling in a noisy genetic algorithm for risk-based remediation design. J Hydroinform 5:11\u201325. https:\/\/doi.org\/10.1061\/40569(2001)94","journal-title":"J Hydroinform"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00957-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00957-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00957-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T13:28:49Z","timestamp":1690464529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00957-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,17]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["957"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00957-6","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,17]]},"assertion":[{"value":"25 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}