{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:14:08Z","timestamp":1767626048470,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319202938"},{"type":"electronic","value":"9783319202945"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-20294-5_9","type":"book-chapter","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T13:54:03Z","timestamp":1436968443000},"page":"98-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["R-HV: A Metric for Computing Hyper-volume for Reference Point Based EMOs"],"prefix":"10.1007","author":[{"given":"Kalyanmoy","family":"Deb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Siegmund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos H. C.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","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","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.) PPSN XI. LNCS, vol. 6238, pp. 586\u2013596. Springer, Heidelberg (2010)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bader, J., Deb, K., Zitzler, E.: Faster hypervolume-based search using Monte Carlo sampling. In: Proceedings of Multiple Criteria Decision Making (MCDM 2008), LNEMS, vol. 634, pp. 313\u2013326. Springer, Heidelberg 2010","DOI":"10.1007\/978-3-642-04045-0_27"},{"issue":"1","key":"9_CR3","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. J. 19(1), 45\u201376 (2011)","journal-title":"Evol. Comput. J."},{"issue":"5","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TEVC.2009.2015575","volume":"13","author":"N Beume","year":"2009","unstructured":"Beume, N., Fonseca, C.M., L\u00f3pez-Ib\u00e1\u00f1ez, M., Paquete, L., Vahrenhold, J.: On the complexity of computing the hypervolume indicator. IEEE Trans. Evol. Comput. 13(5), 1075\u20131082 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TEVC.2008.919001","volume":"12","author":"L Bradstreet","year":"2008","unstructured":"Bradstreet, L., While, L., Barone, L.: A fast incremental hypervolume algorithm. IEEE Trans. Evol. Comput. 12(6), 714\u2013723 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Corne, D. W., Knowles, J. D., Oates, M.: The Pareto envelope-based selection algorithm for multiobjective optimization. In: Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature VI (PPSN-VI), pp. 839\u2013848 (2000)","DOI":"10.1007\/3-540-45356-3_82"},{"key":"9_CR7","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Deb, K., Kumar, A.: Interactive evolutionary multi-objective optimization and decision-making using reference direction method. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2007), pp. 781\u2013788. The Association of Computing Machinery (ACM), New York (2007)","DOI":"10.1145\/1276958.1277116"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Deb, K., Kumar, A.: Light beam search based multi-objective optimization using evolutionary algorithms. In: Proceedings of the Congress on Evolutionary Computation (CEC 2007), pp. 2125\u20132132 (2007)","DOI":"10.1109\/CEC.2007.4424735"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1162\/106365605774666895","volume":"13","author":"K Deb","year":"2005","unstructured":"Deb, K., Mohan, M., Mishra, S.: Evaluating the $$\\epsilon $$-domination based multi-objective evolutionary algorithm for a quick computation of Pareto-optimal solutions. Evol. Comput. J. 13(4), 501\u2013525 (2005)","journal-title":"Evol. Comput. J."},{"issue":"6","key":"9_CR12","first-page":"273","volume":"2","author":"K Deb","year":"2006","unstructured":"Deb, K., Sundar, J., Uday, N., Chaudhuri, S.: Reference point based multi-objective optimization using evolutionary algorithms. Int. J. Comput. Intell. Res. (IJCIR) 2(6), 273\u2013286 (2006)","journal-title":"Int. J. Comput. Intell. Res. (IJCIR)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Fonseca, C. M., Paquete, L., L\u00f3pez-Ib\u00e1nez, M.: An improved dimension sweep algorithm for the hypervolume indicator. In: Proceedings of the 2006 Congress on Evolutionary Computation (CEC 2006), pp. 1157\u20131163. IEEE Press, Piscataway, NJ (2006)","DOI":"10.1109\/CEC.2006.1688440"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Knowles, J. D., Corne, D. W.: On metrics for comparing nondominated sets. In: Congress on Evolutionary Computation (CEC-2002), pp. 711\u2013716. IEEE Press, Piscataway, NJ (2002)","DOI":"10.1109\/CEC.2002.1007013"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"L While","year":"2006","unstructured":"While, L., Hingston, P., Barone, L., Huband, S.: A faster algorithm for calculating hypervolume. IEEE Trans. Evol. Comput. 10(1), 29\u201338 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-642-48782-8_32","volume-title":"Multiple Criteria Decision Making Theory and Applications","author":"AP Wierzbicki","year":"1980","unstructured":"Wierzbicki, A.P.: The use of reference objectives in multiobjective optimization. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making Theory and Applications, pp. 468\u2013486. Springer-Verlag, Berlin (1980)"},{"key":"9_CR17","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou, K. C., Tsahalis, D. T., P\u00e9riaux, J., Papailiou, K. D., Fogarty, T.(eds.) Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, International Center for Numerical Methods in Engineering (CIMNE), pp. 95\u2013100. Athens (2001)"},{"key":"9_CR18","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 - PPSN V","author":"E Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms - 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)"},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20294-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T07:11:09Z","timestamp":1748502669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20294-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319202938","9783319202945"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20294-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}