{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T11:54:20Z","timestamp":1768650860113,"version":"3.49.0"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T00:00:00Z","timestamp":1743552000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T00:00:00Z","timestamp":1743552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62373296"],"award-info":[{"award-number":["62373296"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2022JM-330"],"award-info":[{"award-number":["2022JM-330"]}],"id":[{"id":"10.13039\/501100007128","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":[[2025,5]]},"DOI":"10.1007\/s40747-025-01812-0","type":"journal-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T05:52:35Z","timestamp":1743745955000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A surrogate-assisted differential evolution algorithm with a dual-space-driven selection strategy for expensive optimization problems"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2916-1249","authenticated-orcid":false,"given":"Hanqing","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6862-3763","authenticated-orcid":false,"given":"Zhigang","family":"Ren","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4145-5100","authenticated-orcid":false,"given":"Chenlong","family":"He","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6539-0818","authenticated-orcid":false,"given":"Wenhao","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,2]]},"reference":[{"key":"1812_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/MEMB.2009.932480","volume":"28","author":"CL Lin","year":"2009","unstructured":"Lin CL, Tawhai M, McLennan G, Hoffman E (2009) Computational fluid dynamics. IEEE Eng Med Biol Mag 28:25\u201333. https:\/\/doi.org\/10.1109\/MEMB.2009.932480","journal-title":"IEEE Eng Med Biol Mag"},{"key":"1812_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/9781119426479","volume-title":"Finite element analysis: method, verification and validation","author":"B Szab\u00f3","year":"2021","unstructured":"Szab\u00f3 B, Babu\u0161ka I (2021) Finite element analysis: method, verification and validation, 2nd edn. Wiley, New York","edition":"2"},{"key":"1812_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/MCI.2009.933094","volume":"4","author":"Y Jin","year":"2009","unstructured":"Jin Y, Sendhoff B (2009) A systems approach to evolutionary multiobjective structural optimization and beyond. IEEE Comput Intell Mag 4:62\u201376. https:\/\/doi.org\/10.1109\/MCI.2009.933094","journal-title":"IEEE Comput Intell Mag"},{"key":"1812_CR4","first-page":"2039","volume":"10","author":"D Gorissen","year":"2009","unstructured":"Gorissen D, Dhaene T, Be FD (2009) Evolutionary model type selection for global surrogate modeling. J Mach Learn Res 10:2039\u20132078","journal-title":"J Mach Learn Res"},{"key":"1812_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/S10462-021-10042-Y\/FIGURES\/10","volume":"55","author":"ZH Zhan","year":"2022","unstructured":"Zhan ZH, Shi L, Tan KC, Zhang J (2022) A survey on evolutionary computation for complex continuous optimization. Artif Intell Rev 55:59\u2013110. https:\/\/doi.org\/10.1007\/S10462-021-10042-Y\/FIGURES\/10","journal-title":"Artif Intell Rev"},{"key":"1812_CR6","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/TEVC.2018.2869001","volume":"23","author":"Y Jin","year":"2019","unstructured":"Jin Y, Wang H, Chugh T et al (2019) Data-driven evolutionary optimization: an overview and case studies. IEEE Trans Evol Comput 23:442\u2013458. https:\/\/doi.org\/10.1109\/TEVC.2018.2869001","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1812_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/S11633-022-1317-4","volume":"19","author":"JY Li","year":"2022","unstructured":"Li JY, Zhan ZH, Zhang J (2022) Evolutionary computation for expensive optimization: a survey. Mach Intell Res 19(1):3\u201323. https:\/\/doi.org\/10.1007\/S11633-022-1317-4","journal-title":"Mach Intell Res"},{"key":"1812_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/J.ESWA.2022.119495","volume":"217","author":"C He","year":"2023","unstructured":"He C, Zhang Y, Gong D, Ji X (2023) A review of surrogate-assisted evolutionary algorithms for expensive optimization problems. Expert Syst Appl 217:119495. https:\/\/doi.org\/10.1016\/J.ESWA.2022.119495","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1812_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/S00163-020-00336-7","volume":"31","author":"R Alizadeh","year":"2020","unstructured":"Alizadeh R, Allen JK, Mistree F (2020) Managing computational complexity using surrogate models: a critical review. Res Eng Design 31(3):275\u2013298. https:\/\/doi.org\/10.1007\/S00163-020-00336-7","journal-title":"Res Eng Design"},{"issue":"3","key":"1812_CR10","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1007\/S00158-019-02413-5","volume":"61","author":"K Cheng","year":"2020","unstructured":"Cheng K, Lu Z, Ling C, Zhou S (2020) Surrogate-assisted global sensitivity analysis: an overview. Struct Multidiscipl Optim 61(3):1187\u20131213. https:\/\/doi.org\/10.1007\/S00158-019-02413-5","journal-title":"Struct Multidiscipl Optim"},{"key":"1812_CR11","doi-asserted-by":"publisher","unstructured":"Hansen N (2019) A global surrogate assisted CMA-ES. In: GECCO 2019\u2014proceedings of the 2019 genetic and evolutionary computation conference, pp 664\u2013672. https:\/\/doi.org\/10.1145\/3321707.3321842","DOI":"10.1145\/3321707.3321842"},{"key":"1812_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/J.SWEVO.2020.100713","volume":"57","author":"H Dong","year":"2020","unstructured":"Dong H, Dong Z (2020) Surrogate-assisted grey wolf optimization for high-dimensional, computationally expensive black-box problems. Swarm Evol Comput 57:100713. https:\/\/doi.org\/10.1016\/J.SWEVO.2020.100713","journal-title":"Swarm Evol Comput"},{"key":"1812_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/TEVC.2020.3017865","volume":"25","author":"FF Wei","year":"2021","unstructured":"Wei FF, Chen WN, Yang Q et al (2021) A classifier-assisted level-based learning swarm optimizer for expensive optimization. IEEE Trans Evol Comput 25:219\u2013233. https:\/\/doi.org\/10.1109\/TEVC.2020.3017865","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR14","doi-asserted-by":"publisher","first-page":"5720","DOI":"10.1109\/TCYB.2021.3061420","volume":"52","author":"G Li","year":"2022","unstructured":"Li G, Zhang Q, Lin Q, Gao W (2022) A three-level radial basis function method for expensive optimization. IEEE Trans Cybern 52:5720\u20135731. https:\/\/doi.org\/10.1109\/TCYB.2021.3061420","journal-title":"IEEE Trans Cybern"},{"key":"1812_CR15","doi-asserted-by":"publisher","first-page":"2685","DOI":"10.1109\/TCYB.2022.3175533","volume":"53","author":"W Wang","year":"2023","unstructured":"Wang W, Liu HL, Tan KC (2023) A surrogate-assisted differential evolution algorithm for high-dimensional expensive optimization problems. IEEE Trans Cybern 53:2685\u20132697. https:\/\/doi.org\/10.1109\/TCYB.2022.3175533","journal-title":"IEEE Trans Cybern"},{"key":"1812_CR16","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TEVC.2017.2675628","volume":"21","author":"C Sun","year":"2017","unstructured":"Sun C, Jin Y, Cheng R et al (2017) Surrogate-assisted cooperative swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 21:644\u2013660. https:\/\/doi.org\/10.1109\/TEVC.2017.2675628","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR17","doi-asserted-by":"publisher","first-page":"4671","DOI":"10.1109\/TSMC.2021.3102298","volume":"52","author":"Y Liu","year":"2022","unstructured":"Liu Y, Liu J, Jin Y (2022) Surrogate-assisted multipopulation particle swarm optimizer for high-dimensional expensive optimization. IEEE Trans Syst Man Cybern Syst 52:4671\u20134684. https:\/\/doi.org\/10.1109\/TSMC.2021.3102298","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1812_CR18","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/J.INS.2020.11.056","volume":"561","author":"JS Pan","year":"2021","unstructured":"Pan JS, Liu N, Chu SC, Lai T (2021) An efficient surrogate-assisted hybrid optimization algorithm for expensive optimization problems. Inf Sci (NY) 561:304\u2013325. https:\/\/doi.org\/10.1016\/J.INS.2020.11.056","journal-title":"Inf Sci (NY)"},{"key":"1812_CR19","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1109\/TCYB.2020.2967553","volume":"51","author":"F Li","year":"2021","unstructured":"Li F, Cai X, Gao L, Shen W (2021) A surrogate-assisted multiswarm optimization algorithm for high-dimensional computationally expensive problems. IEEE Trans Cybern 51:1390\u20131402. https:\/\/doi.org\/10.1109\/TCYB.2020.2967553","journal-title":"IEEE Trans Cybern"},{"key":"1812_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.KNOSYS.2019.01.004","volume":"170","author":"J Yi","year":"2019","unstructured":"Yi J, Gao L, Li X et al (2019) An on-line variable-fidelity surrogate-assisted harmony search algorithm with multi-level screening strategy for expensive engineering design optimization. Knowl Based Syst 170:1\u201319. https:\/\/doi.org\/10.1016\/J.KNOSYS.2019.01.004","journal-title":"Knowl Based Syst"},{"key":"1812_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/J.AST.2020.106006","volume":"105","author":"Y He","year":"2020","unstructured":"He Y, Sun J, Song P, Wang X (2020) Dual Kriging assisted efficient global optimization of expensive problems with evaluation failures. Aerosp Sci Technol 105:106006. https:\/\/doi.org\/10.1016\/J.AST.2020.106006","journal-title":"Aerosp Sci Technol"},{"key":"1812_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/J.KNOSYS.2021.107747","volume":"236","author":"M Yu","year":"2022","unstructured":"Yu M, Liang J, Wu Z, Yang Z (2022) A twofold infill criterion-driven heterogeneous ensemble surrogate-assisted evolutionary algorithm for computationally expensive problems. Knowl Based Syst 236:107747. https:\/\/doi.org\/10.1016\/J.KNOSYS.2021.107747","journal-title":"Knowl Based Syst"},{"key":"1812_CR23","doi-asserted-by":"publisher","unstructured":"Nishihara K, Nakata M (2022) Surrogate-assisted differential evolution with adaptation of training data selection criterion. In: Proceedings of the 2022 IEEE symposium series on computational intelligence, SSCI 2022, pp 1675\u20131682. https:\/\/doi.org\/10.1109\/SSCI51031.2022.10022105","DOI":"10.1109\/SSCI51031.2022.10022105"},{"key":"1812_CR24","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/TEVC.2019.2950935","volume":"24","author":"S Wang","year":"2020","unstructured":"Wang S, Liu J, Jin Y (2020) Surrogate-assisted robust optimization of large-scale networks based on graph embedding. IEEE Trans Evol Comput 24:735\u2013749. https:\/\/doi.org\/10.1109\/TEVC.2019.2950935","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR25","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1109\/TEVC.2020.3048174","volume":"25","author":"S Wang","year":"2021","unstructured":"Wang S, Liu J, Jin Y (2021) A computationally efficient evolutionary algorithm for multiobjective network robustness optimization. IEEE Trans Evol Comput 25:419\u2013432. https:\/\/doi.org\/10.1109\/TEVC.2020.3048174","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR26","doi-asserted-by":"publisher","first-page":"4176","DOI":"10.1109\/TSMC.2023.3241621","volume":"53","author":"S Wang","year":"2023","unstructured":"Wang S, Jin Y, Cai M (2023) Enhancing the robustness of networks against multiple damage models using a multifactorial evolutionary algorithm. IEEE Trans Syst Man Cybern Syst 53:4176\u20134188. https:\/\/doi.org\/10.1109\/TSMC.2023.3241621","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1812_CR27","doi-asserted-by":"publisher","first-page":"3925","DOI":"10.1109\/TCYB.2020.3008280","volume":"51","author":"JY Li","year":"2021","unstructured":"Li JY, Zhan ZH, Wang H, Zhang J (2021) Data-driven evolutionary algorithm with perturbation-based ensemble surrogates. IEEE Trans Cybern 51:3925\u20133937. https:\/\/doi.org\/10.1109\/TCYB.2020.3008280","journal-title":"IEEE Trans Cybern"},{"key":"1812_CR28","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TEVC.2013.2248012","volume":"18","author":"B Liu","year":"2014","unstructured":"Liu B, Zhang Q, Gielen GGE (2014) A gaussian process surrogate model assisted evolutionary algorithm for medium scale expensive optimization problems. IEEE Trans Evol Comput 18:180\u2013192. https:\/\/doi.org\/10.1109\/TEVC.2013.2248012","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR29","doi-asserted-by":"publisher","first-page":"2664","DOI":"10.1109\/TCYB.2017.2710978","volume":"47","author":"H Wang","year":"2017","unstructured":"Wang H, Jin Y, Doherty J (2017) Committee-based active learning for surrogate-assisted particle swarm optimization of expensive problems. IEEE Trans Cybern 47:2664\u20132677. https:\/\/doi.org\/10.1109\/TCYB.2017.2710978","journal-title":"IEEE Trans Cybern"},{"key":"1812_CR30","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TEVC.2022.3177605","volume":"27","author":"H Zhen","year":"2023","unstructured":"Zhen H, Gong W, Wang L (2023) Evolutionary sampling agent for expensive problems. IEEE Trans Evol Comput 27:716\u2013727. https:\/\/doi.org\/10.1109\/TEVC.2022.3177605","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR31","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/S00158-019-02391-8\/FIGURES\/11","volume":"61","author":"M Yu","year":"2020","unstructured":"Yu M, Li X, Liang J (2020) A dynamic surrogate-assisted evolutionary algorithm framework for expensive structural optimization. Struct Multidiscipl Optim 61:711\u2013729. https:\/\/doi.org\/10.1007\/S00158-019-02391-8\/FIGURES\/11","journal-title":"Struct Multidiscipl Optim"},{"key":"1812_CR32","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1109\/TEVC.2021.3067015","volume":"25","author":"D Zhan","year":"2021","unstructured":"Zhan D, Xing H (2021) A fast kriging-assisted evolutionary algorithm based on incremental learning. IEEE Trans Evol Comput 25:941\u2013955. https:\/\/doi.org\/10.1109\/TEVC.2021.3067015","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR33","doi-asserted-by":"publisher","first-page":"4843","DOI":"10.1109\/TSMC.2023.3257030","volume":"53","author":"J Liu","year":"2023","unstructured":"Liu J, Wang Y, Sun G, Pang T (2023) Solving highly expensive optimization problems via evolutionary expected improvement. IEEE Trans Syst Man Cybern Syst 53:4843\u20134855. https:\/\/doi.org\/10.1109\/TSMC.2023.3257030","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1812_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/J.ESWA.2022.119075","volume":"214","author":"Y Liu","year":"2023","unstructured":"Liu Y, Liu J, Tan S (2023) Decision space partition based surrogate-assisted evolutionary algorithm for expensive optimization. Expert Syst Appl 214:119075. https:\/\/doi.org\/10.1016\/J.ESWA.2022.119075","journal-title":"Expert Syst Appl"},{"key":"1812_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/J.KNOSYS.2021.106939","volume":"220","author":"SC Chu","year":"2021","unstructured":"Chu SC, Du ZG, Peng YJ, Pan JS (2021) Fuzzy hierarchical surrogate assists probabilistic particle swarm optimization for expensive high dimensional problem. Knowl Based Syst 220:106939. https:\/\/doi.org\/10.1016\/J.KNOSYS.2021.106939","journal-title":"Knowl Based Syst"},{"key":"1812_CR36","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/S00158-016-1450-1\/TABLES\/7","volume":"54","author":"H Dong","year":"2016","unstructured":"Dong H, Song B, Dong Z, Wang P (2016) Multi-start space reduction (MSSR) surrogate-based global optimization method. Struct Multidiscipl Optim 54:907\u2013926. https:\/\/doi.org\/10.1007\/S00158-016-1450-1\/TABLES\/7","journal-title":"Struct Multidiscipl Optim"},{"key":"1812_CR37","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/S40747-021-00277-1\/TABLES\/7","volume":"7","author":"Z Ren","year":"2021","unstructured":"Ren Z, Sun C, Tan Y et al (2021) A bi-stage surrogate-assisted hybrid algorithm for expensive optimization problems. Complex Intell Syst 7:1391\u20131405. https:\/\/doi.org\/10.1007\/S40747-021-00277-1\/TABLES\/7","journal-title":"Complex Intell Syst"},{"key":"1812_CR38","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/J.INS.2020.06.045","volume":"542","author":"G Chen","year":"2021","unstructured":"Chen G, Li Y, Zhang K et al (2021) Efficient hierarchical surrogate-assisted differential evolution for high-dimensional expensive optimization. Inf Sci (NY) 542:228\u2013246. https:\/\/doi.org\/10.1016\/J.INS.2020.06.045","journal-title":"Inf Sci (NY)"},{"key":"1812_CR39","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/S40747-021-00541-4\/FIGURES\/3","volume":"8","author":"S Qin","year":"2022","unstructured":"Qin S, Li C, Sun C et al (2022) Multiple infill criterion-assisted hybrid evolutionary optimization for medium-dimensional computationally expensive problems. Complex Intell Syst 8:583\u2013595. https:\/\/doi.org\/10.1007\/S40747-021-00541-4\/FIGURES\/3","journal-title":"Complex Intell Syst"},{"key":"1812_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/J.INS.2023.119745","volume":"652","author":"W Du","year":"2024","unstructured":"Du W, Ren Z, Wang J, Chen A (2024) A surrogate-assisted evolutionary algorithm with knowledge transfer for expensive multimodal optimization problems. Inf Sci (NY) 652:119745. https:\/\/doi.org\/10.1016\/J.INS.2023.119745","journal-title":"Inf Sci (NY)"},{"key":"1812_CR41","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/J.INS.2018.04.062","volume":"454\u2013455","author":"H Yu","year":"2018","unstructured":"Yu H, Tan Y, Zeng J et al (2018) Surrogate-assisted hierarchical particle swarm optimization. Inf Sci (NY) 454\u2013455:59\u201372. https:\/\/doi.org\/10.1016\/J.INS.2018.04.062","journal-title":"Inf Sci (NY)"},{"key":"1812_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/J.ASOC.2019.105659","volume":"83","author":"X Cai","year":"2019","unstructured":"Cai X, Gao L, Li F (2019) Sequential approximation optimization assisted particle swarm optimization for expensive problems. Appl Soft Comput 83:105659. https:\/\/doi.org\/10.1016\/J.ASOC.2019.105659","journal-title":"Appl Soft Comput"},{"key":"1812_CR43","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TEVC.2019.2919762","volume":"24","author":"X Cai","year":"2020","unstructured":"Cai X, Gao L, Li X (2020) Efficient generalized surrogate-assisted evolutionary algorithm for high-dimensional expensive problems. IEEE Trans Evol Comput 24:365\u2013379. https:\/\/doi.org\/10.1109\/TEVC.2019.2919762","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/J.ASOC.2021.108353","volume":"116","author":"G Chen","year":"2022","unstructured":"Chen G, Zhang K, Xue X et al (2022) A radial basis function surrogate model assisted evolutionary algorithm for high-dimensional expensive optimization problems. Appl Soft Comput 116:108353. https:\/\/doi.org\/10.1016\/J.ASOC.2021.108353","journal-title":"Appl Soft Comput"},{"key":"1812_CR45","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/J.SWEVO.2019.04.009","volume":"48","author":"X Cai","year":"2019","unstructured":"Cai X, Gao L, Li X, Qiu H (2019) Surrogate-guided differential evolution algorithm for high dimensional expensive problems. Swarm Evol Comput 48:288\u2013311. https:\/\/doi.org\/10.1016\/J.SWEVO.2019.04.009","journal-title":"Swarm Evol Comput"},{"key":"1812_CR46","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","volume":"13","author":"J Zhang","year":"2009","unstructured":"Zhang J, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13:945\u2013958. https:\/\/doi.org\/10.1109\/TEVC.2009.2014613","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR47","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/J.JOCS.2013.07.004","volume":"5","author":"RG Regis","year":"2014","unstructured":"Regis RG (2014) Particle swarm with radial basis function surrogates for expensive black-box optimization. J Comput Sci 5:12\u201323. https:\/\/doi.org\/10.1016\/J.JOCS.2013.07.004","journal-title":"J Comput Sci"},{"key":"1812_CR48","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1109\/TEVC.2019.2890818","volume":"23","author":"X Wang","year":"2019","unstructured":"Wang X, Gary Wang G, Song B et al (2019) A novel evolutionary sampling assisted optimization method for high-dimensional expensive problems. IEEE Trans Evol Comput 23:815\u2013827. https:\/\/doi.org\/10.1109\/TEVC.2019.2890818","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR49","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/J.ADVENGSOFT.2018.06.001","volume":"123","author":"H Dong","year":"2018","unstructured":"Dong H, Li C, Song B, Wang P (2018) Multi-surrogate-based differential evolution with multi-start exploration (MDEME) for computationally expensive optimization. Adv Eng Softw 123:62\u201376. https:\/\/doi.org\/10.1016\/J.ADVENGSOFT.2018.06.001","journal-title":"Adv Eng Softw"},{"key":"1812_CR50","doi-asserted-by":"publisher","unstructured":"Zhan D, Xing H (2021) A population prescreening strategy for kriging-assisted evolutionary computation. In: 2021 IEEE congress on evolutionary computation, CEC 2021\u2014proceedings, pp 893\u2013900. https:\/\/doi.org\/10.1109\/CEC45853.2021.9504976","DOI":"10.1109\/CEC45853.2021.9504976"},{"key":"1812_CR51","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147\/METRICS","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J Glob Optim 13:455\u2013492. https:\/\/doi.org\/10.1023\/A:1008306431147\/METRICS","journal-title":"J Glob Optim"},{"key":"1812_CR52","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/S10898-020-00923-X\/TABLES\/4","volume":"78","author":"D Zhan","year":"2020","unstructured":"Zhan D, Xing H (2020) Expected improvement for expensive optimization: a review. J Glob Optim 78:507\u2013544. https:\/\/doi.org\/10.1007\/S10898-020-00923-X\/TABLES\/4","journal-title":"J Glob Optim"},{"key":"1812_CR53","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/TSMCC.2005.855506","volume":"37","author":"Z Zhou","year":"2007","unstructured":"Zhou Z, Ong YS, Nair PB et al (2007) Combining global and local surrogate models to accelerate evolutionary optimization. IEEE Trans Syst Man Cybern Part C Appl Rev 37:66\u201376. https:\/\/doi.org\/10.1109\/TSMCC.2005.855506","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"key":"1812_CR54","doi-asserted-by":"publisher","first-page":"5712","DOI":"10.1109\/TIE.2017.2782203","volume":"65","author":"B Liu","year":"2018","unstructured":"Liu B, Grout V, Nikolaeva A (2018) Efficient global optimization of actuator based on a surrogate model assisted hybrid algorithm. IEEE Trans Ind Electron 65:5712\u20135721. https:\/\/doi.org\/10.1109\/TIE.2017.2782203","journal-title":"IEEE Trans Ind Electron"},{"key":"1812_CR55","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TEVC.2018.2869247","volume":"23","author":"J Tian","year":"2019","unstructured":"Tian J, Tan Y, Zeng J et al (2019) Multiobjective infill criterion driven Gaussian process-assisted particle swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 23:459\u2013472. https:\/\/doi.org\/10.1109\/TEVC.2018.2869247","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR56","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/J.ASOC.2018.10.037","volume":"74","author":"F Li","year":"2019","unstructured":"Li F, Cai X, Gao L (2019) Ensemble of surrogates assisted particle swarm optimization of medium scale expensive problems. Appl Soft Comput 74:291\u2013305. https:\/\/doi.org\/10.1016\/J.ASOC.2018.10.037","journal-title":"Appl Soft Comput"},{"key":"1812_CR57","doi-asserted-by":"publisher","unstructured":"Li G, Zhang Q, Sun J, Han Z (2019) Radial basis function assisted optimization method with batch infill sampling criterion for expensive optimization. In: 2019 IEEE congress on evolutionary computation, CEC 2019\u2014proceedings, pp 1664\u20131671. https:\/\/doi.org\/10.1109\/CEC.2019.8790310","DOI":"10.1109\/CEC.2019.8790310"},{"key":"1812_CR58","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328\/METRICS","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11:341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328\/METRICS","journal-title":"J Global Optim"},{"key":"1812_CR59","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2011","unstructured":"Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15:4\u201331. https:\/\/doi.org\/10.1109\/TEVC.2010.2059031","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492900000015","volume":"9","author":"MD Buhmann","year":"2000","unstructured":"Buhmann MD (2000) Radial basis functions. Acta Numer 9:1\u201338. https:\/\/doi.org\/10.1017\/S0962492900000015","journal-title":"Acta Numer"},{"key":"1812_CR61","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0951-8320(03)00058-9","volume":"81","author":"JC Helton","year":"2003","unstructured":"Helton JC, Davis FJ (2003) Latin hypercube sampling and the propagation of uncertainty in analyses of complex systems. Reliab Eng Syst Saf 81:23\u201369. https:\/\/doi.org\/10.1016\/S0951-8320(03)00058-9","journal-title":"Reliab Eng Syst Saf"},{"key":"1812_CR62","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"1812_CR63","unstructured":"Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Nanyang Technological University, Singapore (Technical Report)"},{"key":"1812_CR64","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1109\/TCYB.2016.2550502","volume":"47","author":"H Wang","year":"2017","unstructured":"Wang H, Jin Y, Yao X (2017) Diversity assessment in many-objective optimization. IEEE Trans Cybern 47:1510\u20131522. https:\/\/doi.org\/10.1109\/TCYB.2016.2550502","journal-title":"IEEE Trans Cybern"},{"key":"1812_CR65","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/J.SWEVO.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3\u201318. https:\/\/doi.org\/10.1016\/J.SWEVO.2011.02.002","journal-title":"Swarm Evol Comput"},{"key":"1812_CR66","doi-asserted-by":"publisher","DOI":"10.1016\/C2013-0-10517-X","volume-title":"Statistical power for the behaviour sciences","author":"J Cohen","year":"1977","unstructured":"Cohen J (1977) Statistical power for the behaviour sciences. Academic Press. https:\/\/doi.org\/10.1016\/C2013-0-10517-X"},{"key":"1812_CR67","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/S10489-018-1279-Y\/FIGURES\/7","volume":"49","author":"Z Ren","year":"2019","unstructured":"Ren Z, Pang B, Wang M et al (2019) Surrogate model assisted cooperative coevolution for large scale optimization. Appl Intell 49:513\u2013531. https:\/\/doi.org\/10.1007\/S10489-018-1279-Y\/FIGURES\/7","journal-title":"Appl Intell"},{"key":"1812_CR68","doi-asserted-by":"publisher","unstructured":"Lopez PA, Behrisch M, Bieker-Walz L et al (2018) Microscopic traffic simulation using SUMO. In: IEEE conference on intelligent transportation systems, proceedings, ITSC 2018-November, pp 2575\u20132582. https:\/\/doi.org\/10.1109\/ITSC.2018.8569938","DOI":"10.1109\/ITSC.2018.8569938"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01812-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-01812-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01812-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T10:35:35Z","timestamp":1745922935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-01812-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,2]]},"references-count":68,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1812"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-01812-0","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,2]]},"assertion":[{"value":"25 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The data used are all publicly available and have no ethical violations.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}],"article-number":"230"}}