{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T19:34:48Z","timestamp":1768678488512,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876110"],"award-info":[{"award-number":["61876110"]}],"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":["61806130"],"award-info":[{"award-number":["61806130"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Joint Funds of the NSFC under Key Program","award":["U1713212"],"award-info":[{"award-number":["U1713212"]}]},{"name":"the Shenzhen Scientific Research and Development Funding Program","award":["JCYJ20190808164211203"],"award-info":[{"award-number":["JCYJ20190808164211203"]}]},{"name":"the Guangdong \u201cPearl River Talent Recruitment Program\u201d","award":["2019ZT08X603"],"award-info":[{"award-number":["2019ZT08X603"]}]},{"DOI":"10.13039\/501100010877","name":"Shenzhen Science and Technology Innovation Commission","doi-asserted-by":"crossref","award":["R2020A045"],"award-info":[{"award-number":["R2020A045"]}],"id":[{"id":"10.13039\/501100010877","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s12293-022-00353-0","type":"journal-article","created":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T19:59:49Z","timestamp":1642795189000},"page":"31-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A novel multimodal multiobjective memetic algorithm with a local detection mechanism and a clustering-based selection strategy"],"prefix":"10.1007","volume":"15","author":[{"given":"Naili","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulong","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2579-3476","authenticated-orcid":false,"given":"Wu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2415-0401","authenticated-orcid":false,"given":"Qiuzhen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3529-2640","authenticated-orcid":false,"given":"Victor C. M.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,21]]},"reference":[{"issue":"2018","key":"353_CR1","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 (2019) A novel scalable test problem suite for multimodal multiobjective optimization. Swarm Evol Comput 48(2018):62\u201371. https:\/\/doi.org\/10.1016\/j.swevo.2019.03.011","journal-title":"Swarm Evol Comput"},{"key":"353_CR2","doi-asserted-by":"publisher","unstructured":"Ishibuchi H, Peng Y, and Shang K (2019) A scalable multimodal multiobjective test problem. In: 2019 IEEE Congress on Evolutionary Computation (CEC) 2019 (pp 310-317) https:\/\/doi.org\/10.1109\/CEC.2019.8789971","DOI":"10.1109\/CEC.2019.8789971"},{"key":"353_CR3","doi-asserted-by":"publisher","unstructured":"Liang JJ et al. (2019) Problem definitions and evaluation criteria for the CEC 2019 special session on multimodal multiobjective optimization J. Sch Electr Eng Zhengzhou Univ Zhengzhou China, https:\/\/doi.org\/10.13140\/RG.2.2.31746.02247.","DOI":"10.13140\/RG.2.2.31746.02247"},{"key":"353_CR4","doi-asserted-by":"publisher","unstructured":"Grimme C, Kerschke P, and Trautmann H (2019) Multimodality in multi-objective optimization \u2013 More boon than bane? Lect Notes Comput Sci (Including Subser Lect Notes Artif Intell Lect Notes Bioinformatics), vol. 11411 LNCS, pp 126\u2013138, https:\/\/doi.org\/10.1007\/978-3-030-12598-1_11.","DOI":"10.1007\/978-3-030-12598-1_11"},{"issue":"5","key":"353_CR5","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 (2018) A multiobjective particle swarm optimizer using ring topology for solving multimodal multiobjective problems. IEEE Trans Evol Comput 22(5):805\u2013817. https:\/\/doi.org\/10.1109\/TEVC.2017.2754271","journal-title":"IEEE Trans Evol Comput"},{"key":"353_CR6","doi-asserted-by":"crossref","unstructured":"Liang J, Guo Q, Yue C, and Qu B (2018) A self-organizing multi-objective particle swarm optimization algorithm for multimodal multi-objective problems chapter (vol. 10941). Springer International Publishing, Cham","DOI":"10.1007\/978-3-319-93815-8_52"},{"key":"353_CR7","doi-asserted-by":"publisher","unstructured":"Liu Y, Ishibuchi H, Nojima Y, Masuyama Y, and Shang K (2018) Multimodal multi-objective optimization: a preliminary study. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (vol. 11101) LNCS. pp 262\u2013273, https:\/\/doi.org\/10.1007\/978-3-319-99253-2_21.","DOI":"10.1007\/978-3-319-99253-2_21"},{"key":"353_CR8","doi-asserted-by":"crossref","unstructured":"Liu Y, Ishibuchi H, Y. N. B, and Masuyama N (2018) A double-niched evolutionary algorithm and its behavior on polygon-based problems, (vol 1). Springer International Publishing, Belrin","DOI":"10.1007\/978-3-319-99253-2_21"},{"key":"353_CR9","unstructured":"Tanabe R, Ishibuchi, H and Optimization MM (2020) A decomposition-based evolutionary algorithm for multi-modal multi-objective optimization. Int Conf parallel Probl solving from Nat"},{"issue":"2018","key":"353_CR10","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.swevo.2018.10.016","volume":"44","author":"J Liang","year":"2019","unstructured":"Liang J et al (2019) Multimodal multiobjective optimization with differential evolution. Swarm Evol Comput 44(2018):1028\u20131059. https:\/\/doi.org\/10.1016\/j.swevo.2018.10.016","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"353_CR11","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TEVC.2018.2879406","volume":"23","author":"Y Liu","year":"2019","unstructured":"Liu Y, Yen GG, Gong D (2019) A Multimodal multiobjective evolutionary algorithm using two-archive and recombination strategies. IEEE Trans Evol Comput 23(4):660\u2013674. https:\/\/doi.org\/10.1109\/TEVC.2018.2879406","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"353_CR12","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1109\/TEVC.2021.3064508","volume":"25","author":"K Zhang","year":"2021","unstructured":"Zhang K, Shen C, Yen GG, Xu Z, He J (2021) Two-stage double niched evolution strategy for multimodal multi-objective optimization. IEEE Trans Evol Comput 25(4):754\u2013768. https:\/\/doi.org\/10.1109\/TEVC.2021.3064508","journal-title":"IEEE Trans Evol Comput"},{"key":"353_CR13","doi-asserted-by":"crossref","unstructured":"Aarts E and Korst J (1987) Simulated annealing. Simulated Annealing Theory Appl, 7","DOI":"10.1007\/978-94-015-7744-1_2"},{"issue":"1","key":"353_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s12293-021-00325-w","volume":"13","author":"Q Yang","year":"2021","unstructured":"Yang Q, Wang Z, Luo J, He Q (2021) Balancing performance between the decision space and the objective space in multimodal multiobjective optimization. Memetic Comput 13(1):31\u201347. https:\/\/doi.org\/10.1007\/s12293-021-00325-w","journal-title":"Memetic Comput"},{"issue":"2","key":"353_CR15","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 (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"353_CR16","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 (2007) MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"353_CR17","first-page":"1","volume":"10","author":"J Digalakis","year":"2004","unstructured":"Digalakis J, Margaritis K (2004) Performance comparison of memetic algorithms. Complex Int 10:1\u201315","journal-title":"Complex Int"},{"issue":"2","key":"353_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TEVC.2010.2051446","volume":"15","author":"Yi Mei","year":"2011","unstructured":"Mei Yi, Tang Ke, Yao X (2011) Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem. IEEE Trans Evol Comput 15(2):151\u2013165","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"353_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s12293-021-00334-9","volume":"13","author":"S Xiang","year":"2021","unstructured":"Xiang S, Wang L, Xing L, Du Y (2021) An effective memetic algorithm for UAV routing and orientation under uncertain navigation environments. Memetic Comput 13(2):169\u2013183. https:\/\/doi.org\/10.1007\/s12293-021-00334-9","journal-title":"Memetic Comput"},{"issue":"3","key":"353_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s12293-021-00342-9","volume":"13","author":"G Li","year":"2021","unstructured":"Li G, Zhu Z, Ma L, Ma X (2021) Multi-objective memetic algorithm for core-periphery structure detection in complex network. Memetic Comput 13(3):285\u2013306. https:\/\/doi.org\/10.1007\/s12293-021-00342-9","journal-title":"Memetic Comput"},{"issue":"2","key":"353_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s12293-021-00337-6","volume":"13","author":"L Wang","year":"2021","unstructured":"Wang L, Feng L (2021) Guest editorial: Special issue on memetic algorithms with learning strategy. Memetic Comput 13(2):147\u2013148. https:\/\/doi.org\/10.1007\/s12293-021-00337-6","journal-title":"Memetic Comput"},{"issue":"3","key":"353_CR22","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu R, Wunsch D (2005) Survey of clustering algorithms. IEEE Trans Neural Networks 16(3):645\u2013678. https:\/\/doi.org\/10.1109\/TNN.2005.845141","journal-title":"IEEE Trans Neural Networks"},{"key":"353_CR23","unstructured":"James M and others (1967) Some methods for classification and analysis of multivariate observations. Proc fifth Berkeley Symp Math Stat Probab 1(14): 281\u2013297"},{"key":"353_CR24","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/B978-044452701-1.00067-3","volume":"2","author":"M Daszykowski","year":"2009","unstructured":"Daszykowski M, Walczak B (2009) A density-based algorithm for discovering clusters in large spatial databases with noise. Compr Chemom 2:635\u2013654. https:\/\/doi.org\/10.1016\/B978-044452701-1.00067-3","journal-title":"Compr Chemom"},{"key":"353_CR25","unstructured":"Wang W, Yang J, and Muntz R (1997) STING\u202f: A statistical information grid approach to spatial data mining 1 introduction 2 related work. Proc 23rd Int Conf Very Large Data Bases, pp 186\u2013195"},{"issue":"7","key":"353_CR26","doi-asserted-by":"publisher","first-page":"2758","DOI":"10.1109\/TCYB.2018.2834466","volume":"49","author":"Y Hua","year":"2019","unstructured":"Hua Y, Jin Y, Hao K (2019) A clustering-based adaptive evolutionary algorithm for multiobjective optimization with irregular pareto fronts. IEEE Trans Cybern 49(7):2758\u20132770. https:\/\/doi.org\/10.1109\/TCYB.2018.2834466","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"353_CR27","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 CAC (2021) Multimodal multiobjective evolutionary optimization with dual clustering in decision and objective spaces. IEEE Trans Evol Comput 25(1):130\u2013144. https:\/\/doi.org\/10.1109\/TEVC.2020.3008822","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"353_CR28","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 (2014) 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. https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"353_CR29","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection\u202f: a new method for generating the pareto surface in nonlinear. SIAM J Optim 8(3):631\u2013657","journal-title":"SIAM J Optim"},{"key":"353_CR30","unstructured":"Zitzler E, Laumanns M, and Thiele L (2014) SPEA2: Improving the strength pareto evolutionary algorithm Eckart. Brisk Bin. Robust Invariant Scalable Keypoints, pp 0\u20132"},{"key":"353_CR31","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/4393818","author":"N Luo","year":"2021","unstructured":"Luo N, Lin W, Huang P, Chen J (2021) An evolutionary algorithm with clustering-based assisted selection strategy for multimodal multiobjective optimization. Complexity. https:\/\/doi.org\/10.1155\/2021\/4393818","journal-title":"Complexity"},{"issue":"2","key":"353_CR32","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"PAN Bosman","year":"2003","unstructured":"Bosman PAN, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174\u2013188. https:\/\/doi.org\/10.1109\/TEVC.2003.810761","journal-title":"IEEE Trans Evol Comput"},{"key":"353_CR33","doi-asserted-by":"publisher","unstructured":"Li M and Zheng J (2010) Spread assessment for evolutionary multi-objective optimization. Lect Notes Comput Sci (including Subser Lect Notes Artif Intell Lect Notes Bioinformatics) (vol. 5467). LNCS. pp 216\u2013230 https:\/\/doi.org\/10.1007\/978-3-642-01020-0_20.","DOI":"10.1007\/978-3-642-01020-0_20"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-022-00353-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-022-00353-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-022-00353-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T05:28:01Z","timestamp":1679290081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-022-00353-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,21]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["353"],"URL":"https:\/\/doi.org\/10.1007\/s12293-022-00353-0","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,21]]},"assertion":[{"value":"27 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}