{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:55:59Z","timestamp":1761897359681,"version":"3.37.3"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T00:00:00Z","timestamp":1596758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T00:00:00Z","timestamp":1596758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation for Distinguished Young Scholars of China","award":["51825502"],"award-info":[{"award-number":["51825502"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s00521-020-05258-y","type":"journal-article","created":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T04:10:57Z","timestamp":1596773457000},"page":"4387-4416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A comparative study of pre-screening strategies within a surrogate-assisted multi-objective algorithm framework for computationally expensive problems"],"prefix":"10.1007","volume":"33","author":[{"given":"Fan","family":"Li","sequence":"first","affiliation":[]},{"given":"Liang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Akhil","family":"Garg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5204-7992","authenticated-orcid":false,"given":"Weiming","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Shifeng","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,7]]},"reference":[{"issue":"S2","key":"5258_CR1","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s00521-017-3049-x","volume":"31","author":"MA Tawhid","year":"2017","unstructured":"Tawhid MA, Savsani V (2017) Multi-objective sine-cosine algorithm (MO-SCA) for multi-objective engineering design problems. Neural Comput Appl 31(S2):915\u2013929. https:\/\/doi.org\/10.1007\/s00521-017-3049-x","journal-title":"Neural Comput Appl"},{"issue":"S1","key":"5258_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00521-017-3009-5","volume":"31","author":"S Surender Reddy","year":"2017","unstructured":"Surender Reddy S, Bijwe PR (2017) Differential evolution-based efficient multi-objective optimal power flow. Neural Comput Appl 31(S1):509\u2013522. https:\/\/doi.org\/10.1007\/s00521-017-3009-5","journal-title":"Neural Comput Appl"},{"issue":"2","key":"5258_CR3","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s00521-015-2073-y","volume":"28","author":"Y-x Su","year":"2015","unstructured":"Su Y-x, Chi R (2015) Multi-objective particle swarm-differential evolution algorithm. Neural Comput Appl 28(2):407\u2013418. https:\/\/doi.org\/10.1007\/s00521-015-2073-y","journal-title":"Neural Comput Appl"},{"issue":"8","key":"5258_CR4","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1007\/s00521-011-0588-4","volume":"21","author":"M Basseur","year":"2011","unstructured":"Basseur M, Zeng R-Q, Hao J-K (2011) Hypervolume-based multi-objective local search. Neural Comput Appl 21(8):1917\u20131929. https:\/\/doi.org\/10.1007\/s00521-011-0588-4","journal-title":"Neural Comput Appl"},{"issue":"1","key":"5258_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evolut Comput 1(1):32\u201349. https:\/\/doi.org\/10.1016\/j.swevo.2011.03.001","journal-title":"Swarm Evolut Comput"},{"issue":"2","key":"5258_CR6","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(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"5258_CR7","doi-asserted-by":"publisher","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103. https:\/\/doi.org\/10.3929\/ethz-a-004284029","DOI":"10.3929\/ethz-a-004284029"},{"issue":"6","key":"5258_CR8","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/Tevc.2007.892759","volume":"11","author":"QF Zhang","year":"2007","unstructured":"Zhang QF, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/Tevc.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"5258_CR9","doi-asserted-by":"crossref","unstructured":"Zitzler E, Kunzli S (2004) Indicator-based selection in multiobjective search. Paper presented at the International Conference on Parallel Problem Solving from Nature, Birmingham, United Kingdom","DOI":"10.1007\/978-3-540-30217-9_84"},{"issue":"1\u20132","key":"5258_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/mcda.1605","volume":"24","author":"R Allmendinger","year":"2017","unstructured":"Allmendinger R, Emmerich MTM, Hakanen J, Jin Y, Rigoni E (2017) Surrogate-assisted multicriteria optimization: complexities, prospective solutions, and business case. J Multi-Criteria Decis Anal 24(1\u20132):5\u201324. https:\/\/doi.org\/10.1002\/mcda.1605","journal-title":"J Multi-Criteria Decis Anal"},{"key":"5258_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.jhydrol.2012.10.050","volume":"479","author":"G Kourakos","year":"2013","unstructured":"Kourakos G, Mantoglou A (2013) Development of a multi-objective optimization algorithm using surrogate models for coastal aquifer management. J Hydrol 479:13\u201323. https:\/\/doi.org\/10.1016\/j.jhydrol.2012.10.050","journal-title":"J Hydrol"},{"issue":"4","key":"5258_CR12","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. https:\/\/doi.org\/10.1023\/A:1008306431147","journal-title":"J Global Optim"},{"key":"5258_CR13","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cma.2018.06.032","volume":"341","author":"JH Zhang","year":"2018","unstructured":"Zhang JH, Xiao M, Gao L, Fu JJ (2018) A novel projection outline based active learning method and its combination with Kriging metamodel for hybrid reliability analysis with random and interval variables. Comput Methods Appl Mech Eng 341:32\u201352. https:\/\/doi.org\/10.1016\/j.cma.2018.06.032","journal-title":"Comput Methods Appl Mech Eng"},{"key":"5258_CR14","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.apm.2018.06.036","volume":"63","author":"J Zhang","year":"2018","unstructured":"Zhang J, Xiao M, Gao L, Pan Q (2018) Queuing search algorithm: a novel metaheuristic algorithm for solving engineering optimization problems. Appl Math Model 63:464\u2013490. https:\/\/doi.org\/10.1016\/j.apm.2018.06.036","journal-title":"Appl Math Model"},{"issue":"8","key":"5258_CR15","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. https:\/\/doi.org\/10.1029\/JB076i008p01905","journal-title":"J Geophys Res"},{"key":"5258_CR16","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ins.2013.01.024","volume":"233","author":"S-C Horng","year":"2013","unstructured":"Horng S-C, Lin S-Y (2013) Evolutionary algorithm assisted by surrogate model in the framework of ordinal optimization and optimal computing budget allocation. Inf Sci 233:214\u2013229. https:\/\/doi.org\/10.1016\/j.ins.2013.01.024","journal-title":"Inf Sci"},{"key":"5258_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04149-1","author":"A Liu","year":"2019","unstructured":"Liu A, Li P, Sun W, Deng X, Li W, Zhao Y, Liu B (2019) Prediction of mechanical properties of micro-alloyed steels via neural networks learned by water wave optimization. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-019-04149-1","journal-title":"Neural Comput Appl"},{"issue":"1","key":"5258_CR18","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00521-015-2046-1","volume":"28","author":"N Yadav","year":"2015","unstructured":"Yadav N, Yadav A, Kumar M, Kim JH (2015) An efficient algorithm based on artificial neural networks and particle swarm optimization for solution of nonlinear Troesch\u2019s problem. Neural Comput Appl 28(1):171\u2013178. https:\/\/doi.org\/10.1007\/s00521-015-2046-1","journal-title":"Neural Comput Appl"},{"issue":"5","key":"5258_CR19","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00158-008-0290-z","volume":"38","author":"T Goel","year":"2008","unstructured":"Goel T, Hafkta RT, Shyy W (2008) Comparing error estimation measures for polynomial and kriging approximation of noise-free functions. Struct Multidiscip Optim 38(5):429\u2013442. https:\/\/doi.org\/10.1007\/s00158-008-0290-z","journal-title":"Struct Multidiscip Optim"},{"issue":"6","key":"5258_CR20","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1115\/1.1897403","volume":"127","author":"SM Clarke","year":"2005","unstructured":"Clarke SM, Griebsch JH, Simpson TW (2005) Analysis of support vector regression for approximation of complex engineering analyses. J Mech Des 127(6):1077\u20131087. https:\/\/doi.org\/10.1115\/1.1897403","journal-title":"J Mech Des"},{"issue":"7\u20138","key":"5258_CR21","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1007\/s00521-013-1418-7","volume":"24","author":"J Zhou","year":"2013","unstructured":"Zhou J, Duan B, Huang J, Cao H (2013) Data-driven modeling and optimization for cavity filters using linear programming support vector regression. Neural Comput Appl 24(7\u20138):1771\u20131783. https:\/\/doi.org\/10.1007\/s00521-013-1418-7","journal-title":"Neural Comput Appl"},{"issue":"1","key":"5258_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00521-013-1509-5","volume":"24","author":"A Ciccazzo","year":"2013","unstructured":"Ciccazzo A, Pillo GD, Latorre V (2013) Support vector machines for surrogate modeling of electronic circuits. Neural Comput Appl 24(1):69\u201376. https:\/\/doi.org\/10.1007\/s00521-013-1509-5","journal-title":"Neural Comput Appl"},{"issue":"3","key":"5258_CR23","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s00158-006-0051-9","volume":"33","author":"T Goel","year":"2006","unstructured":"Goel T, Haftka RT, Shyy W, Queipo NV (2006) Ensemble of surrogates. Struct Multidiscip Optim 33(3):199\u2013216. https:\/\/doi.org\/10.1007\/s00158-006-0051-9","journal-title":"Struct Multidiscip Optim"},{"issue":"2","key":"5258_CR24","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 Evolut Comput 1(2):61\u201370. https:\/\/doi.org\/10.1016\/j.swevo.2011.05.001","journal-title":"Swarm Evolut Comput"},{"key":"5258_CR25","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2020.2967553","author":"F Li","year":"2020","unstructured":"Li F, Cai X, Gao L, Shen W (2020) A surrogate-assisted multiswarm optimization algorithm for high-dimensional computationally expensive problems. IEEE Trans Cybernet. https:\/\/doi.org\/10.1109\/tcyb.2020.2967553","journal-title":"IEEE Trans Cybernet"},{"key":"5258_CR26","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":"5258_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106303","author":"F Li","year":"2020","unstructured":"Li F, Shen WM, Cai XW, Gao L, Wang GG (2020) A fast surrogate-assisted particle swarm optimization algorithm for computationally expensive problems. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2020.106303","journal-title":"Appl Soft Comput"},{"issue":"1","key":"5258_CR28","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/Tevc.2005.851274","volume":"10","author":"J Knowles","year":"2006","unstructured":"Knowles J (2006) ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Trans Evol Comput 10(1):50\u201366. https:\/\/doi.org\/10.1109\/Tevc.2005.851274","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"5258_CR29","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/Tcyb.2018.2811761","volume":"49","author":"JP Luo","year":"2019","unstructured":"Luo JP, Gupta A, Ong YS, Wang ZK (2019) Evolutionary optimization of expensive multiobjective problems with co-sub-pareto front gaussian process surrogates. IEEE Trans Cybernet 49(5):1708\u20131721. https:\/\/doi.org\/10.1109\/Tcyb.2018.2811761","journal-title":"IEEE Trans Cybernet"},{"issue":"3","key":"5258_CR30","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/Tevc.2009.2033671","volume":"14","author":"QF Zhang","year":"2010","unstructured":"Zhang QF, Liu WD, Tsang E, Virginas B (2010) Expensive multiobjective optimization by MOEA\/D with Gaussian process model. IEEE Trans Evol Comput 14(3):456\u2013474. https:\/\/doi.org\/10.1109\/Tevc.2009.2033671","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"5258_CR31","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/TEVC.2019.2899030","volume":"23","author":"A Habib","year":"2019","unstructured":"Habib A, Singh HK, Chugh T, Ray T, Miettinen K (2019) A multiple surrogate assisted decomposition based evolutionary algorithm for expensive multi\/many-objective optimization. IEEE Trans Evol Comput 23(6):1000\u20131014. https:\/\/doi.org\/10.1109\/TEVC.2019.2899030","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"5258_CR32","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/Tevc.2016.2622301","volume":"22","author":"T Chugh","year":"2018","unstructured":"Chugh T, Jin YC, Miettinen K, Hakanen J, Sindhya K (2018) A surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive many-objective optimization. IEEE Trans Evol Comput 22(1):129\u2013142. https:\/\/doi.org\/10.1109\/Tevc.2016.2622301","journal-title":"IEEE Trans Evol Comput"},{"key":"5258_CR33","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/978-3-540-87700-4_78","volume":"5199","author":"W Ponweiser","year":"2008","unstructured":"Ponweiser W, Wagner T, Biermann D, Vincze M (2008) Multiobjective optimization on a limited budget of evaluations using model-assisted S-metric selection. Lect Notes Comput Sc 5199:784\u2013794. https:\/\/doi.org\/10.1007\/978-3-540-87700-4_78","journal-title":"Lect Notes Comput Sc"},{"issue":"1","key":"5258_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00158-015-1226-z","volume":"52","author":"M Tabatabaei","year":"2015","unstructured":"Tabatabaei M, Hakanen J, Hartikainen M, Miettinen K, Sindhya K (2015) A survey on handling computationally expensive multiobjective optimization problems using surrogates: non-nature inspired methods. Struct Multidiscip Optim 52(1):1\u201325. https:\/\/doi.org\/10.1007\/s00158-015-1226-z","journal-title":"Struct Multidiscip Optim"},{"issue":"9","key":"5258_CR35","doi-asserted-by":"publisher","first-page":"3137","DOI":"10.1007\/s00500-017-2965-0","volume":"23","author":"T Chugh","year":"2019","unstructured":"Chugh T, Sindhya K, Hakanen J, Miettinen K (2019) A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms. Soft Comput 23(9):3137\u20133166. https:\/\/doi.org\/10.1007\/s00500-017-2965-0","journal-title":"Soft Comput"},{"key":"5258_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/9420460","volume":"2016","author":"A Diaz-Manriquez","year":"2016","unstructured":"Diaz-Manriquez A, Toscano G, Barron-Zambrano JH, Tello-Leal E (2016) A review of surrogate assisted multiobjective evolutionary algorithms. Comput Intell Neurosci 2016:1\u201314. https:\/\/doi.org\/10.1155\/2016\/9420460","journal-title":"Comput Intell Neurosci"},{"issue":"4","key":"5258_CR37","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s40747-018-0080-1","volume":"4","author":"R Cheng","year":"2018","unstructured":"Cheng R, He C, Jin Y, Yao X (2018) Model-based evolutionary algorithms: a short survey. Complex Intell Syst 4(4):283\u2013292. https:\/\/doi.org\/10.1007\/s40747-018-0080-1","journal-title":"Complex Intell Syst"},{"key":"5258_CR38","doi-asserted-by":"crossref","unstructured":"Berveglieri N, Derbel B, Liefooghe A, Aguirre H, Tanaka K (2019) Surrogate-assisted multiobjective optimization based on decomposition. Paper presented at the Genetic and Evolutionary Computation Conference 2019, Prague, Czech Republic","DOI":"10.1145\/3321707.3321836"},{"key":"5258_CR39","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.asoc.2016.02.021","volume":"43","author":"J Wang","year":"2016","unstructured":"Wang J, Ersoy OK, He M, Wang F (2016) Multi-offspring genetic algorithm and its application to the traveling salesman problem. Appl Soft Comput 43:415\u2013423. https:\/\/doi.org\/10.1016\/j.asoc.2016.02.021","journal-title":"Appl Soft Comput"},{"key":"5258_CR40","doi-asserted-by":"publisher","unstructured":"Syberfeldt A, Grimm H, Ng A, John RI (2008) A parallel surrogate-assisted multi-objective evolutionary algorithm for computationally expensive optimization problems. In: 2008 IEEE congress on evolutionary computation (IEEE world congress on computational intelligence). IEEE, pp 3177\u20133184. https:\/\/doi.org\/10.1109\/cec.2008.4631228","DOI":"10.1109\/cec.2008.4631228"},{"key":"5258_CR41","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.eswa.2016.03.044","volume":"57","author":"R Datta","year":"2016","unstructured":"Datta R, Regis RG (2016) A surrogate-assisted evolution strategy for constrained multi-objective optimization. Expert Syst Appl 57:270\u2013284. https:\/\/doi.org\/10.1016\/j.eswa.2016.03.044","journal-title":"Expert Syst Appl"},{"issue":"1","key":"5258_CR42","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(1):12\u201323. https:\/\/doi.org\/10.1016\/j.jocs.2013.07.004","journal-title":"J Comput Sci"},{"key":"5258_CR43","doi-asserted-by":"crossref","unstructured":"Regis RG (2018) Surrogate-assisted particle swarm with local search for expensive constrained optimization. Paper presented at the international conference on bioinspired methods and their applications, Paris, France","DOI":"10.1007\/978-3-319-91641-5_21"},{"key":"5258_CR44","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.jocs.2016.05.013","volume":"16","author":"RG Regis","year":"2016","unstructured":"Regis RG (2016) Multi-objective constrained black-box optimization using radial basis function surrogates. J Comput Sci 16:140\u2013155. https:\/\/doi.org\/10.1016\/j.jocs.2016.05.013","journal-title":"J Comput Sci"},{"issue":"1\u20133","key":"5258_CR45","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.paerosci.2008.11.001","volume":"45","author":"AIJ Forrester","year":"2009","unstructured":"Forrester AIJ, Keane AJ (2009) Recent advances in surrogate-based optimization. Prog Aerosp Sci 45(1\u20133):50\u201379. https:\/\/doi.org\/10.1016\/j.paerosci.2008.11.001","journal-title":"Prog Aerosp Sci"},{"key":"5258_CR46","unstructured":"Jeong S, Obayashi S. Efficient global optimization (EGO) for multi-objective problem and data mining. Paper presented at the 2005 IEEE congress on evolutionary computation, Edinburgh, Scotland, UK"},{"issue":"6","key":"5258_CR47","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1109\/Tevc.2017.2697503","volume":"21","author":"DW Zhan","year":"2017","unstructured":"Zhan DW, Cheng YS, Liu J (2017) Expected improvement matrix-based infill criteria for expensive multiobjective optimization. IEEE Trans Evol Comput 21(6):956\u2013975. https:\/\/doi.org\/10.1109\/Tevc.2017.2697503","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"5258_CR48","doi-asserted-by":"publisher","first-page":"879","DOI":"10.2514\/1.16875","volume":"44","author":"AJ Keane","year":"2006","unstructured":"Keane AJ (2006) Statistical improvement criteria for use in multiobjective design optimization. AIAA J 44(4):879\u2013891. https:\/\/doi.org\/10.2514\/1.16875","journal-title":"AIAA J"},{"key":"5258_CR49","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.csda.2015.08.011","volume":"94","author":"J Svenson","year":"2016","unstructured":"Svenson J, Santner T (2016) Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models. Comput Stat Data Anal 94:250\u2013264. https:\/\/doi.org\/10.1016\/j.csda.2015.08.011","journal-title":"Comput Stat Data Anal"},{"issue":"4","key":"5258_CR50","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1109\/Tevc.2005.859463","volume":"10","author":"MTM Emmerich","year":"2006","unstructured":"Emmerich MTM, Giannakoglou KC, Naujoks B (2006) Single-objective and multiobjective evolutionary optimization assisted by Gaussian random field metamodels. IEEE Trans Evol Comput 10(4):421\u2013439. https:\/\/doi.org\/10.1109\/Tevc.2005.859463","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"5258_CR51","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10898-013-0118-2","volume":"60","author":"I Couckuyt","year":"2013","unstructured":"Couckuyt I, Deschrijver D, Dhaene T (2013) Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization. J Global Optim 60(3):575\u2013594. https:\/\/doi.org\/10.1007\/s10898-013-0118-2","journal-title":"J Global Optim"},{"key":"5258_CR52","doi-asserted-by":"crossref","unstructured":"Hupkens I , Andr\u00e9 Deutz, Yang K , et al. Faster exact algorithms for computing expected hypervolume improvement. Paper presented at the international conference on evolutionary multi-criterion optimization 2015, Guimar\u00e3es, Portugal","DOI":"10.1007\/978-3-319-15892-1_5"},{"issue":"4","key":"5258_CR53","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","unstructured":"Deb K, Jain H (2013) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577\u2013601. https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"5258_CR54","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1080\/0305215x.2012.687731","volume":"45","author":"RG Regis","year":"2013","unstructured":"Regis RG, Shoemaker CA (2013) Combining radial basis function surrogates and dynamic coordinate search in high-dimensional expensive black-box optimization. Eng Optim 45(5):529\u2013555. https:\/\/doi.org\/10.1080\/0305215x.2012.687731","journal-title":"Eng Optim"},{"issue":"3","key":"5258_CR55","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) Multi-objective infill criterion driven gaussian process assisted particle swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 23(3):459\u2013472. https:\/\/doi.org\/10.1109\/TEVC.2018.2869247","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"5258_CR56","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(2):180\u2013192. https:\/\/doi.org\/10.1109\/tevc.2013.2248012","journal-title":"IEEE Trans Evol Comput"},{"issue":"9","key":"5258_CR57","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 Cybernet 47(9):2664\u20132677. https:\/\/doi.org\/10.1109\/TCYB.2017.2710978","journal-title":"IEEE Trans Cybernet"},{"issue":"3","key":"5258_CR58","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/tevc.2009.2027359","volume":"14","author":"D Lim","year":"2010","unstructured":"Lim D, Yaochu J, Yew-Soon O, Sendhoff B (2010) Generalizing surrogate-assisted evolutionary computation. IEEE Trans Evol Comput 14(3):329\u2013355. https:\/\/doi.org\/10.1109\/tevc.2009.2027359","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"5258_CR59","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1162\/evco.1999.7.3.205","volume":"7","author":"K Deb","year":"1999","unstructured":"Deb K (1999) Multi-objective genetic algorithms: problem difficulties and construction of test problems. Evol Comput 7(3):205\u2013230. https:\/\/doi.org\/10.1162\/evco.1999.7.3.205","journal-title":"Evol Comput"},{"key":"5258_CR60","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2002) Scalable multi-objective optimization test problems. Paper presented at the Proceedings of the 2002 congress on evolutionary computation. CEC\u201902 (Cat. No. 02TH8600), Honolulu, HI, USA"},{"issue":"1","key":"5258_CR61","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyz\u017cak","year":"1998","unstructured":"Czyz\u017cak P, Jaszkiewicz A (1998) Pareto simulated annealing\u2014a metaheuristic technique for multiple-objective combinatorial optimization. J Multi-Criteria Decis Anal 7(1):34\u201347. https:\/\/doi.org\/10.1002\/(SICI)1099-1360(199801)7:1%3c34:AID-MCDA161%3e3.0.CO;2-6","journal-title":"J Multi-Criteria Decis Anal"},{"key":"5258_CR62","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.asoc.2019.03.049","volume":"80","author":"Z Chen","year":"2019","unstructured":"Chen Z, Zhou Y, He X (2019) Handling expensive multi-objective optimization problems with a cluster-based neighborhood regression model. Appl Soft Comput 80:211\u2013225. https:\/\/doi.org\/10.1016\/j.asoc.2019.03.049","journal-title":"Appl Soft Comput"},{"issue":"4","key":"5258_CR63","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"T Ye","year":"2017","unstructured":"Ye T, Ran C, Zhang X, Jin Y (2017) PlatEMO: a MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Mag 12(4):73\u201387. https:\/\/doi.org\/10.1109\/MCI.2017.2742868","journal-title":"IEEE Comput Intell Mag"},{"key":"5258_CR64","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s40747-019-00126-2","volume":"6","author":"C He","year":"2019","unstructured":"He C, Tian Y, Wang H, Jin Y (2019) A repository of real-world datasets for data-driven evolutionary multiobjective optimization. Complex Intell Syst 6:189\u2013197. https:\/\/doi.org\/10.1007\/s40747-019-00126-2","journal-title":"Complex Intell Syst"},{"issue":"6","key":"5258_CR65","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1109\/TEVC.2017.2697503","volume":"21","author":"D Zhan","year":"2017","unstructured":"Zhan D, Cheng Y, Liu J (2017) Expected improvement matrix-based infill criteria for expensive multiobjective optimization. IEEE Trans Evol Comput 21(6):956\u2013975","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05258-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05258-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05258-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T23:36:37Z","timestamp":1628292997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05258-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,7]]},"references-count":65,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["5258"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05258-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2020,8,7]]},"assertion":[{"value":"17 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}