{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T05:09:11Z","timestamp":1748668151655,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147203"},{"type":"electronic","value":"9783031147210"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_8","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"110-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Direction Vector Selection for\u00a0R2-Based Hypervolume Contribution Approximation"],"prefix":"10.1007","author":[{"given":"Tianye","family":"Shu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Nan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisao","family":"Ishibuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653\u20131669 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bradstreet, L., Barone, L., While, L.: Maximising hypervolume for selection in multi-objective evolutionary algorithms. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 1744\u20131751 (2006)","DOI":"10.1109\/CEC.2007.4424881"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bradstreet, L., While, L., Barone, L.: Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 3203\u20133210 (2007)","DOI":"10.1109\/CEC.2007.4424881"},{"issue":"6","key":"8_CR4","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.comgeo.2010.03.004","volume":"43","author":"K Bringmann","year":"2010","unstructured":"Bringmann, K., Friedrich, T.: Approximating the volume of unions and intersections of high-dimensional geometric objects. Comput. Geom. Theor. Appl. 43(6), 601\u2013610 (2010)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/978-3-540-24694-7_71","volume-title":"MICAI 2004: Advances in Artificial Intelligence","author":"CA Coello Coello","year":"2004","unstructured":"Coello Coello, C.A., Reyes Sierra, M.: A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds.) MICAI 2004. LNCS (LNAI), vol. 2972, pp. 688\u2013697. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24694-7_71"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das, I., Dennis, J.E.: Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8(3), 631\u2013657 (1998)","journal-title":"SIAM J. Optim."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-030-12598-1_15","volume-title":"Evolutionary Multi-Criterion Optimization","author":"K Deb","year":"2019","unstructured":"Deb, K., Bandaru, S., Seada, H.: Generating uniformly distributed points on a unit simplex for evolutionary many-objective optimization. In: Deb, K., et al. (eds.) EMO 2019. LNCS, vol. 11411, pp. 179\u2013190. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12598-1_15"},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Evolutionary Multiobjective Optimization","author":"K Deb","year":"2005","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) EMO 2005, pp. 105\u2013145. Springer, London (2005). https:\/\/doi.org\/10.1007\/1-84628-137-7_6"},{"issue":"5","key":"8_CR10","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/TEVC.2019.2895108","volume":"23","author":"J Deng","year":"2019","unstructured":"Deng, J., Zhang, Q.: Approximating hypervolume and hypervolume contributions using polar coordinate. IEEE Trans. Evol. Comput. 23(5), 913\u2013918 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-31880-4_5","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M Emmerich","year":"2005","unstructured":"Emmerich, M., Beume, N., Naujoks, B.: An EMO algorithm using the hypervolume measure as selection criterion. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 62\u201376. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_5"},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1162\/EVCO_a_00188","volume":"24","author":"AP Guerreiro","year":"2016","unstructured":"Guerreiro, A.P., Fonseca, C.M., Paquete, L.: Greedy hypervolume subset selection in low dimensions. Evol. Comput. 24(3), 521\u2013544 (2016)","journal-title":"Evol. Comput."},{"key":"8_CR13","unstructured":"Hansen, M.P., Jaszkiewicz, A.: Evaluating the quality of approximations to the non-dominated set. IMM Technical report, Institute of Mathematical Modelling, Technical University of Denmark (1998)"},{"issue":"5","key":"8_CR14","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"8_CR15","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TEVC.2017.2776226","volume":"22","author":"H Ishibuchi","year":"2018","unstructured":"Ishibuchi, H., Imada, R., Setoguchi, Y., Nojima, Y.: Reference point specification in inverted generational distance for triangular linear Pareto front. IEEE Trans. Evol. Comput. 22(6), 961\u2013975 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TEVC.2016.2587749","volume":"21","author":"H Ishibuchi","year":"2017","unstructured":"Ishibuchi, H., Setoguchi, Y., Masuda, H., Nojima, Y.: Performance of decomposition-based many-objective algorithms strongly depends on Pareto front shapes. IEEE Trans. Evol. Comput. 21(2), 169\u2013190 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A.: On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem - a comparative experiment. IEEE Trans. Evol. Comput. 6(4), 402\u2013412 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"10","key":"8_CR18","doi-asserted-by":"publisher","first-page":"2202","DOI":"10.1109\/TCYB.2014.2367526","volume":"45","author":"S Jiang","year":"2015","unstructured":"Jiang, S., Zhang, J., Ong, Y.S., Zhang, A.N., Tan, P.S.: A simple and fast hypervolume indicator-based multiobjective evolutionary algorithm. IEEE Trans. Cybern. 45(10), 2202\u20132213 (2015)","journal-title":"IEEE Trans. Cybern."},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Kumar, R., Vassilvitskii, S.: Generalized distances between rankings. In: Proceedings of the 19th International Conference on World Wide Web, pp. 571\u2013580 (2010)","DOI":"10.1145\/1772690.1772749"},{"key":"8_CR20","unstructured":"MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297 (1967)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Nan, Y., Shang, K., Ishibuchi, H.: What is a good direction vector set for the R2-based hypervolume contribution approximation. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 524\u2013532 (2020)","DOI":"10.1145\/3377930.3390171"},{"issue":"4","key":"8_CR22","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2019.2929555","volume":"24","author":"C Qian","year":"2020","unstructured":"Qian, C.: Distributed Pareto optimization for large-scale noisy subset selection. IEEE Trans. Evol. Comput. 24(4), 694\u2013707 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"8_CR23","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/TEVC.2020.2964705","volume":"24","author":"K Shang","year":"2020","unstructured":"Shang, K., Ishibuchi, H.: A new hypervolume-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 24(5), 839\u2013852 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Shang, K., Ishibuchi, H., Chen, W.: Greedy approximated hypervolume subset selection for many-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 448\u2013456 (2021)","DOI":"10.1145\/3449639.3459390"},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2021","unstructured":"Shang, K., Ishibuchi, H., He, L., Pang, L.M.: A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 25(1), 1\u201320 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TEVC.2019.2909271","volume":"24","author":"K Shang","year":"2020","unstructured":"Shang, K., Ishibuchi, H., Ni, X.: R2-based hypervolume contribution approximation. IEEE Trans. Evol. Comput. 24(1), 185\u2013192 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Shang, K., Shu, T., Ishibuchi, H., Nan, Y., Pang, L.M.: Benchmarking subset selection from large candidate solution sets in evolutionary multi-objective optimization. arXiv preprint arXiv:2201.06700 (2022)","DOI":"10.1016\/j.ins.2022.11.155"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen, D.A.: Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Ph.D. Dissertation, Air Force Institute of Technology (1999)","DOI":"10.1145\/298151.298382"},{"issue":"1","key":"8_CR29","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TEVC.2010.2077298","volume":"16","author":"L While","year":"2012","unstructured":"While, L., Bradstreet, L., Barone, L.: A fast way of calculating exact hypervolumes. IEEE Trans. Evol. Comput. 16(1), 86\u201395 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1007\/978-3-540-70928-2_64","volume-title":"Evolutionary Multi-Criterion Optimization","author":"E Zitzler","year":"2007","unstructured":"Zitzler, E., Brockhoff, D., Thiele, L.: The hypervolume indicator revisited: on the design of pareto-compliant indicators via weighted integration. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 862\u2013876. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70928-2_64"},{"issue":"2","key":"8_CR31","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:48:01Z","timestamp":1710262081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}