{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T06:47:38Z","timestamp":1749797258925,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953904"},{"type":"electronic","value":"9783030953911"}],"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-030-95391-1_36","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:04:54Z","timestamp":1645520694000},"page":"571-586","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two-Stage Evolutionary Algorithm Using Clustering for Multimodal Multi-objective Optimization with Imbalance Convergence and Diversity"],"prefix":"10.1007","author":[{"given":"Guoqing","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanliang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yule","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"issue":"2","key":"36_CR1","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: NSGAII. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"36_CR2","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)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"36_CR3","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"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Liang, J., Yue, C.T., Qu, B.Y.: Multimodal multi-objective optimization: a preliminary study. In: Yao, X., Deb, K. (eds.) IEEE Congress on Evolutionary Computation, , vol. 1, pp. 2454\u20132461. IEEE (2016)","DOI":"10.1109\/CEC.2016.7744093"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-540-30217-9_75","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"M Kim","year":"2004","unstructured":"Kim, M., Hiroyasu, T., Miki, M., Watanabe, S.: SPEA2+: improving the performance of the strength pareto evolutionary algorithm 2. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 742\u2013751. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_75"},{"issue":"3","key":"36_CR6","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.ejor.2006.06.042","volume":"185","author":"K Deb","year":"2008","unstructured":"Deb, K., Tiwari, S.: Omni-optimizer: a generic evolutionary algorithm for single and multi-objective optimization. Eur. J. Oper. Res. 185(3), 1062\u20131087 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/TEVC.2009.2021467","volume":"13","author":"AM Zhou","year":"2009","unstructured":"Zhou, A.M., Zhang, Q.F., Jin, Y.C.: Approximating the set of pareto-optimal solutions in both the decision and objective spaces by an estimation of distribution algorithm. IEEE Trans. Evol. Comput. 13(5), 1167\u20131189 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"36_CR8","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/TEVC.2019.2949841","volume":"24","author":"R Tanabe","year":"2020","unstructured":"Tanabe, R., Ishibuchi, H.: A framework to handle multimodal multiobjective optimization in decomposition-based evolutionary algorithms. IEEE Trans. Evol. Comput. 24(4), 720\u2013734 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.swevo.2019.06.001","volume":"49","author":"R Tanabe","year":"2019","unstructured":"Tanabe, R., Ishibuchi, H.: A niching indicator-based multi-modal many-objective optimizer. Swarm Evol. Comput. 49, 134\u2013146 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"5","key":"36_CR10","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TEVC.2017.2754271","volume":"22","author":"CT Yue","year":"2017","unstructured":"Yue, C.T., Qu, B.Y., Liang, J.: A multiobjective particle swarm optimizer using ring topology for solving multimodal multiobjective problems. IEEE Trans. Evol. Comput. 22(5), 805\u2013817 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"36_CR11","doi-asserted-by":"publisher","first-page":"8720","DOI":"10.1007\/s10489-021-02299-1","volume":"51","author":"G Li","year":"2021","unstructured":"Li, G., et al.: A SHADE-based multimodal multi-objective evolutionary algorithm with fitness sharing. Appl. Intell. 51(12), 8720\u20138752 (2021). https:\/\/doi.org\/10.1007\/s10489-021-02299-1","journal-title":"Appl. Intell."},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"100569","DOI":"10.1016\/j.swevo.2019.100569","volume":"50","author":"WZ Zhang","year":"2019","unstructured":"Zhang, W.Z., Li, G.Q., Zhang, W.W., Liang, J., Yen, G.G.: A cluster based PSO with leader updating mechanism and ring-topology for multimodal multi-objective optimization. Swarm Evolut. Comput. 50, 100569 (2019)","journal-title":"Swarm Evolut. Comput."},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-319-99253-2_21","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Ishibuchi, H., Nojima, Y., Masuyama, N., Shang, K.: A double-niched evolutionary algorithm and its behavior on polygon-based problems. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 262\u2013273. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_21"},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TEVC.2019.2909744","volume":"24","author":"R Tanabe","year":"2019","unstructured":"Tanabe, R., Ishibuchi, H.: A review of evolutionary multimodal multiobjective optimization. IEEE Trans. Evol. Comput. 24(1), 193\u2013200 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"36_CR15","first-page":"408","volume":"21","author":"HL Liu","year":"2017","unstructured":"Liu, H.L., Chen, L., Deb, K., Goodman, E.D.: Investigating the effect of imbalance between convergence and diversity in evolutionary multiobjective algorithms. IEEE Trans. Evol. Comput. 21(3), 408\u2013425 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"36_CR16","first-page":"551","volume":"24","author":"YP Liu","year":"2020","unstructured":"Liu, Y.P., Ishibuchi, H., Yen, G.G., Nojima, Y., Masuyama, M.: Handling imbalance between convergence and diversity in the decision space in evolutionary multimodal multiobjective optimization. IEEE Trans. Evol. Comput. 24(3), 551\u2013565 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"36_CR17","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TEVC.2020.3008822","volume":"25","author":"QZ Lin","year":"2021","unstructured":"Lin, Q.Z., Lin, W., Zhu, Z.X., Gong, M.G., Coello, C.A.C.: Multimodal multi-objective evolutionary optimization with dual clustering in decision and objective spaces. IEEE Trans. Evol. Comput. 25(1), 130\u2013144 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"36_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100976","author":"WL Wang","year":"2021","unstructured":"Wang, W.L., Li, G.L., Wang, Y.L., et al.: Clearing-based multimodal multi-objective evolutionary optimization with layer-to-layer strategy. Swarm Evol. Comput. (2021). https:\/\/doi.org\/10.1016\/j.swevo.2021.100976","journal-title":"Swarm Evol. Comput."},{"key":"36_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-99253-2_20","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"R Tanabe","year":"2018","unstructured":"Tanabe, R., Ishibuchi, H.: A Decomposition-based evolutionary algorithm for multi-modal multi-objective optimization. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 249\u2013261. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_20"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Liu, Y.P., Ishibuchi, H., Nojima, Y., Masuyama, N., Han, Y.Y.: Searching for local Pareto optimal solutions: a case study on Polygon-based problems. In: Zhang, M.J., Tan, K.C. (eds.) 2019 IEEE Congress on Evolutionary Computation (CEC 2019), pp. 896\u2013903. IEEE (2019)","DOI":"10.1109\/CEC.2019.8790066"},{"issue":"4","key":"36_CR21","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TEVC.2018.2879406","volume":"23","author":"YP Liu","year":"2019","unstructured":"Liu, Y.P., Yen, G.G., Gong, D.W.: A multimodal multiobjective evolutionary algorithm using two-archive and recombination strategies. IEEE Trans. Evol. Comput. 23(4), 660\u2013674 (2019)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95391-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:10:38Z","timestamp":1645521038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95391-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953904","9783030953911"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95391-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","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":"403","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":"145","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":"36% - 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.12","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.27","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}