{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T23:56:11Z","timestamp":1773964571019,"version":"3.50.1"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"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":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.knosys.2026.115461","type":"journal-article","created":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T06:36:39Z","timestamp":1771137399000},"page":"115461","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Critical analysis of the animated oat optimization algorithm: Theoretical and empirical limitations"],"prefix":"10.1016","volume":"339","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3473-1154","authenticated-orcid":false,"given":"Haiyan","family":"Shi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5430-6860","authenticated-orcid":false,"given":"Ngaiming","family":"Kwok","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.knosys.2026.115461_bib0001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11721-021-00202-9","article-title":"Metaphor-based metaheuristics, a call for action: the elephant in the room","volume":"16","author":"Aranha","year":"2022","journal-title":"Swarm Intell."},{"issue":"1","key":"10.1016\/j.knosys.2026.115461_bib0002","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1111\/itor.12001","article-title":"Metaheuristics-the metaphor exposed","volume":"22","author":"S\u00f6rensen","year":"2015","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.knosys.2026.115461_bib0003","series-title":"International Conference on Swarm Intelligence","first-page":"121","article-title":"Grey wolf, firefly and bat algorithms: three widespread algorithms that do not contain any novelty","author":"Camacho Villal\u00f3n","year":"2020"},{"issue":"7","key":"10.1016\/j.knosys.2026.115461_bib0004","doi-asserted-by":"crossref","first-page":"2011","DOI":"10.1007\/s00500-014-1388-4","article-title":"The role of basic, modified and hybrid shuffled frog leaping algorithm on optimization problems: a review","volume":"19","author":"Sarkheyli","year":"2015","journal-title":"Soft Comput."},{"key":"10.1016\/j.knosys.2026.115461_bib0005","doi-asserted-by":"crossref","first-page":"158508","DOI":"10.1109\/ACCESS.2021.3130933","article-title":"A weighted chimp optimization algorithm","volume":"9","author":"Khishe","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.knosys.2026.115461_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.cma.2022.114570","article-title":"Dwarf mongoose optimization algorithm","volume":"391","author":"Agushaka","year":"2022","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"1","key":"10.1016\/j.knosys.2026.115461_bib0007","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-025-94730-7","article-title":"A novel parrot optimizer for robust and scalable PEMFC parameter optimization","volume":"15","author":"Aljaidi","year":"2025","journal-title":"Sci. Rep."},{"key":"10.1016\/j.knosys.2026.115461_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.106207","article-title":"Evolving marine predators algorithm by dynamic foraging strategy for real-world engineering optimization problems","volume":"123","author":"Shen","year":"2023","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"9","key":"10.1016\/j.knosys.2026.115461_bib0009","doi-asserted-by":"crossref","first-page":"4763","DOI":"10.1007\/s00521-023-09236-y","article-title":"SEB-ChOA: an improved chimp optimization algorithm using spiral exploitation behavior","volume":"36","author":"Qian","year":"2024","journal-title":"Neural Comput. Appl."},{"issue":"2","key":"10.1016\/j.knosys.2026.115461_bib0010","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1080\/0952813X.2021.1960639","article-title":"Fuzzy whale optimisation algorithm: a new hybrid approach for automatic sonar target recognition","volume":"35","author":"Saffari","year":"2023","journal-title":"J. Experim. Theor. Artif. Intell."},{"key":"10.1016\/j.knosys.2026.115461_bib0011","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109869","article-title":"Evolving chimp optimization algorithm by weighted opposition-based technique and greedy search for multimodal engineering problems","volume":"132","author":"Bo","year":"2023","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.knosys.2026.115461_bib0012","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","article-title":"Designing and reporting on computational experiments with heuristic methods","volume":"1","author":"Barr","year":"1995","journal-title":"J. Heurist."},{"issue":"1","key":"10.1016\/j.knosys.2026.115461_bib0013","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s00500-014-1493-4","article-title":"Is a comparison of results meaningful from the inexact replications of computational experiments?","volume":"20","author":"\u010crepin\u0161ek","year":"2016","journal-title":"Soft Comput."},{"key":"10.1016\/j.knosys.2026.115461_bib0014","series-title":"Experimental Research in Evolutionary Computation: The New Experimentalism","author":"Bartz-Beielstein","year":"2006"},{"key":"10.1016\/j.knosys.2026.115461_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109478","article-title":"Maximum number of generations as a stopping criterion considered harmful","volume":"128","author":"Ravber","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.knosys.2026.115461_bib0016","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.asoc.2014.02.009","article-title":"Replication and comparison of computational experiments in applied evolutionary computing: common pitfalls and guidelines to avoid them","volume":"19","author":"\u010crepin\u0161ek","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.knosys.2026.115461_bib0017","article-title":"The animated oat optimization algorithm: a nature-inspired metaheuristic for engineering optimization and a case study on wireless sensor networks","author":"Wang","year":"2025","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.knosys.2026.115461_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100973","article-title":"A prescription of methodological guidelines for comparing bio-inspired optimization algorithms","volume":"67","author":"LaTorre","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.knosys.2026.115461_bib0019","series-title":"Proceedings of the IEEE Swarm Intelligence Symposium","first-page":"80","article-title":"Bare bones particle swarms","author":"Kennedy","year":"2003"},{"issue":"1","key":"10.1016\/j.knosys.2026.115461_bib0020","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4235.985692","article-title":"The particle swarm\u2014explosion, stability, and convergence in a multidimensional complex space","volume":"6","author":"Clerc","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.knosys.2026.115461_bib0021","series-title":"Proceedings of the IEEE International Conference on Evolutionary Computation","first-page":"69","article-title":"A modified particle swarm optimizer","author":"Shi","year":"1998"},{"issue":"4","key":"10.1016\/j.knosys.2026.115461_bib0022","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Global Optim."},{"issue":"2","key":"10.1016\/j.knosys.2026.115461_bib0023","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"Deb","year":"1995","journal-title":"Compl. Syst."},{"issue":"2","key":"10.1016\/j.knosys.2026.115461_bib0024","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1162\/106365601750190398","article-title":"Completely derandomized self-adaptation in evolution strategies","volume":"9","author":"Hansen","year":"2001","journal-title":"Evol. Comput."},{"key":"10.1016\/j.knosys.2026.115461_bib0025","series-title":"Proceedings of the 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"},{"key":"10.1016\/j.knosys.2026.115461_bib0026","series-title":"Technical Report","article-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.knosys.2026.115461_bib0027","series-title":"Technical Report","article-title":"Problem Definitions and Evaluation Criteria for the CEC 2021 Special Session and Competition on Single Objective Bound Constrained Numerical Optimization","author":"Mohamed","year":"2020"},{"key":"10.1016\/j.knosys.2026.115461_bib0028","series-title":"Technical Report","article-title":"Problem Definitions and Evaluation Criteria for the CEC 2022 Special Session and Competition on Single Objective Bound Constrained Numerical Optimization","author":"Kumar","year":"2021"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126002042?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126002042?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T21:31:19Z","timestamp":1773955879000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126002042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":28,"alternative-id":["S0950705126002042"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115461","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Critical analysis of the animated oat optimization algorithm: Theoretical and empirical limitations","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115461","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":"115461"}}