{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:11:41Z","timestamp":1743145901492,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819635054"},{"type":"electronic","value":"9789819635061"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-3506-1_16","type":"book-chapter","created":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T12:49:18Z","timestamp":1740746958000},"page":"226-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extended Results on\u00a0Analytical Hypervolume Indicator Calculation of\u00a0Linear and\u00a0Quadratic Pareto Fronts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1653-232X","authenticated-orcid":false,"given":"Hemant Kumar","family":"Singh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-031-25263-1_5","volume-title":"Many-Criteria Optimization and Decision Analysis: State-of-the-Art, Present Challenges, and Future Perspectives","author":"B Afsar","year":"2023","unstructured":"Afsar, B., Fieldsend, J.E., Guerreiro, A.P., Miettinen, K., Rojas Gonzalez, S., Sato, H.: Many-objective quality measures. In: Brockhoff, D., Emmerich, M., Naujoks, B., Purshouse, R. (eds.) Many-Criteria Optimization and Decision Analysis: State-of-the-Art, Present Challenges, and Future Perspectives, pp. 113\u2013148. Springer International Publishing, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-25263-1_5"},{"issue":"8","key":"16_CR2","doi-asserted-by":"publisher","first-page":"2321","DOI":"10.1109\/TCYB.2017.2737519","volume":"48","author":"M Asafuddoula","year":"2018","unstructured":"Asafuddoula, M., Singh, H.K., Ray, T.: An enhanced decomposition-based evolutionary algorithm with adaptive reference vectors. IEEE Trans. Cybern. 48(8), 2321\u20132334 (2018)","journal-title":"IEEE Trans. Cybern."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-642-15844-5_59","volume-title":"Parallel Problem Solving from Nature, PPSN XI: 11th International Conference, Krak\u00f3w, Poland, September 11-15, 2010, Proceedings, Part I","author":"A Auger","year":"2010","unstructured":"Auger, A., Bader, J., Brockhoff, D.: Theoretically investigating optimal $$\\mu $$-distributions for the hypervolume indicator: first results for three objectives. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) Parallel Problem Solving from Nature, PPSN XI: 11th International Conference, Krak\u00f3w, Poland, September 11-15, 2010, Proceedings, Part I, pp. 586\u2013596. Springer Berlin Heidelberg, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_59"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2011.03.012","volume":"425","author":"A Auger","year":"2012","unstructured":"Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Hypervolume-based multiobjective optimization: theoretical foundations and practical implications. Theoret. Comput. Sci. 425, 75\u2013103 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader, J., Zitzler, E.: Hype: an algorithm for fast hypervolume-based many-objective optimization. Evol. Comput. 19(1), 45\u201376 (2011)","journal-title":"Evol. Comput."},{"issue":"3","key":"16_CR6","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":"16_CR7","doi-asserted-by":"crossref","unstructured":"Bhattacharjee, K.S., Singh, H.K., Ray, T., Zhang, Q.: Decomposition based evolutionary algorithm with a dual set of reference vectors. In: IEEE Congress on Evolutionary Computation (CEC), pp. 105\u2013112 (2017)","DOI":"10.1109\/CEC.2017.7969302"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1162\/EVCO_a_00012","volume":"18","author":"K Bringmann","year":"2010","unstructured":"Bringmann, K., Friedrich, T.: An efficient algorithm for computing hypervolume contributions. Evol. Comput. 18(3), 383\u2013402 (2010)","journal-title":"Evol. Comput."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2010.09.026","volume":"425","author":"K Bringmann","year":"2012","unstructured":"Bringmann, K., Friedrich, T.: Approximating the least hypervolume contributor: Np-hard in general, but fast in practice. Theoret. Comput. Sci. 425, 104\u2013116 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Friedrich, T., Klitzke, P.: Two-dimensional subset selection for hypervolume and epsilon-indicator. In: ACM Genetic and Evolutionary Computation Conference\u00a0(GECCO), pp. 589\u2013596 (2014)","DOI":"10.1145\/2576768.2598276"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Brockhoff, D.: Optimal $$\\mu $$-distributions for the hypervolume indicator for problems with linear bi-objective fronts: Exact and exhaustive results. In: Asia-Pacific Conference on Simulated Evolution and Learning\u00a0(SEAL), pp. 24\u201334 (2010)","DOI":"10.1007\/978-3-642-17298-4_2"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/978-3-540-87700-4_65","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"D Brockhoff","year":"2008","unstructured":"Brockhoff, D., Friedrich, T., Neumann, F.: Analyzing hypervolume indicator based algorithms. In: Rudolph, G., Jansen, T., Beume, N., Lucas, S., Poloni, C. (eds.) Parallel Problem Solving from Nature \u2013 PPSN X, pp. 651\u2013660. Springer Berlin Heidelberg, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87700-4_65"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: IEEE Congress on Evolutionary Computation\u00a0(CEC), vol.\u00a01, pp. 825\u2013830 (2002)","DOI":"10.1109\/CEC.2002.1007032"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Deng, J., Sun, J., Zhang, Q., Li, H.: Efficient greedy decremental hypervolume subset selection using space partition tree. IEEE Transactions on Evolutionary Computation (2024)","DOI":"10.1109\/TEVC.2024.3400801"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1162\/EVCO_a_00126","volume":"23","author":"T Friedrich","year":"2015","unstructured":"Friedrich, T., Neumann, F., Thyssen, C.: Multiplicative approximations, optimal hypervolume distributions, and the choice of the reference point. Evol. Comput. 23(1), 131\u2013159 (2015)","journal-title":"Evol. Comput."},{"issue":"6","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/TEVC.2019.2899030","volume":"23","author":"A Habib","year":"2019","unstructured":"Habib, A., Singh, H.K., Chugh, T., Ray, T., Miettinen, K.: A multiple surrogate assisted decomposition-based evolutionary algorithm for expensive multi\/many-objective optimization. IEEE Trans. Evol. Comput. 23(6), 1000\u20131014 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"16_CR17","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":"2","key":"16_CR18","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":"16_CR19","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2014","unstructured":"Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, Part II: Handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18(4), 602\u2013622 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cor.2017.09.016","volume":"90","author":"A Jaszkiewicz","year":"2018","unstructured":"Jaszkiewicz, A.: Improved quick hypervolume algorithm. Comput. Oper. Res. 90, 72\u201383 (2018)","journal-title":"Comput. Oper. Res."},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Li, M., Yao, X.: Quality evaluation of solution sets in multiobjective optimisation: a survey. ACM Comput. Surv. 52(2) (2019)","DOI":"10.1145\/3300148"},{"issue":"6","key":"16_CR22","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1109\/TEVC.2022.3219081","volume":"27","author":"Y Nan","year":"2022","unstructured":"Nan, Y., Shang, K., Ishibuchi, H., He, L.: An improved local search method for large-scale hypervolume subset selection. IEEE Trans. Evol. Comput. 27(6), 1690\u20131704 (2022)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen, A.Q., Sutton, A.M., Neumann, F.: Population size matters: rigorous runtime results for maximizing the hypervolume indicator. In: ACM Genetic and Evolutionary Computation Conference\u00a0(GECCO), pp. 1613\u20131620 (2013)","DOI":"10.1145\/2463372.2463564"},{"issue":"5","key":"16_CR24","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":"16_CR25","doi-asserted-by":"crossref","unstructured":"Shang, K., Ishibuchi, H., Chen, W., Nan, Y., Liao, W.: Hypervolume-optimal $$\\mu $$-distributions on line\/plane-based pareto fronts in three dimensions. IEEE Trans. Evol. Comput. 26(2), 349\u2013363 (2021)SD","DOI":"10.1109\/TEVC.2021.3093114"},{"issue":"1","key":"16_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2020","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 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"16_CR27","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TEVC.2019.2909271","volume":"24","author":"K Shang","year":"2019","unstructured":"Shang, K., Ishibuchi, H., Ni, X.: R2-based hypervolume contribution approximation. IEEE Trans. Evol. Comput. 24(1), 185\u2013192 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"16_CR28","first-page":"603","volume":"24","author":"HK Singh","year":"2020","unstructured":"Singh, H.K.: Understanding hypervolume behavior theoretically for benchmarking in evolutionary multi\/many-objective optimization. IEEE Trans. Evol. Comput. 24(3), 603\u2013610 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"16_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."},{"issue":"1","key":"16_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-019-00798-7","volume":"75","author":"K Yang","year":"2019","unstructured":"Yang, K., Emmerich, M., Deutz, A., B\u00e4ck, T.: Efficient computation of expected hypervolume improvement using box decomposition algorithms. J. Global Optim. 75(1), 3\u201334 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00798-7","journal-title":"J. Global Optim."},{"issue":"2","key":"16_CR31","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/TEVC.2023.3265347","volume":"28","author":"L Zhao","year":"2023","unstructured":"Zhao, L., Zhang, Q.: Hypervolume-guided decomposition for parallel expensive multiobjective optimization. IEEE Trans. Evol. Comput. 28(2), 432\u2013444 (2023)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR32","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.) Evolutionary Multi-Criterion Optimization, pp. 862\u2013876. Springer Berlin Heidelberg, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70928-2_64"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-3506-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T12:49:23Z","timestamp":1740746963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-3506-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819635054","9789819635061"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-3506-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canberra, ACT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.emo2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}