{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T16:49:29Z","timestamp":1791046169209,"version":"4.1.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Science and Technology Innovation Committee Foundation of Shenzhen","award":["ZDSYS201703031748284"],"award-info":[{"award-number":["ZDSYS201703031748284"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/tevc.2017.2776226","type":"journal-article","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T14:15:11Z","timestamp":1520864111000},"page":"961-975","source":"Crossref","is-referenced-by-count":142,"title":["Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-6472","authenticated-orcid":false,"given":"Hisao","family":"Ishibuchi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryo","family":"Imada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Setoguchi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4853-1305","authenticated-orcid":false,"given":"Yusuke","family":"Nojima","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7743898"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1145\/2739480.2754792","article-title":"A study on performance evaluation ability of a modified inverted generational distance indicator","author":"ishibuchi","year":"2015","journal-title":"Proc Genet Evol Comput Conf"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7256994"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281525"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463451"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2077298"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15892-1_8"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810761"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6"},{"key":"ref34","first-page":"243","article-title":"Improving and extending the HV4D algorithm for calculating hypervolume exactly","author":"cox","year":"2016","journal-title":"Proc Australasian Joint Conf Artif Intell"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1145\/2739480.2754687","article-title":"A performance comparison indicator for Pareto front approximations in many-objective optimization","author":"li","year":"2015","journal-title":"Proc Genet Evol Comput Conf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1007\/978-3-540-24694-7_71","article-title":"A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm","author":"coello","year":"2004","journal-title":"MICAI 2004 Advances in Artificial Intelligence"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0056872","article-title":"Multiobjective optimization using evolutionary algorithms&#x2014;A comparative case study","author":"zitzler","year":"1998","journal-title":"Parallel Problem Solving from Nature-PPSN V"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2334632"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2433266"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.04.025"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007013"},{"key":"ref23","article-title":"Benchmark functions for the CEC 2017 competition on evolutionary many-objective optimization","author":"cheng","year":"2017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2161872"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3040718.3040730"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071264"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7748352"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281534"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2373386"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2420112"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496307510"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810752"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MCDM.2014.7007204"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2339823"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2307319"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2240687"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2587749"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2505784"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527138"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70928-2_64"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.05.019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.03.012"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref48","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7743917"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/1-84628-137-7_6"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2315442"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.861417"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/8552518\/08314455.pdf?arnumber=8314455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T21:34:28Z","timestamp":1643232868000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8314455\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":49,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2017.2776226","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,12]]}}}