{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T05:16:44Z","timestamp":1768886204456,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T00:00:00Z","timestamp":1673827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T00:00:00Z","timestamp":1673827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No11501442"],"award-info":[{"award-number":["No11501442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2019JM283"],"award-info":[{"award-number":["2019JM283"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s12065-023-00818-2","type":"journal-article","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T06:02:53Z","timestamp":1673848973000},"page":"1645-1651","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A large-scale global optimization algorithm with a new adaptive computing resource allocation mechanism"],"prefix":"10.1007","volume":"16","author":[{"given":"Xuefan","family":"Bao","sequence":"first","affiliation":[]},{"given":"Fei","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,16]]},"reference":[{"key":"818_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.ins.2014.10.042","volume":"295","author":"S Mandavi","year":"2015","unstructured":"Mandavi S, Shiri ME, Rahnamayan S (2015) Metaheuristics in large-scale global continues optimization: a survey. Inf Sci 295:407\u2013428","journal-title":"Inf Sci"},{"issue":"2","key":"818_CR2","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TCI.2017.2666551","volume":"3","author":"A Lagrange","year":"2017","unstructured":"Lagrange A, Fauvel M, Grizonnet M (2017) Large-scale feature selection with Gaussian mixture models for the classification of high dimensional remote sensing images. IEEE Trans Comput Imaging 3(2):230\u2013242","journal-title":"IEEE Trans Comput Imaging"},{"key":"818_CR3","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.asoc.2016.07.027","volume":"48","author":"Z Yang","year":"2016","unstructured":"Yang Z, Sendhoff B, Tang K et al (2016) Target shape design optimization by evolving B-splines with cooperative coevolution. Appl Soft Comput 48:672\u2013682","journal-title":"Appl Soft Comput"},{"key":"818_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1186\/1752-0509-6-75","volume":"6","author":"AF Villaverde","year":"2012","unstructured":"Villaverde AF, Egea JA, Banga JR (2012) A cooperative strategy for parameter estimation in large scale systems biology models. BMC Syst Biol 6:75\u201375","journal-title":"BMC Syst Biol"},{"key":"818_CR5","doi-asserted-by":"crossref","unstructured":"Potter M , De Jong K A (1994) A cooperative coevolutionary approach to function optimization. In: Third parallel problem solving form nature, pp 249\u2013257","DOI":"10.1007\/3-540-58484-6_269"},{"key":"818_CR6","doi-asserted-by":"crossref","unstructured":"Omidvar MN, Li X, Yao X (2011) Smart use of computational resources based on contribution for cooperative co-evolutionary algorithms. In: Genetic and evolutionary computation conference, pp 1115\u20131122","DOI":"10.1145\/2001576.2001727"},{"key":"818_CR7","doi-asserted-by":"crossref","unstructured":"Omidvar MN, Kazimipour B, Li X, et al (2016) CBCC3\u2014a contribution-based cooperative co-evolutionary algorithm with improved exploration\/exploitation balance. In: IEEE congress on evolutionary computation, pp 3541\u20133548","DOI":"10.1109\/CEC.2016.7744238"},{"key":"818_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.asoc.2018.12.007","volume":"76","author":"B Kazimipour","year":"2018","unstructured":"Kazimipour B, Omidvar MN, Qin AK et al (2018) Bandit-based cooperative coevolution for tackling contribution imbalance in large-scale optimization problems. Appl Soft Comput 76:265\u2013281","journal-title":"Appl Soft Comput"},{"issue":"33","key":"818_CR9","first-page":"8","volume":"7","author":"X Li","year":"2013","unstructured":"Li X, Tang K, Omidvar MN et al (2013) Benchmark functions for the CEC 2013 special session and competition on large-scale global optimization. Gene 7(33):8","journal-title":"Gene"},{"issue":"2","key":"818_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s13042-021-01326-4","volume":"13","author":"AG Hussien","year":"2022","unstructured":"Hussien AG, Amin M (2022) A self-adaptive Harris hawks optimization algorithm with opposition-based learning and chaotic local search strategy for global optimization and feature selection. Int J Mach Learn Cybern 13(2):309\u2013336","journal-title":"Int J Mach Learn Cybern"},{"issue":"2","key":"818_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2791291","volume":"42","author":"Y Mei","year":"2016","unstructured":"Mei Y, Omidvar MN, Li X et al (2016) A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization. ACM Trans Math Softw 42(2):1\u201324","journal-title":"ACM Trans Math Softw"},{"key":"818_CR12","doi-asserted-by":"publisher","first-page":"108168","DOI":"10.1016\/j.asoc.2021.108168","volume":"115","author":"M Meselhi","year":"2022","unstructured":"Meselhi M, Sarker R, Essam D et al (2022) A decomposition approach for large-scale non-separable optimization problems. Appl Soft Comput 115:108168","journal-title":"Appl Soft Comput"},{"issue":"9","key":"818_CR13","first-page":"245","volume":"91","author":"N Hansen","year":"2011","unstructured":"Hansen N (2011) The CMA evolution strategy: a tutorial. Tech Rep 91(9):245\u2013532","journal-title":"Tech Rep"},{"issue":"5","key":"818_CR14","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 Evol Comput 22(5):647\u2013661","journal-title":"IEEE Trans Evol Comput"},{"key":"818_CR15","doi-asserted-by":"crossref","unstructured":"Latorre A, Muelas S, Pea J (2013) Large scale global optimization: Experimental results with MOS-based hybrid algorithms. In: Evolutionary computation, pp 2742\u20132749","DOI":"10.1109\/CEC.2013.6557901"},{"key":"818_CR16","doi-asserted-by":"crossref","unstructured":"Molina D, Lozano M, Herrera F (2010) MA-SW-chains: memetic algorithm based on local search chains for large scale continuous global optimization. In: IEEE congress on evolutionary computation, pp 18\u201323","DOI":"10.1109\/CEC.2010.5586034"},{"issue":"15","key":"818_CR17","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","journal-title":"Inf Sci"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-023-00818-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-023-00818-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-023-00818-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T09:32:41Z","timestamp":1695634361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-023-00818-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,16]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["818"],"URL":"https:\/\/doi.org\/10.1007\/s12065-023-00818-2","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,16]]},"assertion":[{"value":"31 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that there is no conflict of interests, and the data that support the findings of this study are available from the corresponding author upon reasonable request.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}