{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:36:14Z","timestamp":1773801374828,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T00:00:00Z","timestamp":1633392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T00:00:00Z","timestamp":1633392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["61876123"],"award-info":[{"award-number":["61876123"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"shanxi science and technology innovation project for excellent talents","award":["201805D211028"],"award-info":[{"award-number":["201805D211028"]}]},{"DOI":"10.13039\/501100004480","name":"natural science foundation of shanxi province","doi-asserted-by":"publisher","award":["201901D111264"],"award-info":[{"award-number":["201901D111264"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"natural science foundation of shanxi province","doi-asserted-by":"publisher","award":["201901D111262"],"award-info":[{"award-number":["201901D111262"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010010","name":"shanxi province science foundation for youths","doi-asserted-by":"publisher","award":["201901D211237"],"award-info":[{"award-number":["201901D211237"]}],"id":[{"id":"10.13039\/501100010010","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":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Surrogate-assisted evolutionary algorithms have been paid more and more attention to solve computationally expensive problems. However, model management still plays a significant importance in searching for the optimal solution. In this paper, a new method is proposed to measure the approximation uncertainty, in which the differences between the solution and its neighbour samples in the decision space, and the ruggedness of the objective space in its neighborhood are both considered. The proposed approximation uncertainty will be utilized in the surrogate-assisted global search to find a solution for exact objective evaluation to improve the exploration capability of the global search. On the other hand, the approximated fitness value is adopted as the infill criterion for the surrogate-assisted local search, which is utilized to improve the exploitation capability to find a solution close to the real optimal solution as much as possible. The surrogate-assisted global and local searches are conducted in sequence at each generation to balance the exploration and exploitation capabilities of the method. The performance of the proposed method is evaluated on seven benchmark problems with 10, 20, 30 and 50 dimensions, and one real-world application with 30 and 50 dimensions. The experimental results show that the proposed method is efficient for solving the low- and medium-dimensional expensive optimization problems by compared to the other six state-of-the-art surrogate-assisted evolutionary algorithms.<\/jats:p>","DOI":"10.1007\/s40747-021-00541-4","type":"journal-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T16:59:14Z","timestamp":1633453154000},"page":"583-595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Multiple infill criterion-assisted hybrid evolutionary optimization for medium-dimensional computationally expensive problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Shufen","family":"Qin","sequence":"first","affiliation":[]},{"given":"Chan","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8011-8222","authenticated-orcid":false,"given":"Chaoli","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Guochen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiaobo","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"issue":"2","key":"541_CR1","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(2):365\u2013379","journal-title":"IEEE Trans Evol Comput"},{"key":"541_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ins.2014.08.039","volume":"291","author":"R Cheng","year":"2015","unstructured":"Cheng R, Jin Y (2015) A social learning particle swarm optimization algorithm for scalable optimization. Inf Sci 291:43\u201360","journal-title":"Inf Sci"},{"key":"541_CR3","doi-asserted-by":"crossref","unstructured":"Clarke SM, Griebsch JH, Simpson TW (2004) Analysis of support vector regression for approximation of complex engineering analyses. J Mech Des 127(6):1077\u20131087","DOI":"10.1115\/1.1897403"},{"issue":"3","key":"541_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00889887","volume":"22","author":"N Cressie","year":"1990","unstructured":"Cressie N (1990) The origins of Kriging. Math Geol 22(3):239\u2013252","journal-title":"Math Geol"},{"issue":"1","key":"541_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2010","unstructured":"Das S, Suganthan PN (2010) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4\u201331","journal-title":"IEEE Trans Evol Comput"},{"key":"541_CR6","first-page":"341","volume-title":"Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems","author":"S Das","year":"2010","unstructured":"Das S, Suganthan PN (2010) Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur University, Nanyang Technological University, Kolkata, pp 341\u2013359"},{"key":"541_CR7","unstructured":"Dasgupta D, Michalewicz Z (2013) Evolutionary algorithms in engineering applications. Springer, New York"},{"issue":"2","key":"541_CR8","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal RB et al (1995) Simulated binary crossover for continuous search space. Complex Syst 9(2):115\u2013148","journal-title":"Complex Syst"},{"issue":"5","key":"541_CR9","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1109\/49.56381","volume":"8","author":"ML Dukic","year":"1990","unstructured":"Dukic ML, Dobrosavljevic ZS (1990) A method of a spread-spectrum radar polyphase code design. IEEE J Sel Areas Commun 8(5):743\u2013749","journal-title":"IEEE J Sel Areas Commun"},{"issue":"11","key":"541_CR10","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1016\/S0967-0661(02)00081-3","volume":"10","author":"PJ Fleming","year":"2002","unstructured":"Fleming PJ, Purshouse RC (2002) Evolutionary algorithms in control systems engineering: a survey. Control Eng Pract 10(11):1223\u20131241","journal-title":"Control Eng Pract"},{"issue":"5","key":"541_CR11","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00158-008-0290-z","volume":"38","author":"T Goel","year":"2009","unstructured":"Goel T, Hafkta RT, Shyy W (2009) Comparing error estimation measures for polynomial and Kriging approximation of noise-free functions. Struct Multidiscip Optim 38(5):429","journal-title":"Struct Multidiscip Optim"},{"issue":"3","key":"541_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1011255519438","volume":"19","author":"HM Gutmann","year":"2001","unstructured":"Gutmann HM (2001) A radial basis function method for global optimization. J Global Optim 19(3):201\u2013227","journal-title":"J Global Optim"},{"issue":"8","key":"541_CR13","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1029\/JB076i008p01905","volume":"76","author":"RL Hardy","year":"1971","unstructured":"Hardy RL (1971) Multiquadric equations of topography and other irregular surfaces. J Geophys Res 76(8):1905\u20131915","journal-title":"J Geophys Res"},{"key":"541_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ins.2013.01.024","volume":"233","author":"SC Horng","year":"2013","unstructured":"Horng SC, Lin SY (2013) Evolutionary algorithm assisted by surrogate model in the framework of ordinal optimization and optimal computing budget allocation. Inf Sci 233:214\u2013229","journal-title":"Inf Sci"},{"key":"541_CR15","doi-asserted-by":"publisher","first-page":"100800","DOI":"10.1016\/j.swevo.2020.100800","volume":"60","author":"P Huang","year":"2021","unstructured":"Huang P, Wang H, Jin Y (2021) Offline data-driven evolutionary optimization based on tri-training. Swarm Evol Comput 60:100800","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"541_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00500-003-0328-5","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin Y (2005) A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput 9(1):3\u201312","journal-title":"Soft Comput"},{"issue":"2","key":"541_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.swevo.2011.05.001","volume":"1","author":"Y Jin","year":"2011","unstructured":"Jin Y (2011) Surrogate-assisted evolutionary computation: recent advances and future challenges. Swarm Evol Comput 1(2):61\u201370","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"541_CR18","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/TEVC.2018.2869001","volume":"23","author":"Y Jin","year":"2018","unstructured":"Jin Y, Wang H, Chugh T, Guo D, Miettinen K (2018) Data-driven evolutionary optimization: an overview and case studies. IEEE Trans Evol Comput 23(3):442\u2013458","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"541_CR19","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J Global Optim 13(4):455\u2013492","journal-title":"J Global Optim"},{"key":"541_CR20","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks, vol\u00a04, pp 1942\u20131948. IEEE","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4","key":"541_CR21","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10182-010-0143-0","volume":"94","author":"S Kuhnt","year":"2010","unstructured":"Kuhnt S, Steinberg DM (2010) Design and analysis of computer experiments. Asta Adv Stat Anal 94(4):307\u2013309","journal-title":"Asta Adv Stat Anal"},{"key":"541_CR22","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","journal-title":"Appl Soft Comput"},{"key":"541_CR23","doi-asserted-by":"crossref","unstructured":"Li F, Cai X, Gao L, Shen W (2020) A surrogate-assisted multiswarm optimization algorithm for high-dimensional computationally expensive problems. IEEE Trans Cybern","DOI":"10.1016\/j.asoc.2020.106303"},{"issue":"5","key":"541_CR24","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1109\/TEVC.2020.2979740","volume":"24","author":"JY Li","year":"2020","unstructured":"Li JY, Zhan ZH, Wang C, Jin H, Zhang J (2020) Boosting data-driven evolutionary algorithm with localized data generation. IEEE Trans Evol Comput 24(5):923\u2013937","journal-title":"IEEE Trans Evol Comput"},{"key":"541_CR25","doi-asserted-by":"crossref","unstructured":"Liao P, Sun C, Zhang G, Jin Y (2020) Multi-surrogate multi-tasking optimization of expensive problems. Knowl Based Syst 205:106262","DOI":"10.1016\/j.knosys.2020.106262"},{"issue":"3","key":"541_CR26","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/TEVC.2009.2027359","volume":"14","author":"D Lim","year":"2010","unstructured":"Lim D, Jin Y, Ong YS, Sendhoff B (2010) Generalizing surrogate-assisted evolutionary computation. IEEE Trans Evol Comput 14(3):329\u2013355","journal-title":"IEEE Trans Evol Comput"},{"key":"541_CR27","doi-asserted-by":"crossref","unstructured":"Mezura-Montes E, Vel\u00e1zquez-Reyes J, Coello\u00a0Coello CA (2006) A comparative study of differential evolution variants for global optimization. In: Proceedings of the 8th annual conference on genetic and evolutionary computation, pp 485\u2013492","DOI":"10.1145\/1143997.1144086"},{"issue":"4","key":"541_CR28","doi-asserted-by":"publisher","first-page":"687","DOI":"10.2514\/2.1999","volume":"41","author":"YS Ong","year":"2003","unstructured":"Ong YS, Nair PB, Keane AJ (2003) Evolutionary optimization of computationally expensive problems via surrogate modeling. AIAA J 41(4):687\u2013696","journal-title":"AIAA J"},{"key":"541_CR29","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 561:304\u2013325","journal-title":"Inf Sci"},{"key":"541_CR30","doi-asserted-by":"crossref","unstructured":"Williams CK, Rasmussen CE (2006) Gaussian processes for machine learning, vol 2. MIT Press Cambridge, MA","DOI":"10.7551\/mitpress\/3206.001.0001"},{"key":"541_CR31","doi-asserted-by":"crossref","unstructured":"Ren Z, Sun C, Tan Y, Zhang G, Qin S (2021) A bi-stage surrogate-assisted hybrid algorithm for expensive optimization problems. Complex Intell Syst 7(3):1391\u20131405","DOI":"10.1007\/s40747-021-00277-1"},{"issue":"3","key":"541_CR32","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/B:STCO.0000035301.49549.88","volume":"14","author":"AJ Smola","year":"2004","unstructured":"Smola AJ, Sch\u00f6lkopf B (2004) A tutorial on support vector regression. Stat Comput 14(3):199\u2013222","journal-title":"Stat Comput"},{"issue":"4","key":"541_CR33","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","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(4):341\u2013359","journal-title":"J Global Optim"},{"issue":"4","key":"541_CR34","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, Ding J, Zeng J (2017) Surrogate-assisted cooperative swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 21(4):644-660","journal-title":"IEEE Trans Evol Comput"},{"key":"541_CR35","doi-asserted-by":"crossref","unstructured":"Sun C, Jin Y, Zeng J, Yu Y (2015) A two-layer surrogate-assisted particle swarm optimization algorithm. Soft Computing 19(6):1461\u20131475","DOI":"10.1007\/s00500-014-1283-z"},{"key":"541_CR36","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ins.2012.09.030","volume":"221","author":"C Sun","year":"2013","unstructured":"Sun C, Zeng J, Pan J, Xue S, Jin Y (2013) A new fitness estimation strategy for particle swarm optimization. Inf Sci 221:355\u2013370","journal-title":"Inf Sci"},{"issue":"3","key":"541_CR37","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TEVC.2018.2869247","volume":"23","author":"J Tian","year":"2018","unstructured":"Tian J, Tan Y, Zeng J, Sun C, Jin Y (2018) Multiobjective infill criterion driven gaussian process-assisted particle swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 23(3):459\u2013472","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"541_CR38","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1115\/1.1561044","volume":"125","author":"GG Wang","year":"2003","unstructured":"Wang GG (2003) Adaptive response surface method using inherited Latin hypercube design points. J Mech Des 125(2):210\u2013220","journal-title":"J Mech Des"},{"issue":"9","key":"541_CR39","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(9):2664\u20132677","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"541_CR40","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TEVC.2018.2834881","volume":"23","author":"H Wang","year":"2018","unstructured":"Wang H, Jin Y, Sun C, Doherty J (2018) Offline data-driven evolutionary optimization using selective surrogate ensembles. IEEE Trans Evol Comput 23(2):203\u2013216","journal-title":"IEEE Trans Evol Comput"},{"key":"541_CR41","doi-asserted-by":"crossref","unstructured":"Wang W (2008) Face recognition based on radial basis function neural networks. In: 2008 International seminar on future information technology and management engineering, pp 41\u201344","DOI":"10.1109\/FITME.2008.79"},{"key":"541_CR42","volume-title":"Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test","author":"F Wilcoxon","year":"1963","unstructured":"Wilcoxon F, Katti S, Wilcox RA (1963) Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test. American Cyanamid Company, Pearl River"},{"key":"541_CR43","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.knosys.2018.08.010","volume":"163","author":"H Yu","year":"2019","unstructured":"Yu H, Tan Y, Sun C, Zeng J (2019) A generation-based optimal restart strategy for surrogate-assisted social learning particle swarm optimization. Knowl Based Syst 163:14\u201325","journal-title":"Knowl Based Syst"},{"key":"541_CR44","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ins.2018.04.062","volume":"454","author":"H Yu","year":"2018","unstructured":"Yu H, Tan Y, Zeng J, Sun C, Jin Y (2018) Surrogate-assisted hierarchical particle swarm optimization. Inf Sci 454:59\u201372","journal-title":"Inf Sci"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00541-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00541-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00541-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:13:46Z","timestamp":1725876826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00541-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,5]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["541"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00541-4","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,5]]},"assertion":[{"value":"12 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}