{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:50:16Z","timestamp":1742957416495,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147203"},{"type":"electronic","value":"9783031147210"}],"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_10","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"138-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Multi-modal Multi-objective Optimization: A Preliminary Study"],"prefix":"10.1007","author":[{"given":"Yiming","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisao","family":"Ishibuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00500-015-1820-4","volume":"21","author":"R Azzouz","year":"2015","unstructured":"Azzouz, R., Bechikh, S., Said, L.B.: A dynamic multi-objective evolutionary algorithm using a change severity-based adaptive population management strategy. Soft Comput. 21(4), 885\u2013906 (2015). https:\/\/doi.org\/10.1007\/s00500-015-1820-4","journal-title":"Soft Comput."},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TEVC.2019.2925722","volume":"24","author":"L Cao","year":"2020","unstructured":"Cao, L., Xu, L., Goodman, E.D., Bao, C., Zhu, S.: Evolutionary dynamic multiobjective optimization assisted by a support vector regression predictor. IEEE Trans. Evol. Comput. 24(2), 305\u2013309 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR3","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"},{"key":"10_CR4","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. Wiley, New York (2001)"},{"issue":"2","key":"10_CR5","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."},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Deb, K., Rao N., U.B., Karthik, S.: Dynamic multi-objective optimization and decision-making using modified NSGA-II: a case study on hydro-thermal power scheduling. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 803\u2013817. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70928-2_60","DOI":"10.1007\/978-3-540-70928-2_60"},{"issue":"3","key":"10_CR7","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":"8","key":"10_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TEVC.2004.831456","volume":"5","author":"M Farina","year":"2004","unstructured":"Farina, M., Deb, K., Amato, P.: Dynamic multiobjective optimization problems: test cases, approximations, and applications. IEEE Trans. Evol. Comput. 5(8), 425\u2013442 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10_CR9","first-page":"103","volume":"13","author":"C Goh","year":"2008","unstructured":"Goh, C., Tan, K.C.: A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization. IEEE Trans. Evol. Comput. 13(1), 103\u2013127 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR10","unstructured":"Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the Second International Conference on Genetic Algorithms and Their Application, pp. 41\u201349 (1987)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Greeff, M., Engelbrecht, A.P.: Solving dynamic multi-objective problems with vector evaluated particle swarm optimisation. In: IEEE Congress on Evolutionary Computation, pp. 2917\u20132924 (2008)","DOI":"10.1109\/CEC.2008.4631190"},{"key":"10_CR12","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 the 24th European Conference on Artificial Intelligence (2020)"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A.: On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem - a comparative experiment. IEEE Trans. Evol. Comput. 6(4), 402\u2013412 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/TEVC.2016.2574621","volume":"21","author":"S Jiang","year":"2016","unstructured":"Jiang, S., Yang, S.: A steady-state and generational evolutionary algorithm for dynamic multiobjective optimization. IEEE Trans. Evol. Comput. 21(1), 65\u201382 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"11","key":"10_CR15","doi-asserted-by":"publisher","first-page":"3723","DOI":"10.1007\/s00500-018-3033-0","volume":"23","author":"Q Li","year":"2018","unstructured":"Li, Q., Zou, J., Yang, S., Zheng, J., Ruan, G.: A predictive strategy based on special points for evolutionary dynamic multi-objective optimization. Soft Comput. 23(11), 3723\u20133739 (2018). https:\/\/doi.org\/10.1007\/s00500-018-3033-0","journal-title":"Soft Comput."},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TEVC.2020.3008822","volume":"25","author":"Q Lin","year":"2021","unstructured":"Lin, Q., Lin, W., Zhu, Z., Gong, M., Li, J., 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":"10_CR17","doi-asserted-by":"crossref","unstructured":"Liu, Y., Ishibuchi, H., Nojima, Y., Masuyama, N., Shang, K.: A double-niched evolutionary algorithm and its behavior on polygon-based problems. In: Proceedings of the Parallel Problem Solving from Nature - PPSN XV, pp. 262\u2013273 (2018)","DOI":"10.1007\/978-3-319-99253-2_21"},{"issue":"4","key":"10_CR18","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TEVC.2018.2879406","volume":"23","author":"Y Liu","year":"2019","unstructured":"Liu, Y., Yen, G.G., Gong, D.: 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."},{"key":"10_CR19","unstructured":"Nguyen, T.T.: Continuous Dynamic Optimization Using Evolutionary Algorithms. Ph.D. thesis, The University of Birmingham (2010)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Peng, Y., Ishibuchi, H.: A decomposition-based multi-modal multi-objective optimization algorithm. In: Proceedings of the 2020 IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2020)","DOI":"10.1109\/CEC48606.2020.9185674"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Peng, Y., Ishibuchi, H., Shang, K.: Multi-modal multi-objective optimization: problem analysis and case studies. In: Proceedings of the IEEE Symposium Series on Computational Intelligence, pp. 1865\u20131872 (2019)","DOI":"10.1109\/SSCI44817.2019.9002937"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Petrowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 798\u2013803 (1996)","DOI":"10.1109\/ICEC.1996.542703"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Raquel, C., Yao, X.: Dynamic multi-objective optimization: a survey of the state-of-the-art. In: Evolutionary Computation for Dynamic Optimization Problems, pp. 85\u2013106. Springer, Heidelberg(2013). https:\/\/doi.org\/10.1007\/978-3-642-38416-5_4","DOI":"10.1007\/978-3-642-38416-5_4"},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2514\/1.46478","volume":"8","author":"O Sch\u00fctze","year":"2011","unstructured":"Sch\u00fctze, O., Vasile, M., Coello, C.A.C.: Computing the set of epsilon-efficient solutions in multiobjective space mission design. J. Aerosp. Comput. Inf. Commun. 8(3), 53\u201370 (2011)","journal-title":"J. Aerosp. Comput. Inf. Commun."},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Shir, O.M.: Niching in evolutionary algorithms. In: Handbook of Natural Computing, pp. 1035\u20131069. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-540-92910-9_32","DOI":"10.1007\/978-3-540-92910-9_32"},{"issue":"3","key":"10_CR26","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/TEVC.2020.3044711","volume":"25","author":"Y Tian","year":"2020","unstructured":"Tian, Y., Liu, R., Zhang, X., Ma, H., Tan, K.C., Jin, Y.: A multi-population evolutionary algorithm for solving large-scale multi-modal multi-objective optimization problems. IEEE Tran. Evol. Comput. 25(3), 405\u2013418 (2020)","journal-title":"IEEE Tran. Evol. Comput."},{"issue":"5","key":"10_CR27","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TEVC.2017.2754271","volume":"22","author":"C Yue","year":"2018","unstructured":"Yue, C., Qu, B., Liang, J.: A multiobjective particle swarm optimizer using ring topology for solving multimodal multiobjective problems. IEEE Trans. Evol. Comput. 22(5), 805\u2013817 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.swevo.2019.03.011","volume":"48","author":"C Yue","year":"2019","unstructured":"Yue, C., Qu, B., Yu, K., Liang, J., Li, X.: A novel scalable test problem suite for multimodal multiobjective optimization. Swarm Evol. Comput. 48, 62\u201371 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"10_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.107004","volume":"101","author":"K Zhang","year":"2021","unstructured":"Zhang, K., Chen, M., Xu, X., Yen, G.G.: Multi-objective evolution strategy for multi-modal multi-objective optimization. Appl. Soft Comput. 101, 107004 (2021)","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"10_CR30","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/TEVC.2009.2021467","volume":"13","author":"A Zhou","year":"2009","unstructured":"Zhou, A., Zhang, Q., Jin, Y.: 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."}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:48:23Z","timestamp":1710262103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_10","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":"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)"}}]}}