{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:17Z","timestamp":1759847297091,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581114"},{"type":"electronic","value":"9783030581121"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58112-1_15","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"215-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Approximate Hypervolume Calculation with Guaranteed or Confidence Bounds"],"prefix":"10.1007","author":[{"given":"A.","family":"Jaszkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Susmaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Zielniewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Bader, J., Deb, K., Zitzler, E.: Faster hypervolume-based search using Monte Carlo sampling. In: Ehrgott, M., Naujoks, B., Stewart, T.J., Wallenius, J. (eds.) Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, pp. 313\u2013326. Springer, Berlin. \nhttps:\/\/doi.org\/10.1007\/978-3-642-04045-0_27","DOI":"10.1007\/978-3-642-04045-0_27"},{"issue":"1","key":"15_CR2","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":"5","key":"15_CR3","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., Lopez-Ibanez, 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":"3","key":"15_CR4","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. Euro. J. Oper. Res. 181(3), 1653\u20131669 (2007)","journal-title":"Euro. J. Oper. Res."},{"key":"15_CR5","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. Theor. Comput. Sci. 425, 104\u2013116 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Klee\u2019s measure problem made easy. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 410\u2013419 (2013)","DOI":"10.1109\/FOCS.2013.51"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Fieldsend, J.E.: Efficient real-time hypervolume estimation with monotonically reducing error. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, New York, USA, pp. 532\u2013540. Association for Computing Machinery (2019)","DOI":"10.1145\/3321707.3321730"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/TEVC.2017.2729550","volume":"22","author":"AP Guerreiro","year":"2018","unstructured":"Guerreiro, A.P., Fonseca, C.M.: Computing and updating hypervolume contributions in up to four dimensions. IEEE Trans. Evol. Comput. 22(3), 449\u2013463 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Tsukamoto, N., Sakane, Y., Nojima, Y.: Hypervolume approximation using achievement scalarizing functions for evolutionary many-objective optimization. In: 2009 IEEE Congress on Evolutionary Computation, pp. 530\u2013537. IEEE (2009)","DOI":"10.1109\/CEC.2009.4982991"},{"key":"15_CR10","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."},{"issue":"5","key":"15_CR11","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1109\/TEVC.2018.2799684","volume":"22","author":"A Jaszkiewicz","year":"2018","unstructured":"Jaszkiewicz, A., Lust, T.: ND-tree-based update: a fast algorithm for the dynamic nondominance problem. IEEE Trans. Evol. Comput. 22(5), 778\u2013791 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"10","key":"15_CR12","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":"15_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.cor.2016.06.021","volume":"79","author":"R Lacour","year":"2017","unstructured":"Lacour, R., Klamroth, K., Fonseca, C.M.: A box decomposition algorithm to compute the hypervolume indicator. Comput. Oper. Res. 79, 347\u2013360 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2792984","volume":"48","author":"B Li","year":"2015","unstructured":"Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. 48(1), 1\u201335 (2015)","journal-title":"ACM Comput. Surv."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/TEVC.2017.2704118","volume":"22","author":"X Ma","year":"2018","unstructured":"Ma, X., Zhang, Q., Tian, G., Yang, J., Zhu, Z.: On Tchebycheff decomposition approaches for multiobjective evolutionary optimization. IEEE Trans. Evol. Comput. 22, 226\u2013244 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"15_CR16","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1002\/(SICI)1097-0258(19980430)17:8<857::AID-SIM777>3.0.CO;2-E","volume":"17","author":"RG Newcombe","year":"1998","unstructured":"Newcombe, R.G.: Two-sided confidence intervals for the single proportion: comparison of seven methods. Stat. Med. 17(8), 857\u2013872 (1998)","journal-title":"Stat. Med."},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/TEVC.2013.2281525","volume":"18","author":"LMS Russo","year":"2014","unstructured":"Russo, L.M.S., Francisco, A.P.: Quick hypervolume. IEEE Trans. Evol. Comput. 18(4), 481\u2013502 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10732-016-9309-6","volume":"22","author":"LMS Russo","year":"2016","unstructured":"Russo, L.M.S., Francisco, A.P.: Extending quick hypervolume. J. Heuristics 22(3), 245\u2013271 (2016)","journal-title":"J. Heuristics"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Shang, K., Ishibuchi, H., Zhang, M.L., Liu, Y.: A new R2 indicator for better hypervolume approximation. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, New York, USA, pp. 745\u2013752. Association for Computing Machinery (2018)","DOI":"10.1145\/3205455.3205543"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-319-63309-1_2","volume-title":"Intelligent Computing Theories and Application","author":"W Tang","year":"2017","unstructured":"Tang, W., Liu, H., Chen, L.: A fast approximate hypervolume calculation method by a novel decomposition strategy. In: Huang, D.-S., Bevilacqua, V., Premaratne, P., Gupta, P. (eds.) ICIC 2017. LNCS, vol. 10361, pp. 14\u201325. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63309-1_2"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"While, L., Bradstreet, L.: Applying the WFG algorithm to calculate incremental hypervolumes. In: 2012 IEEE Congress on Evolutionary Computation, New York, USA. IEEE International Conference on Fuzzy Systems\/International Joint Conference on Neural Networks\/IEEE Congress on Evolutionary Computation\/IEEE World Congress on Computational Intelligence, Brisbane, Australia, 10\u201315 June 2012","DOI":"10.1109\/CEC.2012.6256171"},{"issue":"2","key":"15_CR22","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."},{"key":"15_CR23","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:15:33Z","timestamp":1599063333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 August 2020","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":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"268","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":"99","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":"37% - 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","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":"2.2","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)"}}]}}