{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T14:55:54Z","timestamp":1784904954851,"version":"3.55.0"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Hong Kong General Research Fund","award":["CityU-11208121"],"award-info":[{"award-number":["CityU-11208121"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276223"],"award-info":[{"award-number":["62276223"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Basic Research Foundation of Shenzhen","award":["JCYJ20220818100005011"],"award-info":[{"award-number":["JCYJ20220818100005011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tevc.2023.3265347","type":"journal-article","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T17:35:08Z","timestamp":1680802508000},"page":"432-444","source":"Crossref","is-referenced-by-count":33,"title":["Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3735-936X","authenticated-orcid":false,"given":"Liang","family":"Zhao","sequence":"first","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0786-0671","authenticated-orcid":false,"given":"Qingfu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-016-1546-7"},{"key":"ref2","first-page":"3306","article-title":"Batch Bayesian optimization via multi-objective acquisition ensemble for automated analog circuit design","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lyu"},{"key":"ref3","first-page":"2960","article-title":"Practical Bayesian optimization of machine learning algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"25","author":"Snoek"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-38527-2_55"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00923-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851274"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.859463"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033671"},{"key":"ref11","article-title":"Bayesian optimization for multi-objective optimization and multi-point search","author":"Wada","year":"2019","journal-title":"arXiv:1905.02370"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-019-00798-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref15","article-title":"A batched scalable multi-objective Bayesian optimization algorithm","author":"Lin","year":"2018","journal-title":"arXiv:1811.01323"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2895108"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205543"},{"key":"ref18","first-page":"11096","article-title":"Random hypervolume scalarizations for provable multi-objective black box optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2704118"},{"key":"ref20","article-title":"Budgeted multi-objective optimization with a focus on the central part of the Pareto front\u2013extended version","author":"Gaudrie","year":"2018","journal-title":"arXiv:1809.10482"},{"key":"ref21","first-page":"17708","article-title":"Diversity-guided multi-objective Bayesian optimization with batch evaluations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Konakovic-Lukovic"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2811761"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2693320"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2514\/1.16875"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2015.08.011"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2697503"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67988-4_12"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321784"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7744343"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-019-09644-8"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104869"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29975-4_12"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54157-0_46"},{"key":"ref34","article-title":"Fast exact computation of expected hypervolume improvement","author":"Zhao","year":"2018","journal-title":"arXiv:1812.07692"},{"key":"ref35","first-page":"9851","article-title":"Differentiable expected hypervolume improvement for parallel multi-objective Bayesian optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Daulton"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10701-6_6"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-018-2006-3"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61723-X_1022"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2009.4982991"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70928-2_64"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-13709-0_45"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2608507"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2978158"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2403849"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/s1052623496307510"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3377929.3398082"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139177801.004"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.3.205"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007032"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106078"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-9445(1989)115:3(626)"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1080\/03052159908941390"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-005-0527-z"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1080\/03052150210915"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.2514\/6.2003-296"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15892-1_8"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1115\/detc2003\/dac-48760"},{"key":"ref60","volume-title":"DACE: A MATLAB Kriging Toolbox","volume":"2","author":"Lophaven","year":"2002"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.925798"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2017.2742868"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/cec.2019.8789986"},{"key":"ref64","first-page":"19231","article-title":"Pareto set learning for expensive multi-objective optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Lin"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2802784"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/10488007\/10093980.pdf?arnumber=10093980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T05:15:52Z","timestamp":1712034952000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10093980\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":65,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2023.3265347","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":[[2024,4]]}}}