{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T08:24:54Z","timestamp":1777710294228,"version":"3.51.4"},"reference-count":42,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":243,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"publisher","award":["2025AFB343"],"award-info":[{"award-number":["2025AFB343"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>Real\u2010parameter single\u2010objective optimization has become a prominent focus within artificial intelligence in recent years. Among population\u2010based metaheuristics, differential evolution (DE) and covariance matrix adaptation evolution strategy (CMA\u2010ES) have consistently demonstrated strong performance. However, the difficulty of solving optimization problems increases exponentially with the dimensionality of the objective function, resulting in a corresponding rise in the number of required function evaluations. To address this challenge, a novel algorithm\u2014the Gaining\u2010Sharing Knowledge (GSK)\u2013based algorithm\u2014has emerged as a promising solution. GSK\u2019s development trajectory currently resembles the early stages of DE. Nevertheless, further enhancements are necessary to unlock its full potential. In this paper, we propose an evolutionary external archive (EEA) for GSK and its variants, inspired by the external archive mechanism used in DE. The proposed EEA integrates individuals from both the current population and the archive into the evolutionary process. To promote diversity, we apply an evolutionary procedure based on CMA\u2010ES within the archive and exclude individuals from the archive if identical counterparts exist in the current generation. We evaluate our approach using three benchmark test suites from the Congress on Evolutionary Computation (CEC) and real\u2010world optimization problems from CEC 2011. Our experimental analysis compares GSK and its variants with and without the EEA. Results show that the EEA significantly improves the performance of GSK and its variants. Consequently, the GSK variant, AGSK, with the EEA is selected for further comparison against benchmark algorithms. Experimental results confirm that our proposed method is highly competitive.<\/jats:p>","DOI":"10.1155\/cplx\/8823662","type":"journal-article","created":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T15:20:22Z","timestamp":1756740022000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evolutionary External Archive for Gaining\u2010Sharing Knowledge\u2013Based Algorithm"],"prefix":"10.1155","volume":"2025","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4524-7907","authenticated-orcid":false,"given":"Hao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2794-387X","authenticated-orcid":false,"given":"Zhaoning","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1497-4407","authenticated-orcid":false,"given":"Zhenhua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2025,9,1]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2021.3077242"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.19080\/raej.2018.02.555579"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.06.036"},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101403"},{"key":"e_1_2_11_5_2","doi-asserted-by":"publisher","DOI":"10.1023\/a:1008202821328"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1162\/106365603321828970"},{"key":"e_1_2_11_7_2","doi-asserted-by":"crossref","unstructured":"AwadN. H. AliM. Z. SuganthanP. N. andReynoldsR. G. An Ensemble Sinusoidal Parameter Adaptation Incorporated With L-SHADE for Solving CEC2014 Benchmark Problems 2016 IEEE Congress on Evolutionary Computation (CEC) 2016 IEEE 2958\u20132965 https:\/\/doi.org\/10.1109\/cec.2016.7744163 2-s2.0-85008245291.","DOI":"10.1109\/CEC.2016.7744163"},{"key":"e_1_2_11_8_2","doi-asserted-by":"crossref","unstructured":"ZhangG.andShiY. Hybrid Sampling Evolution Strategy for Solving Single Objective Bound Constrained Problems In 2018 IEEE Congress on Evolutionary Computation (CEC) 2018 IEEE 1\u20137.","DOI":"10.1109\/CEC.2018.8477908"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.11.055"},{"key":"e_1_2_11_10_2","doi-asserted-by":"crossref","unstructured":"ElsayedS. HamzaN. andSarkerR. Testing United Multi-Operator Evolutionary Algorithms-II on Single Objective Optimization Problems 24 2016 IEEE Congress on Evolutionary Computation (CEC) 2016 IEEE 2966\u20132973 https:\/\/doi.org\/10.1109\/cec.2016.7744164 2-s2.0-85008262902.","DOI":"10.1109\/CEC.2016.7744164"},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.12.044"},{"key":"e_1_2_11_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.10.033"},{"key":"e_1_2_11_13_2","doi-asserted-by":"crossref","unstructured":"CaraffiniF. IaccaG. NeriF. PicinaliL. andMininnoE. A CMA-ES Super-Fit Scheme for the Re-Sampled Inheritance Search In 2013 IEEE Congress on Evolutionary Computation 2013 IEEE 1123\u20131130.","DOI":"10.1109\/CEC.2013.6557692"},{"key":"e_1_2_11_14_2","doi-asserted-by":"crossref","unstructured":"SallamK. M. ElsayedS. M. ChakraborttyR. K. andRyanM. J. Improved Multi-Operator Differential Evolution Algorithm for Solving Unconstrained Problems 2020 IEEE Congress on Evolutionary Computation (CEC) 2020 IEEE 1\u20138 https:\/\/doi.org\/10.1109\/cec48606.2020.9185577.","DOI":"10.1109\/CEC48606.2020.9185577"},{"key":"e_1_2_11_15_2","doi-asserted-by":"crossref","unstructured":"StanovovV. AkhmedovaS. andSemenkinE. NL-SHADE-RSP Algorithm With Adaptive Archive and Selective Pressure for CEC 2021 Numerical Optimization 2021 IEEE Congress on Evolutionary Computation (CEC) 2021 IEEE 809\u2013816 https:\/\/doi.org\/10.1109\/cec45853.2021.9504959.","DOI":"10.1109\/CEC45853.2021.9504959"},{"key":"e_1_2_11_16_2","doi-asserted-by":"crossref","unstructured":"BrestJ. Mau\u010decM. S. andBo\u0161kovi\u0107B. Differential Evolution Algorithm for Single Objective Bound-Constrained Optimization: Algorithm j2020 In 2020 IEEE Congress on Evolutionary Computation (CEC) 2020 IEEE 1\u20138.","DOI":"10.1109\/CEC48606.2020.9185551"},{"key":"e_1_2_11_17_2","doi-asserted-by":"crossref","unstructured":"BujokP.andKolenovskyP. Eigen Crossover in Cooperative Model of Evolutionary Algorithms Applied to CEC 2022 Single Objective Numerical Optimisation In 2022 IEEE Congress on Evolutionary Computation (CEC) 2022 IEEE 1\u20138 https:\/\/doi.org\/10.1109\/cec55065.2022.9870433.","DOI":"10.1109\/CEC55065.2022.9870433"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-019-01053-x"},{"key":"e_1_2_11_19_2","doi-asserted-by":"crossref","unstructured":"MohamedA. W. HadiA. A. MohamedA. K. andAwadN. H. Evaluating the Performance of Adaptive Gainingsharing Knowledge Based Algorithm on CEC 2020 Benchmark Problems In 2020 IEEE Congress on Evolutionary Computation (CEC) 2020 1\u20138.","DOI":"10.1109\/CEC48606.2020.9185901"},{"key":"e_1_2_11_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2021.3076091"},{"key":"e_1_2_11_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-024-01484-2"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-024-04829-4"},{"key":"e_1_2_11_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120627"},{"key":"e_1_2_11_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-024-11096-4"},{"key":"e_1_2_11_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103479"},{"key":"e_1_2_11_26_2","unstructured":"AwadN. H. AliM. Z. SuganthanP. N. LiangJ. J. andQuB. Y. Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization 2016 Nanyang Technological University Singapore Technical Report."},{"key":"e_1_2_11_27_2","doi-asserted-by":"crossref","unstructured":"MohamedA. W. HadiA. A. AgrawalP. SallamK. M. andMohamedA. K. Gaining-Sharing Knowledge Based Algorithm With Adaptive Parameters Hybrid with IMODE Algorithm for Solving CEC 2021 Benchmark Problems In 2021 IEEE Congress on Evolutionary Computation (CEC) 2021 IEEE 841\u2013848 https:\/\/doi.org\/10.1109\/cec45853.2021.9504814.","DOI":"10.1109\/CEC45853.2021.9504814"},{"key":"e_1_2_11_28_2","unstructured":"YueC. T. PriceK. V. andSuganthanP. N. Problem Definitions and Evaluation Criteria for the CEC 2020 Special Session and Competition on Single Objective Bound Constrained Numerical Optimization 2019 Computational Intelligence Lab. Institution: Zhengzhou University China Technical Report."},{"key":"e_1_2_11_29_2","unstructured":"KumarA. PriceK. V. MohamedA. W. HadiA. A. andSuganthanP. Problem Definitions and Evaluation Criteria for the CEC 2022 Special Session and Competition on Single Objective Bound Constrained Numerical Optimization 2021 Nanyang Technological University Singapore Technical Report."},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2009.2014613"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/5207362"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1166\/jctn.2016.5791"},{"key":"e_1_2_11_33_2","doi-asserted-by":"crossref","unstructured":"BrestJ. MaucecM. S. andBoskovicB. The 100-Digit Challenge: Algorithm jde100 In 2019 IEEE Congress on Evolutionary Computation (CEC) 2019 19\u201326 https:\/\/doi.org\/10.1109\/cec.2019.8789904 2-s2.0-85071338772.","DOI":"10.1109\/CEC.2019.8789904"},{"key":"e_1_2_11_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2006.872133"},{"key":"e_1_2_11_35_2","doi-asserted-by":"crossref","unstructured":"StanovovV. AkhmedovaS. andSemenkinE. LSHADE Algorithm With Rank-Based Selective Pressure Strategy for Solving CEC 2017 Benchmark Problems 2018 IEEE Congress on Evolutionary Computation (CEC) 2018 IEEE 1\u20138 https:\/\/doi.org\/10.1109\/cec.2018.8477977 2-s2.0-85056276946.","DOI":"10.1109\/CEC.2018.8477977"},{"key":"e_1_2_11_36_2","doi-asserted-by":"crossref","unstructured":"BrestJ. MaucecM. S. andBoskovicB. Self-Adaptive Differential Evolution Algorithm with Population Size Reduction for Single Objective bound-constrained Optimization: Algorithm j21 2021 IEEE Congress on Evolutionary Computation (CEC) 2021 IEEE 817\u2013824 https:\/\/doi.org\/10.1109\/cec45853.2021.9504782.","DOI":"10.1109\/CEC45853.2021.9504782"},{"key":"e_1_2_11_37_2","doi-asserted-by":"crossref","unstructured":"StanovovV. AkhmedovaS. andSemenkinE. NL-SHADE-LBC Algorithm With Linear Parameter Adaptation Bias Change for CEC 2022 Numerical Optimization 2022 IEEE Congress on Evolutionary Computation (CEC) 2022 IEEE 01\u201308 https:\/\/doi.org\/10.1109\/cec55065.2022.9870295.","DOI":"10.1109\/CEC55065.2022.9870295"},{"key":"e_1_2_11_38_2","doi-asserted-by":"crossref","unstructured":"BiedrzyckiR. ArabasJ. andWarchulskiE. A Version of NL-SHADE-RSP Algorithm With Midpoint for CEC 2022 Single Objective Bound Constrained Problems 2022 IEEE Congress on Evolutionary Computation (CEC) 2022 IEEE 1\u20138 https:\/\/doi.org\/10.1109\/cec55065.2022.9870220.","DOI":"10.1109\/CEC55065.2022.9870220"},{"key":"e_1_2_11_39_2","doi-asserted-by":"crossref","unstructured":"MohamedA. K. HadiA. A. andMohamedA. W. Generalized Adaptive Differential Evolution Algorithm for Solving CEC 2020 Benchmark Problems In 2020 2nd Novel Intelligent and Leading Emerging Sciences Conference (NILES) 2020 391\u2013396 https:\/\/doi.org\/10.1109\/niles50944.2020.9257924.","DOI":"10.1109\/NILES50944.2020.9257924"},{"key":"e_1_2_11_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-023-08580-4"},{"key":"e_1_2_11_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2022.3199647"},{"key":"e_1_2_11_42_2","volume-title":"Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms on Real World Optimization Problems","author":"Das S.","year":"2010"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/cplx\/8823662","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/cplx\/8823662","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/cplx\/8823662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T03:56:37Z","timestamp":1773028597000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/cplx\/8823662"}},"subtitle":[],"editor":[{"given":"Pramita","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1155\/cplx\/8823662"],"URL":"https:\/\/doi.org\/10.1155\/cplx\/8823662","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-07-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8823662"}}