{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T16:07:50Z","timestamp":1781021270812,"version":"3.54.1"},"reference-count":64,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.asoc.2026.115363","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T09:28:53Z","timestamp":1778578133000},"page":"115363","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Competitive cluster elimination (CCE) for large-scale swarm optimization"],"prefix":"10.1016","volume":"200","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7602-0022","authenticated-orcid":false,"given":"Junbo Jacob","family":"Lian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5937-5229","authenticated-orcid":false,"given":"Kaichen","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3016-8843","authenticated-orcid":false,"given":"Yujun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4605-5579","authenticated-orcid":false,"given":"Rui","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2415-0033","authenticated-orcid":false,"given":"Haoran","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6428-618X","authenticated-orcid":false,"given":"Zikun","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7336-8320","authenticated-orcid":false,"given":"Yujun","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7714-9693","authenticated-orcid":false,"given":"Huiling","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2026.115363_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.102029","article-title":"Discrete adaptive GWO-based transport scheduling for aircraft between spots on flight deck and hangar","volume":"97","author":"Su","year":"2025","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.102032","article-title":"An enhanced LSHADE-based algorithm for global and constrained optimization in applied mechanics and power flow problems","volume":"97","author":"Sallam","year":"2025","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.compbiomed.2024.108064","article-title":"Parrot optimizer: algorithm and applications to medical problems","volume":"172","author":"Lian","year":"2024","journal-title":"Comput. Biol. Med."},{"key":"10.1016\/j.asoc.2026.115363_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.enconman.2024.118387","article-title":"Self-adaptive enhanced learning differential evolution with surprisingly efficient decomposition approach for parameter identification of photovoltaic models","volume":"308","author":"Zhang","year":"2024","journal-title":"Energy Convers. Manag."},{"key":"10.1016\/j.asoc.2026.115363_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.113505","article-title":"Trend-aware mechanism for metaheuristic algorithms","volume":"182","author":"Lian","year":"2025","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"10.1016\/j.asoc.2026.115363_bib0030","doi-asserted-by":"crossref","first-page":"3654","DOI":"10.1007\/s11694-023-01865-0","article-title":"Tomato storage quality predicting method based on portable electronic nose system combined with WOA-SVM model","volume":"17","author":"Zhou","year":"2023","journal-title":"J. Food Meas. Charact."},{"issue":"6","key":"10.1016\/j.asoc.2026.115363_bib0035","doi-asserted-by":"crossref","first-page":"2431","DOI":"10.1109\/TEVC.2024.3429180","article-title":"An evolutionary multi-objective neural architecture search approach to advancing cognitive diagnosis in intelligent education","volume":"29","author":"Yang","year":"2025","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.energy.2025.136598","article-title":"Improved hyperparameter Bayesian optimization-bidirectional long short-term memory optimization for high-precision battery state of charge estimation","volume":"328","author":"Wang","year":"2025","journal-title":"Energy"},{"key":"10.1016\/j.asoc.2026.115363_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2022.105069","article-title":"Self-adaptive classification learning hybrid JAYA and Rao-1 algorithm for large-scale numerical and engineering problems","volume":"114","author":"Zhang","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.asoc.2026.115363_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122638","article-title":"Human evolutionary optimization algorithm","volume":"241","author":"Lian","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.asoc.2026.115363_bib0055","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10.1016\/j.asoc.2026.115363_bib0060","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"issue":"1","key":"10.1016\/j.asoc.2026.115363_bib0065","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","article-title":"Differential evolution: a survey of the state-of-the-art","volume":"15","author":"Das","year":"2010","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2026.115363_bib0070","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","article-title":"Genetic algorithms","volume":"267","author":"Holland","year":"1992","journal-title":"Sci. Am."},{"key":"10.1016\/j.asoc.2026.115363_bib0075","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1015059928466","article-title":"Evolution strategies\u2013a comprehensive introduction","volume":"1","author":"Beyer","year":"2002","journal-title":"Nat. Comput."},{"issue":"2","key":"10.1016\/j.asoc.2026.115363_bib0080","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","article-title":"Evolutionary programming made faster","volume":"3","author":"Yao","year":"1999","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0085","series-title":"Proceedings of ICNN\u201995\u2013International Conference on Neural Networks","first-page":"1942","article-title":"Particle swarm optimization","volume":"vol. 4","author":"Kennedy","year":"1995"},{"key":"10.1016\/j.asoc.2026.115363_bib0090","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","article-title":"A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm","volume":"39","author":"Karaboga","year":"2007","journal-title":"J. Glob. Optim."},{"issue":"15","key":"10.1016\/j.asoc.2026.115363_bib0095","doi-asserted-by":"crossref","first-page":"3185","DOI":"10.1080\/00207721.2024.2367079","article-title":"The educational competition optimizer","volume":"55","author":"Lian","year":"2024","journal-title":"Int. J. Syst. Sci."},{"issue":"7","key":"10.1016\/j.asoc.2026.115363_bib0100","doi-asserted-by":"crossref","first-page":"7305","DOI":"10.1007\/s11227-022-04959-6","article-title":"Dung beetle optimizer: a new meta-heuristic algorithm for global optimization","volume":"79","author":"Xue","year":"2023","journal-title":"J. Supercomput."},{"issue":"13","key":"10.1016\/j.asoc.2026.115363_bib0105","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","article-title":"GSA: a gravitational search algorithm","volume":"179","author":"Rashedi","year":"2009","journal-title":"Inf. Sci."},{"key":"10.1016\/j.asoc.2026.115363_bib0110","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.neucom.2023.02.010","article-title":"RIME: a physics-based optimization","volume":"532","author":"Su","year":"2023","journal-title":"Neurocomputing"},{"issue":"1","key":"10.1016\/j.asoc.2026.115363_bib0115","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1111\/itor.12001","article-title":"Metaheuristics\u2014the metaphor exposed","volume":"22","author":"S\u00f6rensen","year":"2015","journal-title":"Int. Trans. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2026.115363_bib0120","doi-asserted-by":"crossref","first-page":"2945","DOI":"10.1111\/itor.13176","article-title":"Exposing the grey wolf, moth-flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors","volume":"30","author":"Camacho-Villal\u00f3n","year":"2023","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115363_bib0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121544","article-title":"Deficiencies of the whale optimization algorithm and its validation method","volume":"237","author":"Deng","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115363_bib0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111696","article-title":"Metaheuristics exposed: unmasking the design pitfalls of arithmetic optimization algorithm in benchmarking","volume":"160","author":"Deng","year":"2024","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"10.1016\/j.asoc.2026.115363_bib0135","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1162\/evco_a_00325","article-title":"Evolutionary algorithms for parameter optimization\u2014thirty years later","volume":"31","author":"B\u00e4ck","year":"2023","journal-title":"Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0140","series-title":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","first-page":"2203","article-title":"Quantum entanglement inspired differential evolution algorithm","author":"Dixit","year":"2023"},{"key":"10.1016\/j.asoc.2026.115363_bib0145","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.128295","article-title":"A dynamic heterogeneous multi-swarm PSO for multi-objective frequency assignment problem","volume":"289","author":"Chen","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115363_bib0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.127161","article-title":"An automated method for solving configuration of distributed messaging systems: DMGA-PSO algorithm","volume":"277","author":"Ma","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115363_bib0155","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125084","article-title":"An adaptive pyramid PSO for high-dimensional feature selection","volume":"257","author":"Jin","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115363_bib0160","article-title":"Concepts, methods, and performances of particle swarm optimization, backpropagation, and neural networks","volume":"2018","author":"Zajmi","year":"2018","journal-title":"Appl. Comput. Intell. Soft Comput."},{"issue":"15","key":"10.1016\/j.asoc.2026.115363_bib0165","doi-asserted-by":"crossref","first-page":"11297","DOI":"10.1007\/s00500-020-05069-2","article-title":"An n-state switching PSO algorithm for scalable optimization","volume":"24","author":"Rahman","year":"2020","journal-title":"Soft Comput."},{"issue":"11","key":"10.1016\/j.asoc.2026.115363_bib0170","doi-asserted-by":"crossref","first-page":"6626","DOI":"10.1109\/TSMC.2019.2958550","article-title":"An N-State Markovian jumping particle swarm optimization algorithm","volume":"51","author":"Rahman","year":"2021","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"9\u201310","key":"10.1016\/j.asoc.2026.115363_bib0175","doi-asserted-by":"crossref","first-page":"6517","DOI":"10.1007\/s00500-023-09517-7","article-title":"A neighborhood-aware multi-Markovian switching particle swarm optimization technique for solving complex and expensive problems","volume":"28","author":"Khalil","year":"2024","journal-title":"Soft Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0180","series-title":"Proceedings of the International Conference on Database Theory (ICDT)","first-page":"217","article-title":"When is \u201cNearest neighbor\u201d meaningful?","author":"Beyer","year":"1999"},{"issue":"5","key":"10.1016\/j.asoc.2026.115363_bib0185","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","article-title":"JADE: adaptive differential evolution with optional external archive","volume":"13","author":"Zhang","year":"2009","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0190","series-title":"2013 IEEE Congress on Evolutionary Computation","first-page":"71","article-title":"Success-history based parameter adaptation for differential evolution","author":"Tanabe","year":"2013"},{"key":"10.1016\/j.asoc.2026.115363_bib0195","series-title":"IEEE Congress on Evolutionary Computation (CEC)","first-page":"1658","article-title":"Improving the search performance of SHADE using linear population size reduction","author":"Tanabe","year":"2014"},{"issue":"10","key":"10.1016\/j.asoc.2026.115363_bib0200","doi-asserted-by":"crossref","first-page":"448","DOI":"10.3390\/a17100448","article-title":"Niching global optimisation: systematic literature review","volume":"17","author":"Matanga","year":"2024","journal-title":"Algorithms"},{"key":"10.1016\/j.asoc.2026.115363_bib0205","author":"Moreno"},{"key":"10.1016\/j.asoc.2026.115363_bib0210","article-title":"Dynamic cooperative coevolution based on variable importance for non-separable large-scale global optimization","volume":"167","author":"Chen","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0215","author":"Guo"},{"issue":"Part B","key":"10.1016\/j.asoc.2026.115363_bib0220","article-title":"An adaptative differential evolution with enhanced diversity and restart mechanism","volume":"249","author":"Lin","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.asoc.2026.115363_bib0225","doi-asserted-by":"crossref","first-page":"223","DOI":"10.3390\/sym17020223","article-title":"Dual-performance multi-subpopulation adaptive restart differential evolution","volume":"17","author":"Qiao","year":"2025","journal-title":"Symmetry"},{"key":"10.1016\/j.asoc.2026.115363_bib0230","article-title":"A clustering-assisted adaptive evolutionary algorithm based on decomposition for high-dimensional multi-objective problems","volume":"255","author":"Li","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115363_bib0235","series-title":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201925","first-page":"340","article-title":"Cluster prevention in evolutionary diversity optimization for parallel machine scheduling","author":"Wittner","year":"2025"},{"key":"10.1016\/j.asoc.2026.115363_bib0240","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2023.126630","article-title":"Nature-inspired algorithms for 0-1 knapsack problem: a survey","volume":"554","author":"Zhou","year":"2023","journal-title":"Neurocomputing"},{"key":"10.1016\/j.asoc.2026.115363_bib0245","series-title":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","first-page":"43","article-title":"Set-based particle swarm optimization for data clustering","author":"Brown","year":"2022"},{"key":"10.1016\/j.asoc.2026.115363_bib0250","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2026.123347","article-title":"IKUN: a mean-field game theoretic KD-tree density guided mechanism for evolutionary algorithms","author":"Lian","year":"2026","journal-title":"Inf. Sci."},{"key":"10.1016\/j.asoc.2026.115363_bib0255","series-title":"Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization","author":"Awad","year":"2016"},{"key":"10.1016\/j.asoc.2026.115363_bib0260","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.asoc.2026.115363_bib0265","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/j.asoc.2026.115363_bib0270","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler","year":"1985"},{"issue":"2","key":"10.1016\/j.asoc.2026.115363_bib0275","doi-asserted-by":"crossref","first-page":"74","DOI":"10.59324\/ejaset.2025.3(2).07","article-title":"Comprehensive analysis of recent studies on using genetic algorithms for optimizing solutions to the 0\/1 knapsack problem","volume":"3","author":"Hassan","year":"2025","journal-title":"Eur. J. Appl. Sci. Eng. Technol."},{"key":"10.1016\/j.asoc.2026.115363_bib0280","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110908","article-title":"A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems","volume":"148","author":"Toaza","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0285","series-title":"Knapsack Problems","author":"Kellerer","year":"2004"},{"key":"10.1016\/j.asoc.2026.115363_bib0290","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"issue":"11","key":"10.1016\/j.asoc.2026.115363_bib0295","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-library: distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.asoc.2026.115363_bib0300","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","article-title":"A genetic algorithm for the multidimensional knapsack problem","volume":"4","author":"Chu","year":"1998","journal-title":"J. Heuristics"},{"issue":"4","key":"10.1016\/j.asoc.2026.115363_bib0305","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2014A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.asoc.2026.115363_bib0310","author":"Reinelt"},{"issue":"3","key":"10.1016\/j.asoc.2026.115363_bib0315","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","article-title":"An algorithm for the vehicle-dispatching problem","volume":"20","author":"Christofides","year":"1969","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.asoc.2026.115363_bib0320","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","article-title":"A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Rev."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626008112?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626008112?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:51:05Z","timestamp":1781020265000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626008112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":64,"alternative-id":["S1568494626008112"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115363","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Competitive cluster elimination (CCE) for large-scale swarm optimization","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115363","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115363"}}