{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:59:14Z","timestamp":1784199554996,"version":"3.55.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07334-3","type":"journal-article","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T09:09:54Z","timestamp":1747818594000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cellular neighbors optimizer: a novel metaheuristic approach inspired by the cellular automata and agent-based modeling for global optimization"],"prefix":"10.1007","volume":"81","author":[{"given":"Oscar","family":"Barba-Toscano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik","family":"Cuevas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H\u00e9ctor","family":"Escobar-Cuevas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miguel","family":"Islas-Toski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,21]]},"reference":[{"key":"7334_CR1","doi-asserted-by":"publisher","unstructured":"Yang X (2010) Engineering optimization. Wiley. https:\/\/doi.org\/10.1002\/9780470640425","DOI":"10.1002\/9780470640425"},{"issue":"1\u20132","key":"7334_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0377-0427(00)00425-8","volume":"124","author":"PM Pardalos","year":"2000","unstructured":"Pardalos PM, Romeijn HE, Tuy H (2000) Recent developments and trends in global optimization. J Comput Appl Math 124(1\u20132):209\u2013228. https:\/\/doi.org\/10.1016\/S0377-0427(00)00425-8","journal-title":"J Comput Appl Math"},{"key":"7334_CR3","doi-asserted-by":"publisher","unstructured":"Wortmann T, Nannicini G (2017) Introduction to architectural design optimization, pp 259\u2013278. https:\/\/doi.org\/10.1007\/978-3-319-65338-9_14","DOI":"10.1007\/978-3-319-65338-9_14"},{"key":"7334_CR4","doi-asserted-by":"crossref","unstructured":"Yang X-S (2018) Optimization Techniques and Applications with Examples, 1st ed., vol. 1. United States of America: John Wiley & Sons","DOI":"10.1002\/9781119490616"},{"key":"7334_CR5","volume-title":"Optimization Techniques in Statistics","author":"JS Rustag","year":"1994","unstructured":"Rustag JS (1994) Optimization Techniques in Statistics, 1st edn. Academic Press Inc, London","edition":"1"},{"key":"7334_CR6","doi-asserted-by":"publisher","unstructured":"Cuevas E, Rodr\u00edguez A (2020) Metaheuristic Computation with MATLAB\u00ae. First edition. | Boca Raton: CRC Press. Chapman and Hall\/CRC, 2020. https:\/\/doi.org\/10.1201\/9781003006312","DOI":"10.1201\/9781003006312"},{"key":"7334_CR7","doi-asserted-by":"publisher","unstructured":"Tsoi AC, Tsoi AC (1998) Gradient based learning methods, pp 27\u201362. https:\/\/doi.org\/10.1007\/BFb0053994","DOI":"10.1007\/BFb0053994"},{"issue":"3","key":"7334_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek M, Liu S-H, Mernik M (2013) Exploration and exploitation in evolutionary algorithms. ACM Comput Surv 45(3):1\u201333. https:\/\/doi.org\/10.1145\/2480741.2480752","journal-title":"ACM Comput Surv"},{"issue":"2","key":"7334_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2009","unstructured":"Bianchi L, Dorigo M, Gambardella LM, Gutjahr WJ (2009) A survey on metaheuristics for stochastic combinatorial optimization. Nat Comput 8(2):239\u2013287. https:\/\/doi.org\/10.1007\/s11047-008-9098-4","journal-title":"Nat Comput"},{"issue":"1","key":"7334_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s11831-023-09975-0","volume":"31","author":"L Velasco","year":"2024","unstructured":"Velasco L, Guerrero H, Hospitaler A (2024) A literature review and critical analysis of metaheuristics recently developed. Archiv Comput Methods Eng 31(1):125\u2013146. https:\/\/doi.org\/10.1007\/s11831-023-09975-0","journal-title":"Archiv Comput Methods Eng"},{"key":"7334_CR11","doi-asserted-by":"publisher","unstructured":"Abdel-Basset M, Abdel-Fatah L, Sangaiah AK (2018) Metaheuristic Algorithms: A Comprehensive Review. In: Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications, Elsevier, pp 185\u2013231. https:\/\/doi.org\/10.1016\/B978-0-12-813314-9.00010-4","DOI":"10.1016\/B978-0-12-813314-9.00010-4"},{"key":"7334_CR12","doi-asserted-by":"publisher","unstructured":"Holland JH (1984) Genetic Algorithms and Adaptation. In: Adaptive Control of Ill-Defined Systems, Boston, MA: Springer US, pp 317\u2013333. https:\/\/doi.org\/10.1007\/978-1-4684-8941-5_21","DOI":"10.1007\/978-1-4684-8941-5_21"},{"issue":"4","key":"7334_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J Global Optim"},{"issue":"1","key":"7334_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H-G Beyer","year":"2002","unstructured":"Beyer H-G, Schwefel H-P (2002) Evolution strategies \u2013 a comprehensive introduction. Nat Comput 1(1):3\u201352. https:\/\/doi.org\/10.1023\/A:1015059928466","journal-title":"Nat Comput"},{"key":"7334_CR15","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R. Particle swarm optimization. In: Proceedings of ICNN\u201995 - International Conference on Neural Networks, IEEE, pp 1942\u20131948. https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"7334_CR16","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv Eng Softw"},{"key":"7334_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","journal-title":"Adv Eng Softw"},{"key":"7334_CR18","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University, Engineering Faculty"},{"key":"7334_CR19","doi-asserted-by":"publisher","unstructured":"Yang X-S (2010) A new metaheuristic bat-inspired algorithm, pp 65\u201374. https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6","DOI":"10.1007\/978-3-642-12538-6_6"},{"issue":"4598","key":"7334_CR20","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science (1979) 220(4598):671\u2013680. https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science (1979)"},{"issue":"2","key":"7334_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. SIMULATION 76(2):60\u201368. https:\/\/doi.org\/10.1177\/003754970107600201","journal-title":"SIMULATION"},{"issue":"2","key":"7334_CR22","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s10489-013-0458-0","volume":"40","author":"E Cuevas","year":"2014","unstructured":"Cuevas E, Echavarr\u00eda A, Ram\u00edrez-Orteg\u00f3n MA (2014) An optimization algorithm inspired by the States of Matter that improves the balance between exploration and exploitation. Appl Intell 40(2):256\u2013272. https:\/\/doi.org\/10.1007\/s10489-013-0458-0","journal-title":"Appl Intell"},{"issue":"13","key":"7334_CR23","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a Gravitational Search Algorithm. Inf Sci (N Y) 179(13):2232\u20132248. https:\/\/doi.org\/10.1016\/j.ins.2009.03.004","journal-title":"Inf Sci (N Y)"},{"key":"7334_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105499","volume":"81","author":"D Tang","year":"2019","unstructured":"Tang D (2019) Spherical evolution for solving continuous optimization problems. Appl Soft Comput 81:105499","journal-title":"Appl Soft Comput"},{"key":"7334_CR25","doi-asserted-by":"publisher","unstructured":"Altay EV, Alatas B (2019) Performance comparisons of socially inspired metaheuristic algorithms on unconstrained global optimization, pp 163\u2013175. https:\/\/doi.org\/10.1007\/978-981-13-0341-8_15","DOI":"10.1007\/978-981-13-0341-8_15"},{"issue":"3","key":"7334_CR26","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao RV, Savsani VJ, Vakharia DP (2011) Teaching\u2013learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303\u2013315. https:\/\/doi.org\/10.1016\/j.cad.2010.12.015","journal-title":"Comput Aided Des"},{"key":"7334_CR27","doi-asserted-by":"publisher","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE Congress on Evolutionary Computation, IEEE, Sep 2007, pp 4661\u20134667. https:\/\/doi.org\/10.1109\/CEC.2007.4425083","DOI":"10.1109\/CEC.2007.4425083"},{"key":"7334_CR28","doi-asserted-by":"publisher","unstructured":"Sebald AV, Fogel LJ (1994) Evolutionary Programming. In: Evolutionary Programming, World Scientific, Sep 1994, pp 1\u2013386. https:\/\/doi.org\/10.1142\/9789814534116","DOI":"10.1142\/9789814534116"},{"key":"7334_CR29","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.matcom.2024.08.004","volume":"227","author":"E Cuevas","year":"2025","unstructured":"Cuevas E, V\u00e1squez M, Avila K, Rodriguez A, Zaldivar D (2025) Balancing individual and collective strategies: a new approach in metaheuristic optimization. Math Comput Simul 227:322\u2013346. https:\/\/doi.org\/10.1016\/j.matcom.2024.08.004","journal-title":"Math Comput Simul"},{"key":"7334_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2024.129831","volume":"645","author":"E Cuevas","year":"2024","unstructured":"Cuevas E, Luque A, Aguirre N, Navarro MA, Rodr\u00edguez A (2024) Metaheuristic optimization with dynamic strategy adaptation: an evolutionary game theory approach. Physica A 645:129831. https:\/\/doi.org\/10.1016\/j.physa.2024.129831","journal-title":"Physica A"},{"key":"7334_CR31","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6610670","author":"Y Tamura","year":"2021","unstructured":"Tamura Y, Sakiyama T, Arizono I (2021) Ant colony optimization using common social information and self-memory. Complexity. https:\/\/doi.org\/10.1155\/2021\/6610670","journal-title":"Complexity"},{"key":"7334_CR32","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/8372318","author":"T Sakiyama","year":"2021","unstructured":"Sakiyama T, Uneme K, Arizono I (2021) Rank-based ant system via the relative position in a local hierarchy. Complexity. https:\/\/doi.org\/10.1155\/2021\/8372318","journal-title":"Complexity"},{"issue":"1\u20133","key":"7334_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","volume":"334","author":"J Kari","year":"2005","unstructured":"Kari J (2005) Theory of cellular automata: a survey. Theor Comput Sci 334(1\u20133):3\u201333. https:\/\/doi.org\/10.1016\/j.tcs.2004.11.021","journal-title":"Theor Comput Sci"},{"issue":"3","key":"7334_CR34","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","volume":"55","author":"S Wolfram","year":"1983","unstructured":"Wolfram S (1983) Statistical mechanics of cellular automata. Rev Mod Phys 55(3):601\u2013644. https:\/\/doi.org\/10.1103\/RevModPhys.55.601","journal-title":"Rev Mod Phys"},{"key":"7334_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2020\/3402198","volume":"2020","author":"J Makmul","year":"2020","unstructured":"Makmul J (2020) A cellular automaton model for pedestrians\u2019 movements influenced by gaseous hazardous material spreading. Modell Simul Eng 2020:1\u201310. https:\/\/doi.org\/10.1155\/2020\/3402198","journal-title":"Modell Simul Eng"},{"key":"7334_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114930","volume":"177","author":"JC Seck-Tuoh-Mora","year":"2021","unstructured":"Seck-Tuoh-Mora JC, Hernandez-Romero N, Lagos-Eulogio P, Medina-Marin J, Zu\u00f1iga-Pe\u00f1a NS (2021) A continuous-state cellular automata algorithm for global optimization. Expert Syst Appl 177:114930. https:\/\/doi.org\/10.1016\/j.eswa.2021.114930","journal-title":"Expert Syst Appl"},{"issue":"20","key":"7334_CR37","doi-asserted-by":"publisher","first-page":"4460","DOI":"10.1016\/j.ins.2010.05.025","volume":"181","author":"Y Shi","year":"2011","unstructured":"Shi Y, Liu H, Gao L, Zhang G (2011) Cellular particle swarm optimization. Inf Sci (N Y) 181(20):4460\u20134493. https:\/\/doi.org\/10.1016\/j.ins.2010.05.025","journal-title":"Inf Sci (N Y)"},{"issue":"1","key":"7334_CR38","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.jocs.2013.07.005","volume":"5","author":"G Oxman","year":"2014","unstructured":"Oxman G, Weiss S, Be\u2019ery Y (2014) Computational methods for Conway\u2019s Game of Life cellular automaton. J Comput Sci 5(1):24\u201331. https:\/\/doi.org\/10.1016\/j.jocs.2013.07.005","journal-title":"J Comput Sci"},{"key":"7334_CR39","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.jocs.2016.08.005","volume":"21","author":"J G\u0105sior","year":"2017","unstructured":"G\u0105sior J, Seredy\u0144ski F (2017) A Sandpile cellular automata-based scheduler and load balancer. J Comput Sci 21:460\u2013468. https:\/\/doi.org\/10.1016\/j.jocs.2016.08.005","journal-title":"J Comput Sci"},{"key":"7334_CR40","unstructured":"Berto F, Tabliabue J (2024) \u201cCellular Automata,\u201d The Stanford Encyclopedia of Phylosophy. Metaphysics Research Lab, Stanford University, 2023. Accessed: Dec. 02, 2024. [Online]. Available: https:\/\/plato.stanford.edu\/archives\/win2023\/entries\/cellular-automata"},{"key":"7334_CR41","volume-title":"An introduction to agent-based modeling","author":"U Wilensky","year":"2015","unstructured":"Wilensky U, Rand W (2015) An introduction to agent-based modeling, 1st edn. MIT Press, Mssachusetts","edition":"1"},{"key":"7334_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100671","volume":"54","author":"B Morales-Casta\u00f1eda","year":"2020","unstructured":"Morales-Casta\u00f1eda B, Zald\u00edvar D, Cuevas E, Fausto F, Rodr\u00edguez A (2020) A better balance in metaheuristic algorithms: Does it exist? Swarm Evol Comput 54:100671. https:\/\/doi.org\/10.1016\/j.swevo.2020.100671","journal-title":"Swarm Evol Comput"},{"key":"7334_CR43","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89:228\u2013249. https:\/\/doi.org\/10.1016\/j.knosys.2015.07.006","journal-title":"Knowl-Based Syst"},{"key":"7334_CR44","doi-asserted-by":"crossref","unstructured":"Zhang J, Wang JS (2020) Improved whale optimization algorithm based on nonlinear adaptive weight and golden sine operator. IEEE Access 8","DOI":"10.1109\/ACCESS.2020.2989445"},{"key":"7334_CR45","doi-asserted-by":"publisher","unstructured":"Yang X-S, Suash Deb (2009) Cuckoo Search via L\u00e9vy flights. In: 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), pp 210\u2013214. https:\/\/doi.org\/10.1109\/NABIC.2009.5393690","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"7334_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1\u201312. https:\/\/doi.org\/10.1016\/j.compstruc.2016.03.001","journal-title":"Comput Struct"},{"issue":"3","key":"7334_CR47","doi-asserted-by":"publisher","first-page":"119","DOI":"10.2307\/3001946","volume":"3","author":"F Wilcoxon","year":"1947","unstructured":"Wilcoxon F (1947) Probability tables for individual comparisons by ranking methods. Biometrics 3(3):119. https:\/\/doi.org\/10.2307\/3001946","journal-title":"Biometrics"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07334-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07334-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07334-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T09:09:58Z","timestamp":1747818598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07334-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,21]]},"references-count":47,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["7334"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07334-3","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,21]]},"assertion":[{"value":"21 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2025","order":2,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"869"}}