{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T06:55:13Z","timestamp":1764053713434,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030720612"},{"type":"electronic","value":"9783030720629"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-72062-9_28","type":"book-chapter","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T00:15:18Z","timestamp":1616544918000},"page":"349-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The (M-1)+1 Framework of Relaxed Pareto Dominance for Evolutionary Many-Objective Optimization"],"prefix":"10.1007","author":[{"given":"Shuwei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Goodman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalyanmoy","family":"Deb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhichao","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,24]]},"reference":[{"issue":"4","key":"28_CR1","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)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"28_CR2","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)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"28_CR3","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."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Matsumoto, T., Masuyama, N., Nojima, Y.: Effects of dominance resistant solutions on the performance of evolutionary multi-objective and many-objective algorithms. In: Proceedings of Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 507\u2013515 (2020)","DOI":"10.1145\/3377930.3390166"},{"key":"28_CR5","unstructured":"Ishibuchi, H., Matsumoto, T., Masuyama, N., Nojima, Y.: Many-objective problems are not always difficult for pareto dominance-based evolutionary algorithms. In: Proceedings of 24th European Conference on Artificial Intelligence (ECAI) (2020)"},{"key":"28_CR6","unstructured":"K. Ikeda, H. Kita, S.K.: Failure of Pareto-based MOEAs: does non-dominated really mean near to optimal? In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. 2, pp. 957\u2013962 (2001)"},{"issue":"5","key":"28_CR7","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2015","unstructured":"Li, K., Deb, K., Zhang, Q., Kwong, S.: An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans. Evol. Comput. 19(5), 694\u2013716 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-030-58452-8_3","volume-title":"Computer Vision \u2013 ECCV 2020","author":"Z Lu","year":"2020","unstructured":"Lu, Z., Deb, K., Goodman, E., Banzhaf, W., Boddeti, V.N.: NSGANetV2: evolutionary multi-objective surrogate-assisted neural architecture search. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.-M. (eds.) ECCV 2020. LNCS, vol. 12346, pp. 35\u201351. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58452-8_3"},{"key":"28_CR9","doi-asserted-by":"publisher","unstructured":"Lu, Z., Whalen, I., Dhebar, Y., Deb, K., Goodman, E., Banzhaf, W., Boddeti, V.N.: Multi-objective evolutionary design of deep convolutional neural networks for image classification. IEEE Trans. Evol. Comput. (2020). https:\/\/doi.org\/10.1109\/TEVC.2020.3024708","DOI":"10.1109\/TEVC.2020.3024708"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TEVC.2016.2623770","volume":"22","author":"T Santos","year":"2018","unstructured":"Santos, T., Takahashi, R.H.: On the performance degradation of dominance-based evolutionary algorithms in many-objective optimization. IEEE Trans. Evol. Comput. 22(1), 19\u201331 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-642-17298-4_49","volume-title":"Simulated Evolution and Learning","author":"H Sato","year":"2010","unstructured":"Sato, H., Aguirre, H.E., Tanaka, K.: Self-controlling dominance area of solutions in evolutionary many-objective optimization. In: Deb, K., et al. (eds.) SEAL 2010. LNCS, vol. 6457, pp. 455\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17298-4_49"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Sato, H., Aguirre, H.E., Tanaka, K.: Controlling dominance area of solutions and its impact on the performance of MOEAs. In: Proceedings of International Conference on Evolutionary Multi-Criterion Optimization (EMO 2007), pp. 5\u201320. ACM (2007)","DOI":"10.1007\/978-3-540-70928-2_5"},{"issue":"4","key":"28_CR13","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 [educational forum]. IEEE Comput. Intell. Mag. 12(4), 73\u201387 (2017)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/TEVC.2018.2866854","volume":"23","author":"Y Tian","year":"2019","unstructured":"Tian, Y., Cheng, R., Zhang, X., Su, Y., Jin, Y.: A strengthened dominance relation considering convergence and diversity for evolutionary many-objective optimization. IEEE Trans. Evol. Comput. 23(2), 331\u2013345 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TEVC.2015.2420112","volume":"20","author":"Y Yuan","year":"2016","unstructured":"Yuan, Y., Xu, H., Wang, B., Yao, X.: A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(1), 16\u201337 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"28_CR16","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/TEVC.2015.2457245","volume":"20","author":"C Zhu","year":"2016","unstructured":"Zhu, C., Xu, L., Goodman, E.D.: Generalization of Pareto-optimality for many-objective evolutionary optimization. IEEE Trans. Evol. Comput. 20(2), 299\u2013315 (2016)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72062-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T20:08:01Z","timestamp":1621282081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72062-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720612","9783030720629"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72062-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"24 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.emo2021.org\/","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":"120","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":"47","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":"14","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":"39% - 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)"}}]}}