{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:15:58Z","timestamp":1742930158349,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_13","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"172-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analytical Methods to\u00a0Separately Evaluate Convergence and\u00a0Diversity for\u00a0Multi-objective Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1556-8259","authenticated-orcid":false,"given":"Takato","family":"Kinoshita","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-1588","authenticated-orcid":false,"given":"Naoki","family":"Masuyama","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4853-1305","authenticated-orcid":false,"given":"Yusuke","family":"Nojima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-6472","authenticated-orcid":false,"given":"Hisao","family":"Ishibuchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"13_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 1027\u20131035. Society for Industrial and Applied Mathematics, USA (2007)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-540-92182-0_40","volume-title":"Algorithms and Computation","author":"K Bringmann","year":"2008","unstructured":"Bringmann, K., Friedrich, T.: Approximating the volume of unions and intersections of high-dimensional geometric objects. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 436\u2013447. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_40"},{"issue":"5","key":"13_CR3","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng, R., Jin, Y., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(5), 773\u2013791 (2016). https:\/\/doi.org\/10.1109\/TEVC.2016.2519378","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s40747-017-0039-7","volume":"3","author":"R Cheng","year":"2017","unstructured":"Cheng, R., et al.: A benchmark test suite for evolutionary many-objective optimization. Complex Intell. Syst. 3(1), 67\u201381 (2017). https:\/\/doi.org\/10.1007\/s40747-017-0039-7","journal-title":"Complex Intell. Syst."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10710-005-6164-x","volume":"6","author":"CAC Coello","year":"2005","unstructured":"Coello, C.A.C., Cort\u00e9s, N.C.: Solving multiobjective optimization problems using an artificial immune system. Genet. Program Evolvable Mach. 6(2), 163\u2013190 (2005). https:\/\/doi.org\/10.1007\/s10710-005-6164-x","journal-title":"Genet. Program Evolvable Mach."},{"issue":"2","key":"13_CR6","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115\u2013148 (1995)","journal-title":"Complex Syst."},{"key":"13_CR7","first-page":"30","volume":"26","author":"K Deb","year":"1996","unstructured":"Deb, K., Goyal, M.: A combined genetic adaptive search (GeneAS) for engineering design. Comput. Sci. Inform. 26, 30\u201345 (1996)","journal-title":"Comput. Sci. Inform."},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR9","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). https:\/\/doi.org\/10.1007\/1-84628-137-7_6"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-31880-4_2","volume-title":"Evolutionary Multi-Criterion Optimization","author":"PJ Fleming","year":"2005","unstructured":"Fleming, P.J., Purshouse, R.C., Lygoe, R.J.: Many-objective optimization: an engineering design perspective. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 14\u201332. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_2"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1162\/evco_a_00226","volume":"26","author":"H Ishibuchi","year":"2018","unstructured":"Ishibuchi, H., Imada, R., Setoguchi, Y., Nojima, Y.: How to specify a reference point in hypervolume calculation for fair performance comparison. Evol. Comput. 26(3), 411\u2013440 (2018). https:\/\/doi.org\/10.1162\/evco_a_00226","journal-title":"Evol. Comput."},{"issue":"6","key":"13_CR12","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":"13_CR13","doi-asserted-by":"publisher","unstructured":"Ishikawa, T., Fukumoto, H., Oyama, A., Nishida, H.: Improved binary additive epsilon indicator for obtaining uniformly distributed solutions in multi-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, pp. 209\u2013210 (2019). https:\/\/doi.org\/10.1145\/3319619.3322025","DOI":"10.1145\/3319619.3322025"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Kinoshita, T., Masuyama, N., Liu, Y., Nojima, Y., Ishibuchi, H.: Reference vector adaptation and mating selection strategy via adaptive resonance theory-based clustering for many-objective optimization (2022). https:\/\/doi.org\/10.48550\/ARXIV.2204.10756","DOI":"10.48550\/ARXIV.2204.10756"},{"issue":"5","key":"13_CR15","doi-asserted-by":"publisher","first-page":"2698","DOI":"10.1109\/TCYB.2020.3020630","volume":"52","author":"Q Liu","year":"2022","unstructured":"Liu, Q., Jin, Y., Heiderich, M., Rodemann, T., Yu, G.: An adaptive reference vector-guided evolutionary algorithm using growing neural gas for many-objective optimization of irregular problems. IEEE Trans. Cybern. 52(5), 2698\u20132711 (2022). https:\/\/doi.org\/10.1109\/TCYB.2020.3020630","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"13_CR16","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."},{"issue":"5","key":"13_CR17","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/TEVC.2020.2966014","volume":"24","author":"R Tanabe","year":"2020","unstructured":"Tanabe, R., Ishibuchi, H.: An analysis of quality indicators using approximated optimal distributions in a 3-D objective space. IEEE Trans. Evol. Comput. 24(5), 853\u2013867 (2020). https:\/\/doi.org\/10.1109\/TEVC.2020.2966014","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"13_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian, Y., Cheng, R., Zhang, X., Jin, Y.: PlatEMO: a MATLAB platform for evolutionary multi-objective optimization. IEEE Comput. Intell. Mag. 12(4), 73\u201387 (2017). https:\/\/doi.org\/10.1109\/MCI.2017.2742868","journal-title":"IEEE Comput. Intell. Mag."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen, D.A.: Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Ph.D. thesis, USA (1999). aAI9928483","DOI":"10.1145\/298151.298382"},{"issue":"6","key":"13_CR20","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007). https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR21","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). https:\/\/doi.org\/10.1007\/978-3-540-70928-2_64"},{"key":"13_CR22","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). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"},{"issue":"4","key":"13_CR23","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). https:\/\/doi.org\/10.1109\/4235.797969","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:03:51Z","timestamp":1688198631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","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":"72","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":"48","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":"17","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":"67% - 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":"3","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)"}}]}}