{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T22:21:36Z","timestamp":1787437296048,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032362223","type":"print"},{"value":"9783032362230","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-36223-0_20","type":"book-chapter","created":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:45:07Z","timestamp":1787435107000},"page":"315-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pooling with\u00a0Optimal Hypervolume Subset Selection for\u00a0Bi-objective Evolutionary Optimization"],"prefix":"10.1007","author":[{"given":"Melika","family":"Zabihi Neyshaburi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dirk V.","family":"Arnold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,23]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 563\u2013570 (2009). https:\/\/doi.org\/10.1145\/1569901.1569980","DOI":"10.1145\/1569901.1569980"},{"issue":"3","key":"20_CR2","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). https:\/\/doi.org\/10.1016\/j.ejor.2006.08.008","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Bringmann, K., Cabello, S., Emmerich, M.T.M.: Maximum volume subset selection for anchored boxes. In: 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics, vol.\u00a077, pp. 22:1\u201322:15. Schloss Dagstuhl \u2014 Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.22","DOI":"10.4230\/LIPIcs.SoCG.2017.22"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Bringmann, K., Friedrich, T., Klitzke, P.: Two-dimensional subset selection for hypervolume and epsilon-indicator. In: Proceedings of the 16th Annual Conference on Genetic and Evolutionary Computation, pp. 589\u2013596 (2014). https:\/\/doi.org\/10.1145\/2576768.2598276","DOI":"10.1145\/2576768.2598276"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Brockhoff, D., Tran, T.D., Hansen, N.: Benchmarking numerical multiobjective optimizers revisited. In: Proceedings of the 17th Annual Conference on Genetic and Evolutionary Computation, pp. 639\u2013646 (2015). https:\/\/doi.org\/10.1145\/2739480.2754777","DOI":"10.1145\/2739480.2754777"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1162\/EVCO_a_00135","volume":"23","author":"D Brockhoff","year":"2015","unstructured":"Brockhoff, D., Wagner, T., Trautmann, H.: R2 indicator-based multiobjective search. Evol. Comput. 23(3), 369\u2013395 (2015). https:\/\/doi.org\/10.1162\/EVCO_a_00135","journal-title":"Evol. Comput."},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Emmerich, M.T.M., Deutz, A.H.: A tutorial on multiobjective optimization: fundamentals and evolutionary methods. Natural Comput. 17, 585\u2013609 (2018). https:\/\/doi.org\/10.1007\/s11047-018-9685-y","DOI":"10.1007\/s11047-018-9685-y"},{"issue":"3","key":"20_CR9","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). https:\/\/doi.org\/10.1162\/EVCO_a_00188","journal-title":"Evol. Comput."},{"key":"20_CR10","unstructured":"Hansen, M.P., Jaszkiewicz, A.: Evaluating the quality of approximations of the nondominated set. Tech. Rep. IMM Technical Report IMM-REP-1998-7, Technical University of Denmark (1998)"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Hansen, N.: The CMA evolution stratagy: A tutorial. arxiv:1604.00772 (2023). https:\/\/doi.org\/10.48550\/arXiv.1604.00772","DOI":"10.48550\/arXiv.1604.00772"},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/TEVC.2022.3210897","volume":"26","author":"N Hansen","year":"2022","unstructured":"Hansen, N., Auger, A., Brockhoff, D., Tu\u0161ar, T.: Anytime performance assessment in blackbox optimization benchmarking. IEEE Trans. Evol. Comput. 26(6), 1293\u20131305 (2022). https:\/\/doi.org\/10.1109\/TEVC.2022.3210897","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1080\/10556788.2020.1808977","volume":"36","author":"N Hansen","year":"2021","unstructured":"Hansen, N., Auger, A., Ros, R., Mersmann, O., Tu\u0161ar, T., Brockhoff, D.: COCO: A platform for comparing continuous optimizers in a black-box setting. Optim. Methods Softw. 36(1), 114\u2013144 (2021). https:\/\/doi.org\/10.1080\/10556788.2020.1808977","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen, N., M\u00fcller, S.D., Koumoutsakos, P.: Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol. Comput. 11(1), 1\u201318 (2003). https:\/\/doi.org\/10.1162\/106365603321828970","journal-title":"Evol. Comput."},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159\u2013195 (2001). https:\/\/doi.org\/10.1162\/106365601750190398","journal-title":"Evol. Comput."},{"issue":"5","key":"20_CR16","doi-asserted-by":"publisher","first-page":"2186","DOI":"10.1109\/TCYB.2018.2885974","volume":"50","author":"VAS Hern\u00e1ndez","year":"2018","unstructured":"Hern\u00e1ndez, V.A.S., Sch\u00fctze, O., Wang, H., Deutz, A., Emmerich, M.T.M.: The set-based hypervolume newton method for bi-objective optimization. IEEE Trans. Cybern. 50(5), 2186\u20132196 (2018). https:\/\/doi.org\/10.1109\/TCYB.2018.2885974","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.2007.15.1.1","volume":"15","author":"C Igel","year":"2007","unstructured":"Igel, C., Hansen, N., Roth, S.: Covariance matrix adaptation for multi-objective optimization. Evol. Comput. 15(1), 1\u201328 (2007). https:\/\/doi.org\/10.1162\/evco.2007.15.1.1","journal-title":"Evol. Comput."},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Igel, C., Suttorp, T., Hansen, N.: Steady-state selection and efficient covariance matrix update in the multi-objective CMA-ES. In: Obayashi, S., et\u00a0al. (eds.) EMO 2007: Evolutionary Multi-Criterion Optimization, pp. 171\u2013185. Springer, Cham (2007). https:\/\/doi.org\/10.1007\/978-3-540-7","DOI":"10.1007\/978-3-540-7"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Ishibuchi, H., Masuda, H., Nojima, Y.: Comparing solution sets of different size in evolutionary many-objective optimization. In: IEEE Congress on Evolutionary Computation, pp. 2859\u20132866 (2015). https:\/\/doi.org\/10.1109\/CEC.2015.7257244","DOI":"10.1109\/CEC.2015.7257244"},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Kenny, A., Ray, T., Singh, H.K.: Multi-objective L-shaped test functions. In: Proceedings of the 27th Annual Conference on Genetic and Evolutionary Computation, pp. 22\u201329 (2025). https:\/\/doi.org\/10.1145\/3712256.3726323","DOI":"10.1145\/3712256.3726323"},{"issue":"2","key":"20_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles, J.D., Corne, D.W.: Approximating the nondominated front using the Pareto archived evolution strategy. Evol. Comput. 8(2), 149\u2013172 (2000). https:\/\/doi.org\/10.1162\/106365600568167","journal-title":"Evol. Comput."},{"key":"20_CR22","unstructured":"Krause, O., Glasmachers, T., Hansen, N., Igel, C.: Multi-objective optimization with unbounded solution sets. In: NIPS Workshop on Bayesian Optimization (2016)"},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Krause, O., Glasmachers, T., Hansen, N., Igel, C.: Unbounded population MO-CMA-ES for the bi-objective BBOB test suite. In: Proceedings of the 2016 Genetic and Evolutionary Computation Conference Companion, pp. 1177\u20131184 (2016). https:\/\/doi.org\/10.1145\/2908961.2931699","DOI":"10.1145\/2908961.2931699"},{"issue":"3","key":"20_CR24","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1162\/EVCO_a_00157","volume":"24","author":"T Kuhn","year":"2016","unstructured":"Kuhn, T., Fonseca, C.M., Paquete, L., Ruzika, S., Duarte, M.M., Figueira, J.R.: Hypervolume subset selection in two dimensions: Formulations and algorithms. Evol. Comput. 24(3), 411\u2013425 (2016). https:\/\/doi.org\/10.1162\/EVCO_a_00157","journal-title":"Evol. Comput."},{"issue":"2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li, H., Zhang, Q.: Multiobjective optimization problems with complicated Pareto sets, MOEA\/D and NSGA-II. IEEE Trans. Evol. Comput. 13(2), 284\u2013302 (2009). https:\/\/doi.org\/10.1109\/TEVC.2008.925798","journal-title":"IEEE Trans. Evol. Comput."},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Loshchilov, I., Glasmachers, T.: Anytime bi-objective optimization with a hybrid multi-objective CMA-ES (HMO-CMA-ES). In: Proceedings of the 2016 Genetic and Evolutionary Computation Conference Companion, pp. 1169\u20131176 (2016). https:\/\/doi.org\/10.1145\/2908961.2931698","DOI":"10.1145\/2908961.2931698"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/BFb0056868","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"GT Parks","year":"1998","unstructured":"Parks, G.T., Miller, I.: Selective breeding in a multiobjective genetic algorithm. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 250\u2013259. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056868"},{"key":"20_CR28","doi-asserted-by":"publisher","unstructured":"Shang, K., Ishibuchi, H., Chen, W.: Greedy approximated hypervolume subset selection for many-objective optimization. In: Proceedings of the 23rd Annual Conference on Genetic and Evolutionary Computation, pp. 448\u2013456 (2021). https:\/\/doi.org\/10.1145\/3449639.3459390","DOI":"10.1145\/3449639.3459390"},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Tour\u00e9, C., Hansen, N., Auger, A., Brockhoff, D.: Uncrowded hypervolume improvement: COMO-CMA-ES and the Sofomore framework. In: Proceedings of the 21st Annual Conference on Genetic and Evolutionary Computation, pp. 638\u2013646 (2019). https:\/\/doi.org\/10.1145\/3321707.3321852","DOI":"10.1145\/3321707.3321852"},{"key":"20_CR30","unstructured":"Tour\u00e9, C.S.: Design of multiobjective optimization algorithms and theoretical analysis of evolution strategies, Ph.D. thesis. Institut Polytechnique de Paris (2021)"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-01020-0_16","volume-title":"Evolutionary Multi-Criterion Optimization","author":"T Vo\u00df","year":"2009","unstructured":"Vo\u00df, T., Hansen, N., Igel, C.: Recombination for Learning Strategy Parameters in the MO-CMA-ES. In: Ehrgott, M., Fonseca, C.M., Gandibleux, X., Hao, J.-K., Sevaux, M. (eds.) EMO 2009. LNCS, vol. 5467, pp. 155\u2013168. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01020-0_16"},{"key":"20_CR32","doi-asserted-by":"publisher","unstructured":"Vo\u00df, T., Hansen, N., Igel, C.: Improved step size adaptation for the MO-CMA-ES. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 487\u2013494 (2010). https:\/\/doi.org\/10.1145\/1830483.1830573","DOI":"10.1145\/1830483.1830573"},{"issue":"6","key":"20_CR33","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007). https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans. Evol. Comput."},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-540-30217-9_84","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"E Zitzler","year":"2004","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-Based Selection in Multiobjective Search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"E Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms \u2014 A comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 292\u2013301. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056872"},{"key":"20_CR36","doi-asserted-by":"publisher","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Foneseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2014-132 (2003). https:\/\/doi.org\/10.1109\/TEVC.2003.810758","DOI":"10.1109\/TEVC.2003.810758"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-36223-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:45:08Z","timestamp":1787435108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-36223-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,23]]},"ISBN":["9783032362223","9783032362230"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-36223-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,23]]},"assertion":[{"value":"23 August 2026","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":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}