{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T01:30:29Z","timestamp":1789695029116,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Key R&D Program of China","award":["2023YFE0106300"],"award-info":[{"award-number":["2023YFE0106300"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62250710163"],"award-info":[{"award-number":["62250710163"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62376115"],"award-info":[{"award-number":["62376115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100013261","name":"Guangdong Provincial Key Laboratory","doi-asserted-by":"publisher","award":["2020B121201001"],"award-info":[{"award-number":["2020B121201001"]}],"id":[{"id":"10.13039\/100013261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654053","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"585-593","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Gradient-Guided Local Search for IGD\/IGDPlus Subset Selection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8396-294X","authenticated-orcid":false,"given":"Yang","family":"Nan","sequence":"first","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-6472","authenticated-orcid":false,"given":"Hisao","family":"Ishibuchi","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7673-3943","authenticated-orcid":false,"given":"Tianye","family":"Shu","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2363-9504","authenticated-orcid":false,"given":"Ke","family":"Shang","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908949"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810761"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424881"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185734"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC52423.2021.9658582"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3103386"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496307510"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Hisao Ishibuchi Hiroyuki Masuda Yuki Tanigaki and Yusuke Nojima. 2015. Modified distance calculation in generational distance and inverted generational distance. In Evol. Multi-Criter. Optim. Guimar\u00e3es Portugal 110--125.","DOI":"10.1007\/978-3-319-15892-1_8"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. Eur. Conf. Artif. Intell. Santiago de Compostela, Spain, 283--290","author":"Ishibuchi Hisao","year":"2020","unstructured":"Hisao Ishibuchi, Lie Meng Pang, and Ke Shang. 2020. A new framework of evolutionary multi-objective algorithms with an unbounded external archive. In Proc. Eur. Conf. Artif. Intell. Santiago de Compostela, Spain, 283--290."},{"key":"e_1_3_2_1_10_1","first-page":"10","article-title":"A simple and fast hypervolume indicator-based multiobjective evolutionary algorithm","volume":"45","author":"Jiang Siwei","year":"2015","unstructured":"Siwei Jiang, Jie Zhang, Yew-Soon Ong, Allan N. Zhang, and Puay Siew Tan. 2015. A simple and fast hypervolume indicator-based multiobjective evolutionary algorithm. IEEE Trans. Evol. Comput. 45, 10 (Oct. 2015), 2202--2213.","journal-title":"IEEE Trans. Evol. Comput."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC52423.2021.9659147"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3219081"},{"key":"e_1_3_2_1_13_1","volume-title":"Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Program. 87 (May","author":"Say\u0131n Serpil","year":"2000","unstructured":"Serpil Say\u0131n. 2000. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Program. 87 (May 2000), 543--560."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459391"},{"key":"e_1_3_2_1_15_1","volume-title":"Benchmarking large-scale subset selection in evolutionary multi-objective optimization. Infor. Sci. 622 (Apr","author":"Shang Ke","year":"2023","unstructured":"Ke Shang, Tianye Shu, Hisao Ishibuchi, Yang Nan, and Lie Meng Pang. 2023. Benchmarking large-scale subset selection in evolutionary multi-objective optimization. Infor. Sci. 622 (Apr. 2023), 755--770."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2883094"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. Int. Conf. Learn. Intell. Optim","author":"Ulrich Tamara","year":"2012","unstructured":"Tamara Ulrich and Lothar Thiele. 2012. Bounding the effectiveness of hypervolume-based (+)-archiving algorithms. In Proc. Int. Conf. Learn. Intell. Optim. Paris, France, 235--249."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"}],"event":{"name":"GECCO '24: Genetic and Evolutionary Computation Conference","location":"Melbourne VIC Australia","acronym":"GECCO '24","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654053","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:50Z","timestamp":1750291010000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":18,"alternative-id":["10.1145\/3638529.3654053","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654053","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}