{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T12:57:56Z","timestamp":1771333076121,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_7","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"96-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Exact Inverted Generational Distance for\u00a0Continuous Pareto Front"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4730-8312","authenticated-orcid":false,"given":"Zihan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunyun","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4768-5946","authenticated-orcid":false,"given":"Aimin","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TEVC.2020.2992387","volume":"25","author":"J Blank","year":"2021","unstructured":"Blank, J., Deb, K., Dhebar, Y.D., Bandaru, S., Seada, H.: Generating well-spaced points on a unit simplex for evolutionary many-objective optimization. IEEE Trans. Evol. Comput. 25(1), 48\u201360 (2021). https:\/\/doi.org\/10.1109\/TEVC.2020.2992387","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/978-3-540-24694-7_71","volume-title":"MICAI 2004: Advances in Artificial Intelligence","author":"CA Coello Coello","year":"2004","unstructured":"Coello Coello, C.A., Reyes Sierra, M.: A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds.) MICAI 2004. LNCS (LNAI), vol. 2972, pp. 688\u2013697. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24694-7_71"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das, I., Dennis, J.E.: Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8(3), 631\u2013657 (1998). https:\/\/doi.org\/10.1137\/S1052623496307510","journal-title":"SIAM J. Optim."},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L.C., Goldberg, R.R. (eds.) Evolutionary Multiobjective Optimization. Advanced Information and Knowledge Processing, pp. 105\u2013145. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/1-84628-137-7_6","DOI":"10.1007\/1-84628-137-7_6"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"He, C., Pan, L., Xu, H., Tian, Y., Zhang, X.: An improved reference point sampling method on pareto optimal front. In: IEEE Congress on Evolutionary Computation, CEC 2016, Vancouver, BC, Canada, 24\u201329 July 2016, pp. 5230\u20135237. IEEE (2016). https:\/\/doi.org\/10.1109\/CEC.2016.7748353","DOI":"10.1109\/CEC.2016.7748353"},{"issue":"5","key":"7_CR7","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). https:\/\/doi.org\/10.1109\/TEVC.2005.861417","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TEVC.2017.2776226","volume":"22","author":"H Ishibuchi","year":"2018","unstructured":"Ishibuchi, H., Imada, R., Setoguchi, Y., Nojima, Y.: Reference point specification in inverted generational distance for triangular linear pareto front. IEEE Trans. Evol. Comput. 22(6), 961\u2013975 (2018). https:\/\/doi.org\/10.1109\/TEVC.2017.2776226","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Ishibuchi, H., Masuda, H., Nojima, Y.: Sensitivity of performance evaluation results by inverted generational distance to reference points. In: IEEE Congress on Evolutionary Computation, CEC 2016, Vancouver, BC, Canada, 24\u201329 July 2016, pp. 1107\u20131114. IEEE (2016). https:\/\/doi.org\/10.1109\/CEC.2016.7743912","DOI":"10.1109\/CEC.2016.7743912"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-15892-1_8","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H Ishibuchi","year":"2015","unstructured":"Ishibuchi, H., Masuda, H., Tanigaki, Y., Nojima, Y.: Modified distance calculation in generational distance and inverted generational distance. In: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C.C. (eds.) EMO 2015. LNCS, vol. 9019, pp. 110\u2013125. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15892-1_8"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Li, M., Yao, X.: Quality evaluation of solution sets in multiobjective optimisation: a survey. ACM Comput. Surv. 52(2), 26:1\u201326:38 (2019). https:\/\/doi.org\/10.1145\/3300148","DOI":"10.1145\/3300148"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TEVC.2011.2161872","volume":"16","author":"O Sch\u00fctze","year":"2012","unstructured":"Sch\u00fctze, O., Esquivel, X., Lara, A., Coello, C.A.C.: Using the averaged Hausdorff distance as a performance measure in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 16(4), 504\u2013522 (2012). https:\/\/doi.org\/10.1109\/TEVC.2011.2161872","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2021","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 (2021). https:\/\/doi.org\/10.1109\/TEVC.2020.3013290","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Tian, Y., Xiang, X., Zhang, X., Cheng, R., Jin, Y.: Sampling reference points on the pareto fronts of benchmark multi-objective optimization problems. In: 2018 IEEE Congress on Evolutionary Computation, CEC 2018, Rio de Janeiro, Brazil, 8\u201313 July 2018, pp. 1\u20136. IEEE (2018). https:\/\/doi.org\/10.1109\/CEC.2018.8477730","DOI":"10.1109\/CEC.2018.8477730"},{"key":"7_CR15","unstructured":"Valenzuela-Rend\u00f3n, M., Uresti-Charre, E.: A non-generational genetic algorithm for multiobjective optimization. In: B\u00e4ck, T. (ed.) Proceedings of the 7th International Conference on Genetic Algorithms, East Lansing, MI, USA, 19\u201323 July 1997, pp. 658\u2013665. Morgan Kaufmann (1997)"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Zhou, A., Jin, Y., Zhang, Q., Sendhoff, B., Tsang, E.P.K.: Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion. In: IEEE International Conference on Evolutionary Computation, CEC 2006, part of WCCI 2006, Vancouver, BC, Canada, 16\u201321 July 2006, pp. 892\u2013899. IEEE (2006). https:\/\/doi.org\/10.1109\/CEC.2006.1688406","DOI":"10.1109\/CEC.2006.1688406"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou, A., Qu, B., Li, H., Zhao, S., Suganthan, P.N., Zhang, Q.: Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol. Comput. 1(1), 32\u201349 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.03.001","journal-title":"Swarm Evol. Comput."},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Zhou, A., Zhang, Q., Jin, Y., Sendhoff, B.: Adaptive modelling strategy for continuous multi-objective optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, Singapore, 25\u201328 September 2007, pp. 431\u2013437. IEEE (2007). https:\/\/doi.org\/10.1109\/CEC.2007.4424503","DOI":"10.1109\/CEC.2007.4424503"},{"issue":"2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173\u2013195 (2000). https:\/\/doi.org\/10.1162\/106365600568202","journal-title":"Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:47:55Z","timestamp":1710262075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","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":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"185","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":"85","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":"46% - 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.75","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":"3.11","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)"}}]}}