{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T11:37:00Z","timestamp":1778326620306,"version":"3.51.4"},"reference-count":81,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"content-version":"vor","delay-in-days":302,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106046"],"award-info":[{"award-number":["62106046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106055"],"award-info":[{"award-number":["62106055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2019A1515110474"],"award-info":[{"award-number":["2019A1515110474"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022A1515011825"],"award-info":[{"award-number":["2022A1515011825"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2018AAA0101301"],"award-info":[{"award-number":["2018AAA0101301"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004000","name":"Guangzhou Municipal Science and Technology Program key projects","doi-asserted-by":"publisher","award":["2023A04J0388"],"award-info":[{"award-number":["2023A04J0388"]}],"id":[{"id":"10.13039\/501100004000","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004000","name":"Guangzhou Municipal Science and Technology Program key projects","doi-asserted-by":"publisher","award":["2023A03J0662"],"award-info":[{"award-number":["2023A03J0662"]}],"id":[{"id":"10.13039\/501100004000","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Intelligent Systems"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:p>Multimodal optimization aims at efficiently finding multiple optimal solutions of a problem. Owing to the population\u2010based search mechanism, evolutionary algorithms (EAs) are becoming increasingly popular in solving multimodal optimization problems (MOPs). Most existing work focuses on designing and incorporating niching techniques into EAs so that multiple subpopulations can be formed and assigned to locate different optima. To further enhance the exploration and exploitation abilities of existing EAs, this paper developed a multimodal level\u2010based learning strategy. The basic idea is that individuals should be treated differently according to their positions in the subpopulation. In the evolutionary process, a subpopulation is formed for each candidate solution by grouping its neighboring solutions. Then, individuals in the subpopulation are sorted according to their fitness. Subsequently, the multimodal level\u2010based learning strategy applies different mutation operators to different individuals according to their rankings. Experiments are conducted on a set of benchmark problems to verify the efficacy of the multimodal level\u2010based learning strategy. The results show that the proposed learning strategy can significantly enhance the performance of the existing algorithm. In addition, the algorithm integrated with the proposed strategy is applied to the task of finding multiple roots of nonlinear equation systems (NESs). The results indicate that with the support of the proposed learning strategy, the integrated algorithm compares favorably with state\u2010of\u2010the\u2010art root finding algorithms.<\/jats:p>","DOI":"10.1155\/2023\/3961336","type":"journal-article","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T20:35:12Z","timestamp":1698698112000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Differential Evolution with a Level\u2010Based Learning Strategy for Multimodal Optimization"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5769-3456","authenticated-orcid":false,"given":"Yuhui","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0881-459X","authenticated-orcid":false,"given":"Wenhong","family":"Wei","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4211-6197","authenticated-orcid":false,"given":"Tiezhu","family":"Zhao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2594-0934","authenticated-orcid":false,"given":"Zijia","family":"Wang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2023,10,30]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/3469678.3469714"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364920918296"},{"key":"e_1_2_9_3_2","doi-asserted-by":"crossref","unstructured":"Pr\u00f6hlL.andAschemannH. Multimodal optimization for the trajectory planning of railway vehicles Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC) July 2020 Glasgow UK.","DOI":"10.1109\/CEC48606.2020.9185655"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113233"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-019-2882-0"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116499"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108431"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2021.126480"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.05.018"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.3390\/math10030300"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.05.005"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2016.2638437"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2014.2313659"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-03003-z"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-05708-1"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02803-7"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116298"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-05425-2"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1331058"},{"key":"e_1_2_9_20_2","volume-title":"Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms","author":"Goldberg D. E.","year":"1987"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760234081"},{"key":"e_1_2_9_22_2","doi-asserted-by":"crossref","unstructured":"P\u00e9trowskiA. A clearing procedure as a niching method for genetic algorithms Proceedings of the IEEE International Conference on Evolutionary Computation May 1996 Nagoya Japan IEEE 798\u2013803.","DOI":"10.1109\/ICEC.1996.542703"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2011.2161873"},{"key":"e_1_2_9_24_2","doi-asserted-by":"crossref","unstructured":"EpitropakisM. G. PlagianakosV. P. andVrahatisM. N. Finding multiple global optima exploiting differential evolution\u2019s niching capability Proceedings of the 2011 IEEE Symposium on Differential Evolution (SDE) April 2011 Paris France IEEE.","DOI":"10.1109\/SDE.2011.5952058"},{"key":"e_1_2_9_25_2","doi-asserted-by":"crossref","unstructured":"EpitropakisM. G. LiX. andBurkeE. K. A dynamic archive niching differential evolution algorithm for multimodal optimization Proceedings of the 2013 IEEE Congress on Evolutionary Computation June 2013 Cancun Mexico IEEE.","DOI":"10.1109\/CEC.2013.6557556"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2013.2292971"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2013.2282491"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.09.008"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2019.2907657"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.04.093"},{"key":"e_1_2_9_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2019.2910721"},{"key":"e_1_2_9_32_2","first-page":"150","article-title":"Niching without niching parameters: particle swarm optimization using a ring topology","volume":"14","author":"Li X.","year":"2009","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_2_9_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2012.2203138"},{"key":"e_1_2_9_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-019-05414-7"},{"key":"e_1_2_9_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06355-2"},{"key":"e_1_2_9_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.01.049"},{"key":"e_1_2_9_37_2","doi-asserted-by":"publisher","DOI":"10.4018\/joeuc.302661"},{"key":"e_1_2_9_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100827"},{"key":"e_1_2_9_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2020.2972907"},{"key":"e_1_2_9_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2019.2927780"},{"key":"e_1_2_9_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2019.2944180"},{"key":"e_1_2_9_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-021-00338-5"},{"key":"e_1_2_9_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-79553-5_7"},{"key":"e_1_2_9_44_2","doi-asserted-by":"publisher","DOI":"10.3390\/app11114795"},{"key":"e_1_2_9_45_2","doi-asserted-by":"crossref","unstructured":"XiaH. LiC. ZengS. TanQ. WangJ. andYangS. A reinforcement-learning-based evolutionary algorithm using solution space clustering for multimodal optimization problems Proceedings of the 2021 IEEE Congress on Evolutionary Computation (CEC) July 2021 Krak\u00f3w Poland 1938\u20131945.","DOI":"10.1109\/CEC45853.2021.9504896"},{"key":"e_1_2_9_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2012.2231685"},{"key":"e_1_2_9_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2337117"},{"key":"e_1_2_9_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2017.2743016"},{"key":"e_1_2_9_49_2","article-title":"Differentiation in teaching and learning: principles and practice","volume":"16","author":"Harty J.","year":"2002","journal-title":"Reaching Out: Journal of Inclusive Education in Ireland"},{"key":"e_1_2_9_50_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511667190"},{"key":"e_1_2_9_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2322602"},{"key":"e_1_2_9_52_2","volume-title":"Benchmark Functions for CEC\u20192013 Special Session and Competition on Niching Methods for Multimodal Function Optimization","author":"Li X.","year":"2013"},{"key":"e_1_2_9_53_2","first-page":"166","article-title":"Introduction to selection","volume":"1","author":"Deb K.","year":"2000","journal-title":"Evolutionary Computation"},{"key":"e_1_2_9_54_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105169"},{"key":"e_1_2_9_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02629-3"},{"key":"e_1_2_9_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.105501"},{"key":"e_1_2_9_57_2","first-page":"1","article-title":"A review of population-based meta-heuristic algorithms","volume":"5","author":"Beheshti Z.","year":"2013","journal-title":"International Journal of Advances in Soft Computing and Its Applications"},{"key":"e_1_2_9_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106040"},{"key":"e_1_2_9_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3009966"},{"key":"e_1_2_9_60_2","doi-asserted-by":"publisher","DOI":"10.18178\/ijmlc.2017.7.1.611"},{"key":"e_1_2_9_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103479"},{"key":"e_1_2_9_62_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-022-09849-x"},{"key":"e_1_2_9_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/ci-m.2006.248054"},{"key":"e_1_2_9_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-012-9328-0"},{"key":"e_1_2_9_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.10.004"},{"key":"e_1_2_9_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2012.2189404"},{"key":"e_1_2_9_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.05.019"},{"key":"e_1_2_9_68_2","unstructured":"KononovaA. V. VermettenD. CaraffiniF. MitranM.-A. andZaharieD. The importance of being constrained: dealing with infeasible solutions in differential evolution and beyond 2023 https:\/\/arxiv.org\/abs\/2203.03512."},{"key":"e_1_2_9_69_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106121"},{"key":"e_1_2_9_70_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"e_1_2_9_71_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-008-0323-y"},{"key":"e_1_2_9_72_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107325"},{"key":"e_1_2_9_73_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2022.3153964"},{"key":"e_1_2_9_74_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0098-1354(99)80231-2"},{"key":"e_1_2_9_75_2","doi-asserted-by":"publisher","DOI":"10.1007\/pl00008283"},{"key":"e_1_2_9_76_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2010.09.010"},{"key":"e_1_2_9_77_2","doi-asserted-by":"crossref","unstructured":"GrosanC.andAbrahamA. A new approach for solving nonlinear equations systems 2008 38 no. 3 698\u2013714 https:\/\/doi.org\/10.1109\/tsmca.2008.918599 2-s2.0-43249120401.","DOI":"10.1109\/TSMCA.2008.918599"},{"key":"e_1_2_9_78_2","doi-asserted-by":"publisher","DOI":"10.1109\/tsmc.2018.2828018"},{"key":"e_1_2_9_79_2","doi-asserted-by":"publisher","DOI":"10.1109\/tsmc.2018.2852798"},{"key":"e_1_2_9_80_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2336865"},{"key":"e_1_2_9_81_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2017.2670779"}],"container-title":["International Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijis\/2023\/3961336.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijis\/2023\/3961336.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2023\/3961336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T05:24:11Z","timestamp":1735622651000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2023\/3961336"}},"subtitle":[],"editor":[{"given":"Fabio","family":"Caraffini","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":81,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["10.1155\/2023\/3961336"],"URL":"https:\/\/doi.org\/10.1155\/2023\/3961336","archive":["Portico"],"relation":{},"ISSN":["0884-8173","1098-111X"],"issn-type":[{"value":"0884-8173","type":"print"},{"value":"1098-111X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"2023-05-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"3961336"}}