{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T02:28:21Z","timestamp":1771295301035,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:00:00Z","timestamp":1731369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:00:00Z","timestamp":1731369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"The National Key Research and Development Project, Ministry of Science and Technology, China","award":["2018AAA0101302"],"award-info":[{"award-number":["2018AAA0101302"]}]},{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62106002"],"award-info":[{"award-number":["62106002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U21A20512"],"award-info":[{"award-number":["U21A20512"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The Natural Science Foundation of Anhui Province","award":["2108085MF193"],"award-info":[{"award-number":["2108085MF193"]}]},{"name":"The Natural Science Foundation of Anhui Province","award":["2008085QF308"],"award-info":[{"award-number":["2008085QF308"]}]},{"name":"The University Synergy Innovation Program of Anhui Province","award":["GXXT-2022-034"],"award-info":[{"award-number":["GXXT-2022-034"]}]},{"name":"The Natural Science Research Program of Anhui Province Education Council","award":["2022AH050088"],"award-info":[{"award-number":["2022AH050088"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s40747-024-01627-5","type":"journal-article","created":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T03:49:44Z","timestamp":1731383384000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A nonrevisiting genetic algorithm based on multi-region guided search strategy"],"prefix":"10.1007","volume":"11","author":[{"given":"Qijun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Chunxin","family":"Sang","sequence":"additional","affiliation":[]},{"given":"Haiping","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,12]]},"reference":[{"issue":"1","key":"1627_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1038\/s42256-020-00278-8","volume":"3","author":"R Miikkulainen","year":"2021","unstructured":"Miikkulainen R, Forrest S (2021) A biological perspective on evolutionary computation. Nat. Mach. Intell. 3(1):9\u201315","journal-title":"Nat. Mach. Intell."},{"issue":"7553","key":"1627_CR2","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1038\/nature14544","volume":"521","author":"AE Eiben","year":"2015","unstructured":"Eiben AE, Smith J (2015) From evolutionary computation to the evolution of things. Nature 521(7553):476\u2013482","journal-title":"Nature"},{"key":"1627_CR3","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial System","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Adaptation in Natural and Artificial System. The MIT Press"},{"issue":"5","key":"1627_CR4","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1007\/s10489-018-1370-4","volume":"49","author":"Y Song","year":"2019","unstructured":"Song Y, Wang F, Chen X (2019) An improved genetic algorithm for numerical function optimization. Appl Intell 49(5):1880\u20131902","journal-title":"Appl Intell"},{"key":"1627_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.eswa.2018.08.008","volume":"115","author":"M Nazarahari","year":"2019","unstructured":"Nazarahari M, Khanmirza E, Doostie S (2019) Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm. Expert Syst Appl 115:106\u2013120","journal-title":"Expert Syst Appl"},{"key":"1627_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.swevo.2013.11.001","volume":"15","author":"C Changdar","year":"2014","unstructured":"Changdar C, Mahapatra G, Kumar Pal R (2014) An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness. Swarm Evol Comput 15:27\u201337","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"1627_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s12293-017-0232-7","volume":"10","author":"A Rezoug","year":"2018","unstructured":"Rezoug A, Bader-El-Den M, Boughaci D (2018) Guided genetic algorithm for the multidimensional knapsack problem. Memet Comput 10(1):29\u201342","journal-title":"Memet Comput"},{"issue":"11","key":"1627_CR8","doi-asserted-by":"publisher","first-page":"9616","DOI":"10.1109\/TGRS.2020.3047223","volume":"59","author":"H Zhao","year":"2021","unstructured":"Zhao H, Bruzzone L, Guan R, Zhou F, Yang C (2021) Spectral-spatial genetic algorithm-based unsupervised band selection for hyperspectral image classification. IEEE Trans Geosci Remote Sens 59(11):9616\u20139632","journal-title":"IEEE Trans Geosci Remote Sens"},{"issue":"5","key":"1627_CR9","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch S, Chauhan SS, Kumar V (2021) A review on genetic algorithm: past, present, and future. Multimed Tools Appl 80(5):8091\u20138126","journal-title":"Multimed Tools Appl"},{"key":"1627_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ins.2016.01.046","volume":"345","author":"Q Zhu","year":"2016","unstructured":"Zhu Q, Lin Q, Du Z, Liang Z, Wang W, Zhu Z, Chen J, Huang P, Ming Z (2016) A novel adaptive hybrid crossover operator for multiobjective evolutionary algorithm. Inf Sci 345:177\u2013198","journal-title":"Inf Sci"},{"key":"1627_CR11","doi-asserted-by":"crossref","unstructured":"Chen D, Huang G, Chen Q, Jin F (2010) Implementing eco-friendly reservoir operation by using genetic algorithm with dynamic mutation operator. Life Syst Model Intell Comput 509\u2013516","DOI":"10.1007\/978-3-642-15615-1_59"},{"issue":"2","key":"1627_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/3477.485880","volume":"26","author":"T Kuo","year":"1996","unstructured":"Kuo T, Hwang S-Y (1996) Genetic algorithm with disruptive selection. IEEE Trans Syst Man Cybernet Part B: Cybernet 26(2):299\u2013307","journal-title":"IEEE Trans Syst Man Cybernet Part B: Cybernet"},{"key":"1627_CR13","doi-asserted-by":"crossref","unstructured":"Nieto-Fuentes R, Segura C (2022) A replacement scheme based on dynamic penalization for controlling the diversity of the population in genetic programming p. 1\u20138","DOI":"10.1109\/CEC55065.2022.9870428"},{"issue":"3","key":"1627_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1108\/AA-12-2016-173","volume":"37","author":"D Lin","year":"2017","unstructured":"Lin D, Shen B, Liu Y, Alsaadi FE, Alsaedi A (2017) Genetic algorithm-based compliant robot path planning: An improved bi-rrt-based initialization method. Assembly Automat 37(3):261\u2013270","journal-title":"Assembly Automat"},{"issue":"1","key":"1627_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0305-0548(93)E0023-M","volume":"22","author":"F Glover","year":"1994","unstructured":"Glover F, Kelly JP, Laguna M (1994) Genetic algorithms and tabu search: Hybrids for optimization. Comput Oper Res 22(1):111\u2013134","journal-title":"Comput Oper Res"},{"issue":"1","key":"1627_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1061\/(ASCE)0733-9496(2005)131:1(45)","volume":"131","author":"G Mahinthakumar","year":"2005","unstructured":"Mahinthakumar G, Sayeed M (2005) Hybrid genetic algorithm - local search methods for solving groundwater source identification inverse problems. J Water Resour Plann Manag 131(1):45\u201357","journal-title":"J Water Resour Plann Manag"},{"issue":"8","key":"1627_CR17","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1016\/j.asoc.2012.03.025","volume":"12","author":"D Lei","year":"2012","unstructured":"Lei D (2012) Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling. Appl Soft Comput 12(8):2237\u20132245","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1627_CR18","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1109\/TEVC.2013.2281543","volume":"18","author":"MN Omidvar","year":"2014","unstructured":"Omidvar MN, Li X, Mei Y, Yao X (2014) Cooperative co-evolution with differential grouping for large scale optimization. IEEE Trans Evol Comput 18(3):378\u2013393","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1627_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2014.2308305","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang X, Tian Y, Cheng R, Jin Y (2015) An efficient approach to nondominated sorting for evolutionary multiobjective optimization. IEEE Trans Evol Comput 19(2):201\u2013213","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1627_CR20","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/TCYB.2017.2789158","volume":"49","author":"PC Roy","year":"2019","unstructured":"Roy PC, Deb K, Islam MM (2019) An efficient nondominated sorting algorithm for large number of fronts. IEEE Trans Cybernet 49(3):859\u2013869","journal-title":"IEEE Trans Cybernet"},{"issue":"3","key":"1627_CR21","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/TEVC.2018.2865590","volume":"23","author":"X He","year":"2019","unstructured":"He X, Zhou Y, Chen Z, Zhang Q (2019) Evolutionary many-objective optimization based on dynamical decomposition. IEEE Trans Evol Comput 23(3):361\u2013375","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1627_CR22","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TEVC.2017.2749619","volume":"22","author":"Y Tian","year":"2018","unstructured":"Tian Y, Cheng R, Zhang X, Cheng F, Jin Y (2018) An indicator-based multiobjective evolutionary algorithm with reference point adaptation for better versatility. IEEE Trans Evol Comput 22(4):609\u2013622","journal-title":"IEEE Trans Evol Comput"},{"key":"1627_CR23","doi-asserted-by":"publisher","unstructured":"Cant\u2019u-Paz E (2001). Designing efficient master-slave parallel genetic algorithms. https:\/\/doi.org\/10.1007\/978-1-4615-4369-5_3","DOI":"10.1007\/978-1-4615-4369-5_3"},{"issue":"5","key":"1627_CR24","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0306-4549(02)00106-8","volume":"30","author":"CM Pereira","year":"2003","unstructured":"Pereira CM, Lapa CM (2003) Coarse-grained parallel genetic algorithm applied to a nuclear reactor core design optimization problem. Annal Nucl Energy 30(5):555\u2013565","journal-title":"Annal Nucl Energy"},{"key":"1627_CR25","doi-asserted-by":"crossref","unstructured":"Li J-M, Wang X-J, He R-S, Chi Z-X (2007) An efficient fine-grained parallel genetic algorithm based on gpu-accelerated. In: Proceedings of 2007 IFIP International Conference on Network and Parallel Computing Workshops, NPC 2007 855\u2013862","DOI":"10.1109\/NPC.2007.108"},{"key":"1627_CR26","first-page":"793","volume":"1998","author":"S Ronald","year":"1998","unstructured":"Ronald S (1998) Duplicate genotypes in a genetic algorithm. Proc IEEE Conf Evol Comput ICEC 1998:793\u2013798","journal-title":"Proc IEEE Conf Evol Comput ICEC"},{"key":"1627_CR27","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (2013) Tabu search 5\u20135:3261\u20133362","DOI":"10.1007\/978-1-4419-7997-1_17"},{"key":"1627_CR28","doi-asserted-by":"crossref","unstructured":"Akopov AS, Beklaryan LA, Thakur M, Verma BD (2019) Parallel multi-agent real-coded genetic algorithm for large-scale black-box single-objective optimisation. Knowl-Based Syst 174:103\u2013122","DOI":"10.1016\/j.knosys.2019.03.003"},{"key":"1627_CR29","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/j.asoc.2018.05.009","volume":"69","author":"L Liu","year":"2018","unstructured":"Liu L, Liu J (2018) Inferring gene regulatory networks with hybrid of multi-agent genetic algorithm and random forests based on fuzzy cognitive maps. Appl Soft Comput 69:585\u2013598","journal-title":"Appl Soft Comput"},{"key":"1627_CR30","doi-asserted-by":"crossref","unstructured":"Friedrich T, Hebbinghaus N, Neumann F (2007) Rigorous analyses of simple diversity mechanisms. In: Proceedings of 2007 Genetic and Evolutionary Computation Conference, GECCO 2007 1219 \u2013 1225","DOI":"10.1145\/1276958.1277194"},{"key":"1627_CR31","doi-asserted-by":"crossref","unstructured":"Yuen S, Chow C (2007) Non-revisiting genetic algorithm. In: Proceedings of 2007 IEEE Congress on Evolutionary Computation, CEC 2007 4583\u20134590","DOI":"10.1109\/CEC.2007.4425072"},{"issue":"6","key":"1627_CR32","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TEVC.2010.2040180","volume":"15","author":"CK Chow","year":"2011","unstructured":"Chow CK, Yuen SY (2011) An evolutionary algorithm that makes decision based on the entire previous search history. IEEE Trans Evol Comput 15(6):741\u2013769","journal-title":"IEEE Trans Evol Comput"},{"key":"1627_CR33","first-page":"1","volume":"2012","author":"CK Chow","year":"2012","unstructured":"Chow CK, Yuen SY (2012) Continuous non-revisiting genetic algorithm with overlapped search sub-region. IEEE Congr Evol Comput 2012:1\u20138","journal-title":"IEEE Congr Evol Comput"},{"key":"1627_CR34","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.ins.2019.10.016","volume":"512","author":"Y Su","year":"2020","unstructured":"Su Y, Guo N, Tian Y, Zhang X (2020) A non-revisiting genetic algorithm based on a novel binary space partition tree. Inf Sci 512:661\u2013674","journal-title":"Inf Sci"},{"key":"1627_CR35","doi-asserted-by":"crossref","unstructured":"Lou Y, Yuen SY (2015) Non-revisiting genetic algorithm with constant memory. IEEE Int Conf Syst Man Cybernet 1714\u20131719","DOI":"10.1109\/SMC.2015.301"},{"issue":"3","key":"1627_CR36","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s12293-015-0178-6","volume":"8","author":"Y Lou","year":"2016","unstructured":"Lou Y, Yuen SY (2016) Non-revisiting genetic algorithm with adaptive mutation using constant memory. Memet Comput 8(3):189\u2013210","journal-title":"Memet Comput"},{"issue":"3","key":"1627_CR37","volume":"61","author":"GC Yang Lou","year":"2021","unstructured":"Yang Lou GC, Yin Yuen Shiu (2021) Non-revisiting stochastic search revisited: Results, perspectives, and future directions. Swarm Evol Comput 61(3):100828","journal-title":"Swarm Evol Comput"},{"key":"1627_CR38","doi-asserted-by":"crossref","unstructured":"Yuen S, Chow C (2008) Applying non-revisiting genetic algorithm to traveling salesman problem. In: Proceedings of 2008 IEEE Congress on Evolutionary Computation, CEC 2008 2217\u20132224","DOI":"10.1109\/CEC.2008.4631093"},{"key":"1627_CR39","doi-asserted-by":"crossref","unstructured":"Yuen S, Chow C (2008) A non-revisiting simulated annealing algorithm. In: Proceedings of 2008 IEEE Congress on Evolutionary Computation, CEC 2008 1886\u20131892","DOI":"10.1109\/CEC.2008.4631046"},{"key":"1627_CR40","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1186\/s13638-016-0802-2","volume":"1","author":"X Zhang","year":"2017","unstructured":"Zhang X (2017) A non-revisiting artificial bee colony algorithm for phased array synthesis. EURASIP J Wireless Commun Netw 1:7\u201315","journal-title":"EURASIP J Wireless Commun Netw"},{"issue":"16","key":"1627_CR41","doi-asserted-by":"publisher","first-page":"12011","DOI":"10.1007\/s00521-019-04210-z","volume":"32","author":"Z Yang","year":"2020","unstructured":"Yang Z, Wu A (2020) A non-revisiting quantum-behaved particle swarm optimization based multilevel thresholding for image segmentation. Neural Comput Appl 32(16):12011\u201312031","journal-title":"Neural Comput Appl"},{"key":"1627_CR42","first-page":"1","volume":"2012","author":"CK Chow","year":"2012","unstructured":"Chow CK, Yuen SY (2012) Continuous non-revisiting genetic algorithm with overlapped search sub-region. IEEE Congr Evol Comput 2012:1\u20138","journal-title":"IEEE Congr Evol Comput"},{"key":"1627_CR43","first-page":"1558","volume":"2014","author":"CK Chow","year":"2014","unstructured":"Chow CK, Yuen SY (2014) A dynamic history-driven evolutionary algorithm. IEEE Congr Evol Comput (CEC) 2014:1558\u20131564","journal-title":"IEEE Congr Evol Comput (CEC)"},{"key":"1627_CR44","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321752","author":"S Doncieux","year":"2019","unstructured":"Doncieux S, Laflaqui\u00e8re A, Coninx A (2019) Novelty search: A theoretical perspective. Proc Genet Evol Comput Conf. https:\/\/doi.org\/10.1145\/3321707.3321752","journal-title":"Proc Genet Evol Comput Conf"},{"key":"1627_CR45","doi-asserted-by":"publisher","unstructured":"Gomes J, Mariano P, Christensen AL (2015) Devising effective novelty search algorithms: A comprehensive empirical study. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation 943\u2013950 https:\/\/doi.org\/10.1145\/2739480.2754736","DOI":"10.1145\/2739480.2754736"},{"issue":"2","key":"1627_CR46","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0202009","volume":"2","author":"JH Holland","year":"1973","unstructured":"Holland JH (1973) Genetic algorithms and the optimal allocation of trials. SIAM J Comput 2(2):88\u2013105","journal-title":"SIAM J Comput"},{"key":"1627_CR47","first-page":"152","volume-title":"Swarm intelligence[m]","author":"ERC Kennedy","year":"2001","unstructured":"Kennedy ERC (2001) Swarm intelligence[m]. Academic Press, USA, pp 152\u2013186"},{"issue":"2","key":"1627_CR48","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1109\/TEVC.2008.2003008","volume":"13","author":"SY Yuen","year":"2009","unstructured":"Yuen SY, Chow CK (2009) A genetic algorithm that adaptively mutates and never revisits. IEEE Trans Evol Comput 13(2):454\u2013472","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1627_CR49","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TCYB.2014.2322602","volume":"45","author":"R Cheng","year":"2015","unstructured":"Cheng R, Jin Y (2015) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybernet 45(2):191\u2013204","journal-title":"IEEE Trans Cybernet"},{"issue":"5","key":"1627_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129065714400061","volume":"24","author":"G Zhang","year":"2014","unstructured":"Zhang G, Rong H, Neri F, Perez-Jimenez MJ (2014) An optimization spiking neural p system for approximately solving combinatorial optimization problems. Int J Neural Syst 24(5):1\u201316","journal-title":"Int J Neural Syst"},{"key":"1627_CR51","doi-asserted-by":"publisher","unstructured":"Hansen N (2006) The CMA evolution strategy: a comparing review. Springer Berlin Heidelberg, pp. 75\u2013102. https:\/\/doi.org\/10.1007\/3-540-32494-1_4","DOI":"10.1007\/3-540-32494-1_4"},{"key":"1627_CR52","unstructured":"Li X, Tang K, Omidvar MN, Yang Z, Qin K (2013) Benchmark functions for the cec\u20192013 special session and competition on large-scale global optimization"},{"issue":"2","key":"1627_CR53","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"key":"1627_CR54","unstructured":"Satlib - benchmark problems. https:\/\/www.cs.ubc.ca\/hoos\/SATLIB\/benchm.html"},{"key":"1627_CR55","doi-asserted-by":"publisher","unstructured":"Cosson R, Santana R, Derbel B, Liefooghe A (2022) Multi-objective nk landscapes with heterogeneous objectives. In: Proceedings of the Genetic and Evolutionary Computation Conference 502\u2013510. https:\/\/doi.org\/10.1145\/3512290.3528858","DOI":"10.1145\/3512290.3528858"},{"key":"1627_CR56","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/CEC.2008.4630938","volume":"2008","author":"O Olorunda","year":"2008","unstructured":"Olorunda O, Engelbrecht AP (2008) Measuring exploration\/exploitation in particle swarms using swarm diversity. IEEE Congr Evol Comput 2008:1128\u20131134. https:\/\/doi.org\/10.1109\/CEC.2008.4630938","journal-title":"IEEE Congr Evol Comput"},{"key":"1627_CR57","doi-asserted-by":"crossref","unstructured":"Ismail A, Engelbrecht AP (2012) Measuring diversity in the cooperative particle swarm optimizer. Swarm Intelligence 97\u2013108","DOI":"10.1007\/978-3-642-32650-9_9"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01627-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01627-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01627-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T20:16:13Z","timestamp":1738268173000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01627-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,12]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1627"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01627-5","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,12]]},"assertion":[{"value":"4 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2024","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 Conflict of interest. The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"22"}}