{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T07:14:36Z","timestamp":1782630876166,"version":"3.54.5"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"crossref","award":["BK20230419"],"award-info":[{"award-number":["BK20230419"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of the Jiangsu Higher Education Institutions of China","award":["23KJB520018"],"award-info":[{"award-number":["23KJB520018"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Evol. Learn. Optim."],"published-print":{"date-parts":[[2026,3,31]]},"abstract":"<jats:p>Dynamic Multimodal Optimization Problems (DMMOPs) demand algorithms capable of swiftly locating and tracking multiple optimal solutions over time. The primary challenge lies in controlling the population diversity to facilitate effective exploration, all within the limitation of computational resources between consecutive environmental changes. In this article, we study the utilization of density information derived from both current and historical populations to enhance exploration. First, for each active sub-population, we construct a density landscape based on the distribution of concurrently active sub-populations and establish dominance relationships between candidate solutions in the sub-population based on density and fitness values, directing this sub-population toward exploring low-density promising areas. Then, for each converged sub-population, we construct a density landscape based on the distribution of sub-populations that have historically become extinct, guiding the restart of this sub-population in low-density unexploited areas. Finally, we develop a comprehensive framework of Density-Assisted Evolutionary Algorithm (DAEA), which encompasses density-assisted search and restart, also combined with initialization. Moreover, we employ prediction and memory strategies to enhance the performance of DAEA in dynamic environments. Notably, the algorithm relies on an external monitor to detect environmental changes and trigger the dynamic response strategy. DAEA is tested on the CEC\u20192022 dynamic multimodal optimization benchmark suite and is compared against several state-of-the-art dynamic multimodal optimization algorithms. The experimental results demonstrate the competitiveness of DAEA in handling DMMOPs. Additionally, experimental results from the berth allocation problem further confirm the applicability of DAEA to real-world dynamic multimodal optimization tasks.<\/jats:p>","DOI":"10.1145\/3723171","type":"journal-article","created":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T11:54:28Z","timestamp":1741866868000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Density-Assisted Evolutionary Dynamic Multimodal Optimization"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1466-4927","authenticated-orcid":false,"given":"Ying","family":"Zhu","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Nanjing University of Information Science and Technology, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6627-2514","authenticated-orcid":false,"given":"Peilan","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Nanjing University of Information Science and Technology, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6341-7208","authenticated-orcid":false,"given":"Jiahao","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Nanjing University of Information Science and Technology, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3850-1059","authenticated-orcid":false,"given":"Xin","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Nanjing University of Information Science and Technology, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8357-1655","authenticated-orcid":false,"given":"Wenjian","family":"Luo","sequence":"additional","affiliation":[{"name":"Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies, School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,2,3]]},"reference":[{"issue":"3","key":"e_1_3_2_2_1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1162\/evco_a_00182","article-title":"Multimodal optimization by covariance matrix self-adaptation evolution strategy with repelling subpopulations","volume":"25","author":"Ahrari Ali","year":"2017","unstructured":"Ali Ahrari, Kalyanmoy Deb, and Mike Preuss. 2017. Multimodal optimization by covariance matrix self-adaptation evolution strategy with repelling subpopulations. Evolutionary Computation 25, 3 (2017), 439\u2013471.","journal-title":"Evolutionary Computation"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3051172"},{"issue":"3","key":"e_1_3_2_4_1","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1109\/TEVC.2021.3117116","article-title":"Static and dynamic multimodal optimization by improved covariance matrix self-adaptation evolution strategy with repelling subpopulations","volume":"26","author":"Ahrari Ali","year":"2022","unstructured":"Ali Ahrari, Saber Elsayed, Ruhul Sarker, Daryl Essam, and Carlos A. Coello Coello. 2022a. Static and dynamic multimodal optimization by improved covariance matrix self-adaptation evolution strategy with repelling subpopulations. IEEE Transactions on Evolutionary Computation 26, 3 (2022), 527\u2013541.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_3_2_5_1","unstructured":"Ali Ahrari Saber Elsayed Ruhul Sarker Daryl Essam and Carlos A. Coello Coelloc. 2022b. Benchmarking AMLP-RS-CMSA-ESII for the CEC\u20192022 Competition on Seeking Multiple Optima in Dynamic Environment. Technical Report. University of New South Wales."},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2567644"},{"key":"e_1_3_2_7_1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.ins.2018.04.056","article-title":"A neighbor-based learning particle swarm optimizer with short-term and long-term memory for dynamic optimization problems","volume":"453","author":"Cao Leilei","year":"2018","unstructured":"Leilei Cao, Lihong Xu, and Erik D. Goodman. 2018. A neighbor-based learning particle swarm optimizer with short-term and long-term memory for dynamic optimization problems. Information Sciences 453 (2018), 463\u2013485.","journal-title":"Information Sciences"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2322602"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2744328"},{"key":"e_1_3_2_10_1","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-981-13-2826-8_21","volume-title":"Proceedings of the 13th Bio-Inspired Computing: Theories and Applications","author":"Cheng Shi","year":"2018","unstructured":"Shi Cheng, Hui Lu, Wu Song, Junfeng Chen, and Yuhui Shi. 2018b. Dynamic multimodal optimization using brain storm optimization algorithms. In Proceedings of the 13th Bio-Inspired Computing: Theories and Applications. Springer, 236\u2013245."},{"key":"e_1_3_2_11_1","doi-asserted-by":"crossref","first-page":"107880","DOI":"10.1016\/j.asoc.2021.107880","article-title":"Evolutionary-mean shift algorithm for dynamic multimodal function optimization","volume":"113","author":"Cuevas Erik","year":"2021","unstructured":"Erik Cuevas, Jorge G\u00e1lvez, Miguel Toski, and Karla Avila. 2021. Evolutionary-mean shift algorithm for dynamic multimodal function optimization. Applied Soft Computing 113 (2021), 107880.","journal-title":"Applied Soft Computing"},{"issue":"2","key":"e_1_3_2_12_1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb Kalyanmoy","year":"2002","unstructured":"Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. A. M. T. Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 2 (2002), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"e_1_3_2_13_1","first-page":"1141","article-title":"Distributed knowledge transfer for evolutionary multitask multimodal optimization","volume":"28","author":"Gao Kailai","year":"2023","unstructured":"Kailai Gao, Cuie Yang, Jinliang Ding, Kay Chen Tan, and Tianyou Chai. 2023. Distributed knowledge transfer for evolutionary multitask multimodal optimization. IEEE Transactions on Evolutionary Computation 28, 4 (2023), 1141\u20131155.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"e_1_3_2_14_1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1162\/106365601750190398","article-title":"Completely derandomized self-adaptation in evolution strategies","volume":"9","author":"Hansen Nikolaus","year":"2001","unstructured":"Nikolaus Hansen and Andreas Ostermeier. 2001. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation 9, 2 (2001), 159\u2013195.","journal-title":"Evolutionary Computation"},{"issue":"8","key":"e_1_3_2_15_1","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","article-title":"Long short-term memory","volume":"9","author":"Hochreiter Sepp","year":"1997","unstructured":"Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural Computation 9, 8 (1997), 1735\u20131780.","journal-title":"Neural Computation"},{"issue":"10","key":"e_1_3_2_16_1","doi-asserted-by":"crossref","first-page":"4225","DOI":"10.1109\/TITS.2019.2939224","article-title":"Automatic planning of multiple itineraries: A niching genetic evolution approach","volume":"21","author":"Huang Ting","year":"2020","unstructured":"Ting Huang, Yue-Jiao Gong, Yu-Hui Zhang, Zhi-Hui Zhan, and Jun Zhang. 2020. Automatic planning of multiple itineraries: A niching genetic evolution approach. IEEE Transactions on Intelligent Transportation Systems 21, 10 (2020), 4225\u20134240.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"1","key":"e_1_3_2_17_1","first-page":"459","article-title":"An enhanced NSGA-II for solving berth allocation and quay crane assignment problem with stochastic arrival times","volume":"24","author":"Ji Bin","year":"2022","unstructured":"Bin Ji, Han Huang, and S. Yu Samson. 2022. An enhanced NSGA-II for solving berth allocation and quay crane assignment problem with stochastic arrival times. IEEE Transactions on Intelligent Transportation Systems 24, 1 (2022), 459\u2013473.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"9","key":"e_1_3_2_18_1","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1109\/TCYB.2017.2669334","article-title":"Modified NSGA-II for solving continuous berth allocation problem: Using multiobjective constraint-handling strategy","volume":"47","author":"Ji Bin","year":"2017","unstructured":"Bin Ji, Xiaohui Yuan, and Yanbin Yuan. 2017. Modified NSGA-II for solving continuous berth allocation problem: Using multiobjective constraint-handling strategy. IEEE Transactions on Cybernetics 47, 9 (2017), 2885\u20132895.","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"4","key":"e_1_3_2_19_1","doi-asserted-by":"crossref","first-page":"2544","DOI":"10.1109\/TCYB.2021.3125362","article-title":"Optimizing niche center for multimodal optimization problems","volume":"53","author":"Jiang Yi","year":"2023","unstructured":"Yi Jiang, Zhi-Hui Zhan, Kay Chen Tan, and Jun Zhang. 2023. Optimizing niche center for multimodal optimization problems. IEEE Transactions on Cybernetics 53, 4 (2023), 2544\u20132557.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101649"},{"issue":"3","key":"e_1_3_2_21_1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/09540091.2019.1700912","article-title":"A note on the exclusion operator in multi-swarm PSO algorithms for dynamic environments","volume":"32","author":"Kazemi Kordestani Javidan","year":"2020","unstructured":"Javidan Kazemi Kordestani, Mohammad Reza Meybodi, and Amir Masoud Rahmani. 2020. A note on the exclusion operator in multi-swarm PSO algorithms for dynamic environments. Connection Science 32, 3 (2020), 239\u2013263.","journal-title":"Connection Science"},{"key":"e_1_3_2_22_1","unstructured":"Xiaodong Li Andries Engelbrecht and Michael G. Epitropakis. 2013. Benchmark Functions for CEC\u20192013 Special Session and Competition on Niching Methods for Multimodal Function Optimization. Technical Report. RMIT University Evolutionary Computation and Machine Learning Group Australia."},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2638437"},{"key":"e_1_3_2_24_1","first-page":"121254","article-title":"A fast density peak clustering based particle swarm optimizer for dynamic optimization","volume":"236","author":"Li Fei","year":"2023","unstructured":"Fei Li, Qiang Yue, Yuanchao Liu, Haibin Ouyang, and Fangqing Gu. 2023. A fast density peak clustering based particle swarm optimizer for dynamic optimization. Expert Systems with Applications 236 (2023), 121254.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101184"},{"issue":"2","key":"e_1_3_2_26_1","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1109\/TCYB.2019.2907657","article-title":"Differential evolution for multimodal optimization with species by nearest-better clustering","volume":"51","author":"Lin Xin","year":"2021","unstructured":"Xin Lin, Wenjian Luo, and Peilan Xu. 2021. Differential evolution for multimodal optimization with species by nearest-better clustering. IEEE Transactions on Cybernetics 51, 2 (2021), 970\u2013983.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.101011"},{"issue":"5","key":"e_1_3_2_28_1","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1109\/TNNLS.2019.2920887","article-title":"Neural Network-Based information transfer for dynamic optimization","volume":"31","author":"Liu Xiao-Fang","year":"2020","unstructured":"Xiao-Fang Liu, Zhi-Hui Zhan, Tian-Long Gu, Sam Kwong, Zhenyu Lu, Henry Been-Lirn Duh, and Jun Zhang. 2020. Neural Network-Based information transfer for dynamic optimization. IEEE Transactions on Neural Networks and Learning Systems 31, 5 (2020), 1557\u20131570.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"e_1_3_2_29_1","doi-asserted-by":"crossref","first-page":"72649","DOI":"10.1109\/ACCESS.2018.2881538","article-title":"Neural network for change direction prediction in dynamic optimization","volume":"6","author":"Liu Xiao-Fang","year":"2018","unstructured":"Xiao-Fang Liu, Zhi-Hui Zhan, and Jun Zhang. 2018. Neural network for change direction prediction in dynamic optimization. IEEE Access 6 (2018), 72649\u201372662.","journal-title":"IEEE Access"},{"key":"e_1_3_2_30_1","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/CEC.2007.4424520","volume-title":"Proceedings of the 2007 IEEE Congress on Evolutionary Computation","author":"Lung Rodica Ioana","year":"2007","unstructured":"Rodica Ioana Lung and Dumitru Dumitrescu. 2007. A collaborative model for tracking optima in dynamic environments. In Proceedings of the 2007 IEEE Congress on Evolutionary Computation. IEEE, 564\u2013567."},{"key":"e_1_3_2_31_1","unstructured":"Wenjian Luo Xin Lin Changhe Li Shengxiang Yang and Yuhui Shi. 2022a. Benchmark functions for CEC 2022 competition on seeking multiple optima in dynamic environments. arXiv:2201.00523. Retrieved from https:\/\/arxiv.org\/abs\/2201.00523"},{"key":"e_1_3_2_32_1","doi-asserted-by":"crossref","first-page":"100459","DOI":"10.1016\/j.swevo.2018.10.010","article-title":"A clonal selection algorithm for dynamic multimodal function optimization","volume":"50","author":"Luo Wenjian","year":"2019","unstructured":"Wenjian Luo, Xin Lin, Tao Zhu, and Peilan Xu. 2019. A clonal selection algorithm for dynamic multimodal function optimization. Swarm and Evolutionary Computation 50 (2019), 100459.","journal-title":"Swarm and Evolutionary Computation"},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3032995"},{"key":"e_1_3_2_34_1","first-page":"27","volume-title":"Parallel Problem Solving From Nature","author":"Mahfoud Samir W.","year":"1992","unstructured":"Samir W. Mahfoud. 1992. Crowding and preselection revisited. In Parallel Problem Solving From Nature. Elsevier, 27\u201336."},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106672"},{"key":"e_1_3_2_36_1","unstructured":"S. C. Maree Tanja Alderliesten Dirk Thierens and Peter A. N. Bosman. 2018. Benchmarking the hill-valley evolutionary algorithm for the GECCO 2018 competition on niching methods multimodal optimization. arXiv:1807.00188. Retrieved from https:\/\/arxiv.org\/abs\/1807.00188."},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-2133-1_2"},{"key":"e_1_3_2_38_1","doi-asserted-by":"crossref","first-page":"2047","DOI":"10.1109\/CEC.1999.785526","volume-title":"Proceedings of the 1999 3rd Congress on Evolutionary Computation-cec99 (Cat. no. 99th8406)","author":"Morrison Ronald W.","year":"1999","unstructured":"Ronald W. Morrison and Kenneth A. De Jong. 1999. A test problem generator for non-stationary environments. In Proceedings of the 1999 3rd Congress on Evolutionary Computation-cec99 (Cat. no. 99th8406). IEEE, 2047\u20132053."},{"key":"e_1_3_2_39_1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-73922-7_2","volume-title":"Proceedings of the International Conference on Artificial Immune Systems","author":"Nanas Nikolaos","year":"2007","unstructured":"Nikolaos Nanas and Anne De Roeck. 2007. Multimodal dynamic optimization: From evolutionary algorithms to artificial immune systems. In Proceedings of the International Conference on Artificial Immune Systems. Springer, 13\u201324."},{"key":"e_1_3_2_40_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","article-title":"Evolutionary dynamic optimization: A survey of the state of the art","volume":"6","author":"Nguyen Trung Thanh","year":"2012","unstructured":"Trung Thanh Nguyen, Shengxiang Yang, and Juergen Branke. 2012. Evolutionary dynamic optimization: A survey of the state of the art. Swarm and Evolutionary Computation 6 (2012), 1\u201324.","journal-title":"Swarm and Evolutionary Computation"},{"issue":"5","key":"e_1_3_2_41_1","doi-asserted-by":"crossref","first-page":"1879","DOI":"10.1007\/s00500-015-1610-z","article-title":"Taking advantage of solving the resource constrained multi-project scheduling problems using multi-modal genetic algorithms","volume":"20","author":"P\u00e9rez Elena","year":"2016","unstructured":"Elena P\u00e9rez, Marta Posada, and Antolin Lorenzana. 2016. Taking advantage of solving the resource constrained multi-project scheduling problems using multi-modal genetic algorithms. Soft Computing 20, 5 (2016), 1879\u20131896.","journal-title":"Soft Computing"},{"key":"e_1_3_2_42_1","first-page":"798","volume-title":"Proceedings of the IEEE International Conference on Evolutionary Computation","author":"P\u00e9trowski Alain","year":"1996","unstructured":"Alain P\u00e9trowski. 1996. A clearing procedure as a niching method for genetic algorithms. In Proceedings of the IEEE International Conference on Evolutionary Computation. IEEE, 798\u2013803."},{"key":"e_1_3_2_43_1","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1145\/1830761.1830793","volume-title":"Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation","author":"Preuss Mike","year":"2010","unstructured":"Mike Preuss. 2010. Niching the CMA-ES via nearest-better clustering. In Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation, 1711\u20131718."},{"issue":"13","key":"e_1_3_2_44_1","doi-asserted-by":"crossref","first-page":"10560","DOI":"10.3390\/su151310560","article-title":"Two-stage robust programming modeling for continuous berth allocation with uncertain vessel arrival time","volume":"15","author":"Qu Shaojian","year":"2023","unstructured":"Shaojian Qu, Xinqi Li, Chang Liu, Xufeng Tang, Zhisheng Peng, and Ying Ji. 2023. Two-stage robust programming modeling for continuous berth allocation with uncertain vessel arrival time. Sustainability 15, 13 (2023), 10560.","journal-title":"Sustainability"},{"key":"e_1_3_2_45_1","doi-asserted-by":"crossref","first-page":"106009","DOI":"10.1016\/j.asoc.2019.106009","article-title":"A multi-population differential evolution algorithm based on cellular learning automata and evolutionary context information for optimization in dynamic environments","volume":"88","author":"Vafashoar Reza","year":"2020","unstructured":"Reza Vafashoar and Mohammad Reza Meybodi. 2020. A multi-population differential evolution algorithm based on cellular learning automata and evolutionary context information for optimization in dynamic environments. Applied Soft Computing 88 (2020), 106009.","journal-title":"Applied Soft Computing"},{"key":"e_1_3_2_46_1","doi-asserted-by":"crossref","DOI":"10.1201\/b14876","volume-title":"Kernel Smoothing","author":"Wand Matt P.","year":"1994","unstructured":"Matt P. Wand and M. Chris Jones. 1994. Kernel Smoothing. CRC Press."},{"issue":"4","key":"e_1_3_2_47_1","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1109\/TCYB.2014.2337117","article-title":"MOMMOP: Multiobjective optimization for locating multiple optimal solutions of multimodal optimization problems","volume":"45","author":"Wang Yong","year":"2015","unstructured":"Yong Wang, Han-Xiong Li, Gary G. Yen, and Wu Song. 2015. MOMMOP: Multiobjective optimization for locating multiple optimal solutions of multimodal optimization problems. IEEE Transactions on Cybernetics 45, 4 (2015), 830\u2013843. DOI: https:\/\/doi.org\/10.1109\/TCYB.2014.2337117","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"5","key":"e_1_3_2_48_1","doi-asserted-by":"crossref","first-page":"2880","DOI":"10.1109\/TCYB.2023.3234077","article-title":"A condition knowledge representation and feedback learning framework for dynamic optimization of integrated energy systems","volume":"54","author":"Wang Tianyu","year":"2023","unstructured":"Tianyu Wang, Jun Zhao, Henry Leung, and Wei Wang. 2023. A condition knowledge representation and feedback learning framework for dynamic optimization of integrated energy systems. IEEE Transactions on Cybernetics 54, 5 (2023), 2880\u20132890.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_3_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3117359"},{"key":"e_1_3_2_50_1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/1830483.1830513","volume-title":"Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation","author":"Wong Ka-Chun","year":"2010","unstructured":"Ka-Chun Wong, Kwong-Sak Leung, and Man-Hon Wong. 2010. Protein structure prediction on a lattice model via multimodal optimization techniques. In Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, 155\u2013162."},{"key":"e_1_3_2_51_1","doi-asserted-by":"crossref","first-page":"106039","DOI":"10.1016\/j.engappai.2023.106039","article-title":"A kriging model-based evolutionary algorithm with support vector machine for dynamic multimodal optimization","volume":"122","author":"Wu Xunfeng","year":"2023","unstructured":"Xunfeng Wu, Qiuzhen Lin, Wu Lin, Yulong Ye, Qingling Zhu, and Victor C. M. Leung. 2023. A kriging model-based evolutionary algorithm with support vector machine for dynamic multimodal optimization. Engineering Applications of Artificial Intelligence 122 (2023), 106039.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"e_1_3_2_52_1","doi-asserted-by":"crossref","first-page":"118571","DOI":"10.1016\/j.eswa.2022.118571","article-title":"An adaptive neighborhood-based speciation differential evolution for multimodal optimization","volume":"211","author":"Xiong Shijie","year":"2023","unstructured":"Shijie Xiong, Wenyin Gong, and Kai Wang. 2023. An adaptive neighborhood-based speciation differential evolution for multimodal optimization. Expert Systems with Applications 211 (2023), 118571.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469036"},{"key":"e_1_3_2_54_1","first-page":"46","volume-title":"Proceedings of the 15th International Conference on Bio-Inspired Computing: Theories and Applications","author":"Xu Peilan","year":"2021","unstructured":"Peilan Xu, Wenjian Luo, Jiafei Xu, Yingying Qiao, and Jiajia Zhang. 2021b. Density-based population initialization strategy for continuous optimization. In Proceedings of the 15th International Conference on Bio-Inspired Computing: Theories and Applications. Springer, 46\u201359."},{"key":"e_1_3_2_55_1","doi-asserted-by":"crossref","first-page":"100971","DOI":"10.1016\/j.swevo.2021.100971","article-title":"An alternative way of evolutionary multimodal optimization: Density-based population initialization strategy","volume":"67","author":"Xu Peilan","year":"2021","unstructured":"Peilan Xu, Wenjian Luo, Jiafei Xu, Yingying Qiao, Jiajia Zhang, and Naijie Gu. 2021c. An alternative way of evolutionary multimodal optimization: Density-based population initialization strategy. Swarm and Evolutionary Computation 67 (2021), 100971.","journal-title":"Swarm and Evolutionary Computation"},{"key":"e_1_3_2_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3277501"},{"key":"e_1_3_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3060014"},{"key":"e_1_3_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2902626"},{"issue":"5","key":"e_1_3_2_59_1","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/TEVC.2023.3306017","article-title":"Robust optimization over time: A critical review","volume":"28","author":"Yazdani Danial","year":"2023","unstructured":"Danial Yazdani, Mohammad Nabi Omidvar, Donya Yazdani, J\u00fcrgen Branke, Trung Thanh Nguyen, Amir H. Gandomi, Yaochu Jin, and Xin Yao. 2023a. Robust optimization over time: A critical review. IEEE Transactions on Evolutionary Computation 28, 5 (2023), 1265\u20131285.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"e_1_3_2_60_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3604812","article-title":"A species-based particle swarm optimization with adaptive population size and deactivation of species for dynamic optimization problems","volume":"3","author":"Yazdani Delaram","year":"2023","unstructured":"Delaram Yazdani, Danial Yazdani, Donya Yazdani, Mohammad Nabi Omidvar, Amir H. Gandomi, and Xin Yao. 2023b. A species-based particle swarm optimization with adaptive population size and deactivation of species for dynamic optimization problems. ACM Transactions on Evolutionary Learning and Optimization 3, 4 (2023), 1\u201325.","journal-title":"ACM Transactions on Evolutionary Learning and Optimization"},{"key":"e_1_3_2_61_1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ins.2023.02.049","article-title":"Neighborhood evolutionary sampling with dynamic repulsion for expensive multimodal optimization","volume":"630","author":"Zhen Huixiang","year":"2023","unstructured":"Huixiang Zhen, Shijie Xiong, Wenyin Gong, and Ling Wang. 2023. Neighborhood evolutionary sampling with dynamic repulsion for expensive multimodal optimization. Information Sciences 630 (2023), 82\u201397.","journal-title":"Information Sciences"},{"key":"e_1_3_2_62_1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.trb.2015.10.008","article-title":"Modeling and optimization of multimodal urban networks with limited parking and dynamic pricing","volume":"83","author":"Zheng Nan","year":"2016","unstructured":"Nan Zheng and Nikolas Geroliminis. 2016. Modeling and optimization of multimodal urban networks with limited parking and dynamic pricing. Transportation Research Part B: Methodological 83 (2016), 36\u201358.","journal-title":"Transportation Research Part B: Methodological"},{"key":"e_1_3_2_63_1","doi-asserted-by":"crossref","unstructured":"Yanghe Zou Peilan Xu Hao Dai Heng Song and Wenjian Luo. 2024. Swarm optimization with intra-and inter-hierarchical competition for large-scale berth allocation and crane assignment. TechRxiv.","DOI":"10.36227\/techrxiv.172297384.42385800\/v1"}],"container-title":["ACM Transactions on Evolutionary Learning and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3723171","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T13:35:52Z","timestamp":1770125752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3723171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,3]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1145\/3723171"],"URL":"https:\/\/doi.org\/10.1145\/3723171","relation":{},"ISSN":["2688-299X","2688-3007"],"issn-type":[{"value":"2688-299X","type":"print"},{"value":"2688-3007","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,3]]},"assertion":[{"value":"2024-04-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-05","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}