{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:56:53Z","timestamp":1743101813396,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"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-58115-2_18","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"257-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hypervolume Optimal $$\\mu $$-Distributions on Line-Based Pareto Fronts in Three Dimensions"],"prefix":"10.1007","author":[{"given":"Ke","family":"Shang","sequence":"first","affiliation":[]},{"given":"Hisao","family":"Ishibuchi","sequence":"additional","affiliation":[]},{"given":"Weiyu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Luk\u00e1\u0161","family":"Adam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"18_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 2010. LNCS, vol. 6238, pp. 586\u2013596. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15844-5_59"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Theory of the hypervolume indicator: optimal $$\\mu $$-distributions and the choice of the reference point. In: Proceedings of the Tenth ACM SIGEVO Workshop on Foundations of Genetic Algorithms, pp. 87\u2013102. ACM (2009)","DOI":"10.1145\/1527125.1527138"},{"key":"18_CR3","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. Theor. Comput. Sci. 425, 75\u2013103 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR4","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":"18_CR5","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":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-17298-4_2","volume-title":"Simulated Evolution and Learning","author":"D Brockhoff","year":"2010","unstructured":"Brockhoff, D.: Optimal $$\\mu $$-distributions for the hypervolume indicator for problems with linear bi-objective fronts: exact and exhaustive results. In: Deb, K., et al. (eds.) SEAL 2010. LNCS, vol. 6457, pp. 24\u201334. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17298-4_2"},{"key":"18_CR7","series-title":"Advanced Information and Knowledge Processing","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.) Evolutionary Multiobjective Optimization. Advanced Information and Knowledge Processing, pp. 105\u2013145. Springer, London (2005). \nhttps:\/\/doi.org\/10.1007\/1-84628-137-7_6"},{"key":"18_CR8","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31880-4_5"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-75514-2_11","volume-title":"Hybrid Metaheuristics","author":"M Emmerich","year":"2007","unstructured":"Emmerich, M., Deutz, A., Beume, N.: Gradient-based\/evolutionary relay hybrid for computing Pareto front approximations maximizing the S-metric. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HM 2007. LNCS, vol. 4771, pp. 140\u2013156. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-75514-2_11"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-36970-8_37","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M Fleischer","year":"2003","unstructured":"Fleischer, M.: The measure of Pareto optima applications to multi-objective metaheuristics. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 519\u2013533. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36970-8_37"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/s10898-019-00737-6","volume":"73","author":"B Gebken","year":"2019","unstructured":"Gebken, B., Peitz, S., Dellnitz, M.: On the hierarchical structure of pareto critical sets. J. Glob. Optim. 73(4), 891\u2013913 (2019). \nhttps:\/\/doi.org\/10.1007\/s10898-019-00737-6","journal-title":"J. Glob. Optim."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-319-10762-2_56","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"T Glasmachers","year":"2014","unstructured":"Glasmachers, T.: Optimized approximation sets for low-dimensional benchmark Pareto fronts. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 569\u2013578. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10762-2_56"},{"issue":"5","key":"18_CR13","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.: The set-based hypervolume Newton method for bi-objective optimization. IEEE Trans. Cybern. 50(5), 2186\u20132196 (2018)","journal-title":"IEEE Trans. Cybern."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-030-12598-1_27","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H Ishibuchi","year":"2019","unstructured":"Ishibuchi, H., Imada, R., Masuyama, N., Nojima, Y.: Comparison of hypervolume, IGD and IGD$$^{+}$$ from the viewpoint of optimal distributions of solutions. In: Deb, K., et al. (eds.) EMO 2019. LNCS, vol. 11411, pp. 332\u2013345. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-12598-1_27"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Imada, R., Setoguchi, Y., Nojima, Y.: Hypervolume subset selection for triangular and inverted triangular pareto fronts of three-objective problems. In: Proceedings of the 14th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms, pp. 95\u2013110. ACM (2017)","DOI":"10.1145\/3040718.3040730"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Imada, R., Setoguchi, Y., Nojima, Y.: Reference point specification in hypervolume calculation for fair comparison and efficient search. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 585\u2013592. ACM (2017)","DOI":"10.1145\/3071178.3071264"},{"issue":"2","key":"18_CR17","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":"10","key":"18_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":"18_CR19","doi-asserted-by":"crossref","unstructured":"Shang, K., Ishibuchi, H.: A new hypervolume-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. (Early Access) (2020)","DOI":"10.36227\/techrxiv.11381016.v2"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Shukla, P.K., Doll, N., Schmeck, H.: A theoretical analysis of volume based Pareto front approximations. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 1415\u20131422 (2014)","DOI":"10.1145\/2576768.2598348"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Tanabe, R., Ishibuchi, H.: An analysis of quality indicators using approximated optimal distributions in a three-dimensional objective space. IEEE Trans. Evol. Comput. (Early Access) (2020)","DOI":"10.1109\/TEVC.2020.2966014"},{"key":"18_CR22","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70928-2_64"}],"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-58115-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:05:22Z","timestamp":1598997922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_18","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":"2 September 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)"}}]}}