{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T14:55:53Z","timestamp":1784904953835,"version":"3.55.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106207"],"award-info":[{"award-number":["62106207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1109\/tevc.2022.3168060","type":"journal-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T20:19:08Z","timestamp":1650313148000},"page":"170-184","source":"Crossref","is-referenced-by-count":16,"title":["A Fast Multipoint Expected Improvement for Parallel Expensive Optimization"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0173-3447","authenticated-orcid":false,"given":"Dawei","family":"Zhan","sequence":"first","affiliation":[{"name":"School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yun","family":"Meng","sequence":"additional","affiliation":[{"name":"School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6345-7265","authenticated-orcid":false,"given":"Huanlai","family":"Xing","sequence":"additional","affiliation":[{"name":"School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3066606"},{"key":"ref35","article-title":"Computer experiments and global optimization","author":"schonlau","year":"1997"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2675628"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00923-x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v051.i01"},{"key":"ref14","first-page":"129","article-title":"Machine learning into metaheuristics: A survey and taxonomy","volume":"54","author":"talbi","year":"2021","journal-title":"ACM Comput Surveys"},{"key":"ref36","first-page":"59","author":"chevalier","year":"2013","journal-title":"Fast computation of the multi-points expected improvement with applications in batch selection"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0210-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-012-9892-5"},{"key":"ref11","article-title":"A three-level radial basis function method for expensive optimization","author":"li","year":"2021","journal-title":"IEEE Trans Cybern"},{"key":"ref33","first-page":"131","volume":"2","author":"ginsbourger","year":"2010","journal-title":"Kriging Is Well-Suited to Parallelize Optimization"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2248012"},{"key":"ref32","first-page":"648","article-title":"Batch Bayesian optimization via local penalization","author":"gonz\u00e1lez","year":"2016","journal-title":"Proc Artif Intell Stat"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2710978"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2013.827672"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.859463"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1966"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177012413"},{"key":"ref38","first-page":"37","author":"marmin","year":"2015","journal-title":"Differentiating the multipoint Expected Improvement for optimal batch design hal-01133220v3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2514\/1.16875"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851274"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2011.637556"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-016-0484-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/03052150211751"},{"key":"ref45","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"deb","year":"1995","journal-title":"Complex Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-011-0745-5"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-016-1441-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033671"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2868770"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/9780470770801"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2697503"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.1992.10477010"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0118-2"},{"key":"ref43","article-title":"Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective real-parameter numerical optimization","author":"awad","year":"2017"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-005-0587-0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.2514\/1.20068"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-016-1432-3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2869001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.05.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790310"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2939518"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3060833"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2924461"},{"key":"ref40","author":"rasmussen","year":"2006","journal-title":"Gaussian Processes for Machine Learning"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/10032250\/09758830.pdf?arnumber=9758830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T23:07:57Z","timestamp":1676934477000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9758830\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":47,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2022.3168060","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]}}}