{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T16:46:57Z","timestamp":1777135617234,"version":"3.51.4"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"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":"crossref","award":["Grant No. 51774228"],"award-info":[{"award-number":["Grant No. 51774228"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant No. 51864046"],"award-info":[{"award-number":["Grant No. 51864046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shaanxi province fund for Distinguished Young Scholars","award":["Grant No. 2020JC-44"],"award-info":[{"award-number":["Grant No. 2020JC-44"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["Grant No. 2019M662505"],"award-info":[{"award-number":["Grant No. 2019M662505"]}],"id":[{"id":"10.13039\/501100002858","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,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Surrogate-assisted optimization has attracted much attention due to its superiority in solving expensive optimization problems. However, relatively little work has been dedicated to addressing expensive constrained multi-objective discrete optimization problems although there are many such problems in the real world. Hence, a surrogate-assisted evolutionary algorithm is proposed in this paper for this kind of problem. Specifically, random forest models are embedded in the framework of the evolutionary algorithm as surrogates to improve approximate accuracy for discrete optimization problems. To enhance the optimization efficiency, an improved stochastic ranking strategy based on the fitness mechanism and adaptive probability operator is presented, which also takes into account both convergence and diversity to advance the quality of candidate solutions. To validate the proposed algorithm, it is comprehensively compared with several well-known optimization algorithms on several benchmark problems. Numerical experiments are demonstrated that the proposed algorithm is very promising for the expensive constrained multi-objective discrete optimization problems.<\/jats:p>","DOI":"10.1007\/s40747-020-00249-x","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T16:24:23Z","timestamp":1609777463000},"page":"2699-2718","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["Surrogate-assisted evolutionary algorithm for expensive constrained multi-objective discrete optimization problems"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4927-0653","authenticated-orcid":false,"given":"Qinghua","family":"Gu","sequence":"first","affiliation":[]},{"given":"Qian","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Neal N.","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Song","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"249_CR1","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1287\/mnsc.1050.0413","volume":"51","author":"S Sayin","year":"2005","unstructured":"Sayin S, Kouvelis P (2005) The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm. Manage Sci 51:1572\u20131581","journal-title":"Manage Sci"},{"key":"249_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s40747-019-0113-4","volume":"6","author":"CA Coello Coello","year":"2020","unstructured":"Coello Coello CA, Gonz\u00e1lez Brambila S, Figueroa Gamboa J, Castillo Tapia MG, Hern\u00e1ndez G\u00f3mez R (2020) Evolutionary multiobjective optimization: open research areas and some challenges lying ahead. Complex Intell Syst 6:221\u2013236","journal-title":"Complex Intell Syst"},{"key":"249_CR3","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ejor.2019.12.029","volume":"286","author":"T Setzer","year":"2020","unstructured":"Setzer T, Blanc SM (2020) Empirical orthogonal constraint generation for multidimensional 0\/1 knapsack problems. Eur J Oper Res 286:791\u2013795","journal-title":"Eur J Oper Res"},{"key":"249_CR4","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TPWRS.2019.2944541","volume":"35","author":"S Lilla","year":"2020","unstructured":"Lilla S, Orozco C, Borghetti A, Napolitano F, Tossani F (2020) Day-ahead scheduling of a local energy community: an alternating direction method of multipliers approach. IEEE Trans Power Syst 35:1132\u20131142","journal-title":"IEEE Trans Power Syst"},{"key":"249_CR5","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1109\/TCYB.2018.2821180","volume":"49","author":"J Wang","year":"2019","unstructured":"Wang J, Weng T, Zhang Q (2019) A two-stage multiobjective evolutionary algorithm for multiobjective multidepot vehicle routing problem with time windows. IEEE Trans Cybern 49:2467\u20132478","journal-title":"IEEE Trans Cybern"},{"key":"249_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.omega.2017.05.006","volume":"77","author":"B Mota","year":"2018","unstructured":"Mota B, Gomes MI, Carvalho A, Barbosa-Povoa AP (2018) Sustainable supply chains: an integrated modeling approach under uncertainty. Omega-Int J Manag Sci 77:32\u201357","journal-title":"Omega-Int J Manag Sci"},{"key":"249_CR7","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.ejor.2018.04.051","volume":"271","author":"SM Hosseininasab","year":"2018","unstructured":"Hosseininasab SM, Shetab-Boushehri SN, Hejazi SR, Karimi H (2018) A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects. Eur J Oper Res 271:262\u2013277","journal-title":"Eur J Oper Res"},{"key":"249_CR8","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1016\/j.asoc.2018.07.014","volume":"71","author":"H Bederina","year":"2018","unstructured":"Bederina H, Hifi M (2018) A hybrid multi-objective evolutionary optimization approach for the robust vehicle routing problem. Appl Soft Comput 71:980\u2013993","journal-title":"Appl Soft Comput"},{"key":"249_CR9","doi-asserted-by":"publisher","first-page":"26194","DOI":"10.1109\/ACCESS.2018.2832181","volume":"6","author":"K Li","year":"2018","unstructured":"Li K, Wang R, Zhang T, Ishibuchi H (2018) Evolutionary many-objective optimization: a comparative study of the state-of-the-art. IEEE Access 6:26194\u201326214","journal-title":"IEEE Access"},{"key":"249_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.ress.2017.12.019","volume":"172","author":"MA Ardakan","year":"2018","unstructured":"Ardakan MA, Rezvan MT (2018) Multi-objective optimization of reliability-redundancy allocation problem with cold-standby strategy using NSGA-II. Reliab Eng Syst Saf 172:225\u2013238","journal-title":"Reliab Eng Syst Saf"},{"key":"249_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2018\/3051854","volume":"2018","author":"J Xiao","year":"2018","unstructured":"Xiao J, Li J-J, Hong X-X, Huang M-M, Hu X-M, Tang Y, Huang C-Q (2018) An improved MOEA\/D based on reference distance for software project portfolio optimization. Complexity 2018:1\u201317","journal-title":"Complexity"},{"key":"249_CR12","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.swevo.2019.06.001","volume":"49","author":"R Tanabe","year":"2019","unstructured":"Tanabe R, Ishibuchi H (2019) A niching indicator-based multi-modal many-objective optimizer. Swarm Evol Comput 49:134\u2013146","journal-title":"Swarm Evol Comput"},{"key":"249_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2017.10.041","volume":"428","author":"X-N Shen","year":"2018","unstructured":"Shen X-N, Minku LL, Marturi N, Guo Y-N, Han Y (2018) A Q-learning-based memetic algorithm for multi-objective dynamic software project scheduling. Inf Sci 428:1\u201329","journal-title":"Inf Sci"},{"key":"249_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.simpat.2013.12.013","volume":"42","author":"M Ardakan","year":"2014","unstructured":"Ardakan M, Zeinal Hamadani A (2014) Reliability\u2013redundancy allocation problem with cold-standby redundancy strategy. Simul Modell Pract Theory 42:107\u2013118","journal-title":"Simul Modell Pract Theory"},{"key":"249_CR15","doi-asserted-by":"publisher","first-page":"2154","DOI":"10.3390\/su9112154","volume":"9","author":"F He","year":"2017","unstructured":"He F, Shen K, Guan L, Jiang M (2017) Research on energy-saving scheduling of a forging stock charging furnace based on an improved SPEA2 algorithm. Sustainability 9:2154","journal-title":"Sustainability"},{"key":"249_CR16","doi-asserted-by":"publisher","first-page":"2252","DOI":"10.1109\/TAP.2019.2891661","volume":"67","author":"CE Hu","year":"2019","unstructured":"Hu CE, Zeng SY, Jiang YH, Sun JQ, Sun YZ, Gao S (2019) A robust technique without additional computational cost in evolutionary antenna optimization. IEEE Trans Antennas Propag 67:2252\u20132259","journal-title":"IEEE Trans Antennas Propag"},{"key":"249_CR17","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1080\/10426914.2016.1269923","volume":"32","author":"T Chugh","year":"2017","unstructured":"Chugh T, Chakraborti N, Sindhya K, Jin Y (2017) A data-driven surrogate-assisted evolutionary algorithm applied to a many-objective blast furnace optimization problem. Mater Manuf Processes 32:1172\u20131178","journal-title":"Mater Manuf Processes"},{"key":"249_CR18","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/TEVC.2016.2555315","volume":"20","author":"H Wang","year":"2016","unstructured":"Wang H, Jin Y, Jansen JO (2016) Data-driven surrogate-assisted multiobjective evolutionary optimization of a trauma system. IEEE Trans Evol Comput 20:939\u2013952","journal-title":"IEEE Trans Evol Comput"},{"key":"249_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.neucom.2016.10.022","volume":"237","author":"NN Islam","year":"2017","unstructured":"Islam NN, Hannan MA, Shareef H, Mohamed A (2017) An application of backtracking search algorithm in designing power system stabilizers for large multi-machine system. Neurocomputing 237:175\u2013184","journal-title":"Neurocomputing"},{"key":"249_CR20","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:61\u201370","journal-title":"Swarm Evol Comput"},{"key":"249_CR21","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:283\u2013292","journal-title":"Complex Intell Syst"},{"key":"249_CR22","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, Guo D, Miettinen K (2019) Data-driven evolutionary optimization: an overview and case studies. IEEE Trans Evol Comput 23:442\u2013458","journal-title":"IEEE Trans Evol Comput"},{"key":"249_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s40747-019-00126-2","volume":"6","author":"C He","year":"2020","unstructured":"He C, Tian Y, Wang H, Jin Y (2020) A repository of real-world datasets for data-driven evolutionary multiobjective optimization. Complex Intell Syst 6:189\u2013197","journal-title":"Complex Intell Syst"},{"key":"249_CR24","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00158-017-1658-8","volume":"56","author":"F Ye","year":"2017","unstructured":"Ye F, Wang H, Li G (2017) Variable stiffness composite material design by using support vector regression assisted efficient global optimization method. Struct Multidiscip Optim 56:203\u2013219","journal-title":"Struct Multidiscip Optim"},{"key":"249_CR25","doi-asserted-by":"crossref","unstructured":"Bajer L, Hole\u0148a M (2010) Surrogate model for continuous and discrete genetic optimization based on RBF networks. In: Paper presented at the Proceedings of the 11th international conference on intelligent data engineering and automated learning, Paisley, UK","DOI":"10.1007\/978-3-642-15381-5_31"},{"key":"249_CR26","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-35843-2_41","volume-title":"SOFSEM 2013: theory and practice of computer science","author":"L Bajer","year":"2013","unstructured":"Bajer L, Hole\u0148a M (2013) Surrogate model for mixed-variables evolutionary optimization based on GLM and RBF networks. SOFSEM 2013: theory and practice of computer science. Springer, Berlin, pp 481\u2013490"},{"key":"249_CR27","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TEVC.2018.2834881","volume":"23","author":"H Wang","year":"2019","unstructured":"Wang H, Jin Y, Sun C, Doherty J (2019) Offline data-driven evolutionary optimization using selective surrogate ensembles. IEEE Trans Evol Comput 23:203\u2013216","journal-title":"IEEE Trans Evol Comput"},{"key":"249_CR28","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/s10898-013-0101-y","volume":"59","author":"J M\u00fcller","year":"2014","unstructured":"M\u00fcller J, Shoemaker CA, Pich\u00e9 R (2014) SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications. J Global Optim 59:865\u2013889","journal-title":"J Global Optim"},{"key":"249_CR29","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10898-007-9256-8","volume":"41","author":"K Holmstr\u00f6m","year":"2008","unstructured":"Holmstr\u00f6m K (2008) An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization. J Global Optim 41:447\u2013464","journal-title":"J Global Optim"},{"key":"249_CR30","doi-asserted-by":"crossref","unstructured":"Haibo Y, Yin T, Chaoli S, Jianchao Z, Jin Y (2016) An adaptive model selection strategy for surrogate-assisted particle swarm optimization algorithm. Paper presented at the 2016 IEEE symposium series on computational intelligence (SSCI), Athens, Greece, pp 1-8","DOI":"10.1109\/SSCI.2016.7850208"},{"key":"249_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10898-007-9217-2","volume":"43","author":"E Davis","year":"2009","unstructured":"Davis E, Ierapetritou M (2009) A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions. J Global Optim 43:191\u2013205","journal-title":"J Global Optim"},{"key":"249_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 Y, 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:129\u2013142","journal-title":"IEEE Trans Evol Comput"},{"key":"249_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-04280-0_21","volume":"539","author":"L Swiler","year":"2014","unstructured":"Swiler L, Hough P, Qian P, Xu X, Storlie C, Lee H (2014) Surrogate models for mixed discrete-continuous variables. Stud Comput Intell 539:181\u2013202","journal-title":"Stud Comput Intell"},{"key":"249_CR34","doi-asserted-by":"publisher","first-page":"2951","DOI":"10.1109\/TCYB.2016.2562674","volume":"47","author":"S Nguyen","year":"2017","unstructured":"Nguyen S, Zhang MJ, Tan KC (2017) Surrogate-assisted genetic programming with simplified models for automated design of dispatching rules. IEEE Trans Cybern 47:2951\u20132965","journal-title":"IEEE Trans Cybern"},{"key":"249_CR35","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.knosys.2015.09.032","volume":"90","author":"DJ Wang","year":"2015","unstructured":"Wang DJ, Liu F, Wang YZ, Jin YC (2015) A knowledge-based evolutionary proactive scheduling approach in the presence of machine breakdown and deterioration effect. Knowl Based Syst 90:70\u201380","journal-title":"Knowl Based Syst"},{"key":"249_CR36","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ssci.2017.12.013","volume":"103","author":"D Rodriguez-Roman","year":"2018","unstructured":"Rodriguez-Roman D (2018) A surrogate-assisted genetic algorithm for the selection and design of highway safety and travel time improvement projects. Saf Sci 103:305\u2013315","journal-title":"Saf Sci"},{"key":"249_CR37","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jconhyd.2018.11.005","volume":"220","author":"JY Guo","year":"2019","unstructured":"Guo JY, Lu WX, Yang QC, Miao TS (2019) The application of 0\u20131 mixed integer nonlinear programming optimization model based on a surrogate model to identify the groundwater pollution source. J Contam Hydrol 220:18\u201325","journal-title":"J Contam Hydrol"},{"key":"249_CR38","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1109\/TCYB.2018.2869674","volume":"50","author":"H Wang","year":"2020","unstructured":"Wang H, Jin Y (2020) A random forest-assisted evolutionary algorithm for data-driven constrained multiobjective combinatorial optimization of trauma systems. IEEE Trans Cybern 50:536\u2013549","journal-title":"IEEE Trans Cybern"},{"key":"249_CR39","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45:5\u201332","journal-title":"Mach Learn"},{"key":"249_CR40","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1109\/TNNLS.2016.2635676","volume":"29","author":"S Qin","year":"2018","unstructured":"Qin S, Feng J, Song J, Wen X, Xu C (2018) A one-layer recurrent neural network for constrained complex-variable convex optimization. IEEE Trans Neural Netw Learn Syst 29:534\u2013544","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"249_CR41","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4:284\u2013294","journal-title":"IEEE Trans Evol Comput"},{"key":"249_CR42","doi-asserted-by":"crossref","unstructured":"Fan Z, Hui L, Wei C, Li W, Cai Z (2016) An improved epsi-lon constraint handling method embedded in MOEA\/D for con-strained multi-objective optimization problems. In: Paper pre-sented at the computational intelligence (SSCI), Athens, Greece, pp 1-8","DOI":"10.1109\/SSCI.2016.7850224"},{"key":"249_CR43","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186:311\u2013338","journal-title":"Comput Methods Appl Mech Eng"},{"key":"249_CR44","first-page":"1","volume":"7","author":"U Balande","year":"2019","unstructured":"Balande U, Shrimankar D (2019) SRIFA: stochastic ranking with improved-firefly-algorithm for constrained optimization engineering design problems. Math 7:1\u201326","journal-title":"Math"},{"key":"249_CR45","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1504\/IJBIC.2012.047238","volume":"4","author":"L Ali","year":"2012","unstructured":"Ali L, Sabat SL, Udgata SK (2012) Particle swarm optimisation with stochastic ranking for constrained numerical and engineering benchmark problems. Int J Bio-Inspir Comput 4:155\u2013166","journal-title":"Int J Bio-Inspir Comput"},{"key":"249_CR46","doi-asserted-by":"publisher","first-page":"23010","DOI":"10.1109\/ACCESS.2017.2764883","volume":"5","author":"H Cervantes-Culebro","year":"2017","unstructured":"Cervantes-Culebro H, Cruz-Villar CA, Martinez Penaloza M-G, Mezura-Montes E (2017) Constraint-handling techniques for the concurrent design of a five-bar parallel robot. IEEE Access 5:23010\u201323021","journal-title":"IEEE Access"},{"key":"249_CR47","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s40747-017-0057-5","volume":"3","author":"Y Tian","year":"2017","unstructured":"Tian Y, Wang H, Zhang X, Jin Y (2017) Effectiveness and efficiency of non-dominated sorting for evolutionary multi- and many-objective optimization. Complex Intell Syst 3:247\u2013263","journal-title":"Complex Intell Syst"},{"key":"249_CR48","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Springer, New York"},{"key":"249_CR49","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.asoc.2017.01.039","volume":"55","author":"T Bartz-Beielstein","year":"2017","unstructured":"Bartz-Beielstein T, Zaefferer M (2017) Model-based methods for continuous and discrete global optimization. Appl Soft Comput 55:154\u2013167","journal-title":"Appl Soft Comput"},{"key":"249_CR50","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1080\/0305215X.2011.637556","volume":"44","author":"JM Parr","year":"2012","unstructured":"Parr JM, Keane AJ, Forrester AIJ, Holden CME (2012) Infill sampling criteria for surrogate-based optimization with constraint handling. Eng Optim 44:1147\u20131166","journal-title":"Eng Optim"},{"key":"249_CR51","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1002\/sim.680","volume":"20","author":"L Barker","year":"2001","unstructured":"Barker L, Brown C (2001) Logistic regression when binary predictor variables are highly correlated. Stat Med 20:1431\u20131442","journal-title":"Stat Med"},{"key":"249_CR52","first-page":"18","volume":"23","author":"A Liaw","year":"2001","unstructured":"Liaw A, Wiener M (2001) Classification and regression by random forest. R News 23:18\u201322","journal-title":"R News"},{"key":"249_CR53","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. TIK-Report 103"},{"key":"249_CR54","unstructured":"Jin Y, Olhofer M, Sendhoff B (2000) On evolutionary optimization with approximate fitness functions. In: Paper presented at the proceedings of the genetic and evolutionary computation conference, Morgan Kaufmann, San Mateo, CA, USAm pp 786\u2013793"},{"key":"249_CR55","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","journal-title":"IEEE Trans Evol Comput"},{"key":"249_CR56","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"QF Zhang","year":"2007","unstructured":"Zhang QF, Hui L (2007) MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11:712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"249_CR57","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","volume":"232","author":"G Kirlik","year":"2014","unstructured":"Kirlik G, Say\u0131n S (2014) A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur J Oper Res 232:479\u2013488","journal-title":"Eur J Oper Res"},{"key":"249_CR58","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3:257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"249_CR59","unstructured":"Zhou A, Jin Y, Zhang Q, Sendhoff B, Tsang E (2006) Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion. Paper presented at the 2006 IEEE congress on evolutionary computation, BC, Canada, pp 3234\u20133241"},{"key":"249_CR60","volume-title":"Evolutionary algorithms for solving multi-objective problems. Genetic and evolutionary computation","author":"CAC Coello","year":"2007","unstructured":"Coello CAC, Veldhuizen DAV, Lamont GB (2007) Evolutionary algorithms for solving multi-objective problems. Genetic and evolutionary computation. Springer, New York"},{"key":"249_CR61","unstructured":"Van D, Gary V, Lamont B (1999) Multiobjective evolutionary algorithm research: a history and analysis. Evol Comput 8:1-88"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-020-00249-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-020-00249-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-020-00249-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T11:33:39Z","timestamp":1674819219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-020-00249-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1007\/s40747-020-00249-x","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,4]]},"assertion":[{"value":"27 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2021","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 there are no conflicts of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}