{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,22]],"date-time":"2026-10-22T17:52:10Z","timestamp":1792691530040,"version":"4.5.0"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003406","name":"Tekes","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003406","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/tevc.2016.2622301","type":"journal-article","created":{"date-parts":[[2016,10,27]],"date-time":"2016-10-27T14:14:37Z","timestamp":1477577677000},"page":"129-142","source":"Crossref","is-referenced-by-count":599,"title":["A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5123-8148","authenticated-orcid":false,"given":"Tinkle","family":"Chugh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1100-0631","authenticated-orcid":false,"given":"Yaochu","family":"Jin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1013-4689","authenticated-orcid":false,"given":"Kaisa","family":"Miettinen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jussi","family":"Hakanen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karthik","family":"Sindhya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/HIS.2011.6122165"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2011.5949753"},{"key":"ref33","author":"miettinen","year":"1999","journal-title":"Nonlinear Multiobjective Optimization"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.2000.10485979"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17298-4_24"},{"key":"ref30","article-title":"DACE: A MATLAB Kriging toolbox","author":"lophaven","year":"2002"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICGEC.2012.90"},{"key":"ref35","first-page":"289","article-title":"Approximate optimization using computational intelligence and its application to reinforcement of cable-stayed bridges","author":"nakayama","year":"2006","journal-title":"Proc Integr Intell Syst Eng Design"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/10426914.2013.872271"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851274"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_71"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2792984"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598271"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(94)00014-5"},{"key":"ref20","first-page":"282","article-title":"Gaussian processes for big data","author":"hensman","year":"2013","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/321062.321069"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.05.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GEFS.2008.4484566"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.800884"},{"key":"ref25","first-page":"786","article-title":"On evolutionary optimization with approximate fitness functions","author":"jin","year":"2000","journal-title":"Proc Genet Evol Comput Conf"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033671"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2378512"},{"key":"ref10","author":"coello","year":"2007","journal-title":"Evolutionary Algorithms for Solving Multi-Objective Problems"},{"key":"ref11","author":"cornell","year":"2011","journal-title":"Experiments with Mixtures Designs Models and the Analysis of Mixture Data"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.06.043"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0118-2"},{"key":"ref13","author":"deb","year":"2001","journal-title":"Multi-Objective Optimization Using Evolutionary Algorithms"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007032"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32964-7_11"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.859463"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32494-1_4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2334632"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810761"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900299"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2424921"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2519378"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2395073"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2443001"},{"key":"ref9","article-title":"Handling computationally expensive multiobjective optimization problems with evolutionary algorithms: A survey","author":"chugh","year":"2015"},{"key":"ref46","article-title":"Planning and multi-objective optimization of manufacturing processes by means of empirical surrogate models","author":"wagner","year":"2013"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9644-1"},{"key":"ref48","first-page":"1861","article-title":"Evolutionary many-objective optimization using dynamic \n$\\epsilon$\n-Hoods and Chebyshev function","author":"yazawa","year":"2015","journal-title":"Proc IEEE Congr Evol Comput"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15844-5_72"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900368"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87700-4_78"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10701-6_2"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/8272041\/07723883.pdf?arnumber=7723883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:39Z","timestamp":1641987699000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7723883\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":52,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2016.2622301","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":[[2018,2]]}}}