{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T04:23:08Z","timestamp":1781842988575,"version":"3.54.5"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T00:00:00Z","timestamp":1530576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007837","name":"Universiti Tun Hussein Onn Malaysia","doi-asserted-by":"publisher","award":["U560"],"award-info":[{"award-number":["U560"]}],"id":[{"id":"10.13039\/100007837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00521-018-3592-0","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T11:49:16Z","timestamp":1530618556000},"page":"7665-7683","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":323,"title":["On the exploration and exploitation in popular swarm-based metaheuristic algorithms"],"prefix":"10.1007","volume":"31","author":[{"given":"Kashif","family":"Hussain","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohd Najib Mohd","family":"Salleh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhui","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"issue":"4","key":"3592_CR1","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1108\/IMDS-06-2015-0222","volume":"116","author":"S Cheng","year":"2016","unstructured":"Cheng S, Zhang Q, Qin Q (2016) Big data analytics with swarm intelligence. Ind Manag Data Syst 116(4):646\u2013666","journal-title":"Ind Manag Data Syst"},{"key":"3592_CR2","doi-asserted-by":"publisher","unstructured":"Adekanmbi O, Green P (2015) Conceptual comparison of population based metaheuristics for engineering problems. Sci World J. https:\/\/doi.org\/10.1155\/2015\/936106","DOI":"10.1155\/2015\/936106"},{"issue":"1","key":"3592_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10288-014-0264-5","volume":"13","author":"M Castro","year":"2015","unstructured":"Castro M, S\u00f6rensen K, Vansteenwegen P, Goos P (2015) A fast metaheuristic for the travelling salesperson problem with hotel selection. 4OR 13(1):15\u201334","journal-title":"4OR"},{"key":"3592_CR4","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/j.endm.2010.05.080","volume":"36","author":"PA Maya","year":"2010","unstructured":"Maya PA, S\u00f6rensen K, Goos P (2010) An efficient metaheuristic to improve accessibility by rural road network planning. Electron Notes Discrete Math 36:631\u2013638","journal-title":"Electron Notes Discrete Math"},{"key":"3592_CR5","doi-asserted-by":"publisher","unstructured":"Hidalgo IG, de Barros RS, Fernandes J, Estr\u00f3cio JPF, Correia PB (2015) Metaheuristic approaches for hydropower system scheduling. J Appl Math. https:\/\/doi.org\/10.1155\/2015\/701851","DOI":"10.1155\/2015\/701851"},{"issue":"2","key":"3592_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1166\/jctn.2012.2012","volume":"9","author":"X-S Yang","year":"2012","unstructured":"Yang X-S (2012) Efficiency analysis of swarm intelligence and randomization techniques. J Comput Theor Nanosci 9(2):189\u2013198","journal-title":"J Comput Theor Nanosci"},{"key":"3592_CR7","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization (pso). In: Proceedings of the IEEE international conference on neural networks, Perth, Australia, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"3592_CR8","doi-asserted-by":"crossref","unstructured":"Dorigo M, Di Caro G (1999) Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 congress on evolutionary computation, 1999 (CEC99), vol 2. IEEE, pp 1470\u20131477","DOI":"10.1109\/CEC.1999.782657"},{"issue":"3","key":"3592_CR9","first-page":"1","volume":"9","author":"V Tereshko","year":"2005","unstructured":"Tereshko V, Loengarov A (2005) Collective decision making in honey-bee foraging dynamics. Comput Inf Syst 9(3):1","journal-title":"Comput Inf Syst"},{"key":"3592_CR10","unstructured":"Yang X-S, Deb S (2009) Cuckoo search via l\u00e9vy flights. In: World congress on nature & biologically inspired computing, 2009 (NaBIC 2009). IEEE, pp 210\u2013214"},{"key":"3592_CR11","unstructured":"Yang X-S (2010) Firefly algorithm. In: Engineering Optimization. Wiley, Hoboken, NJ, USA, pp 221\u2013230"},{"key":"3592_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-13495-1_44","volume":"6145","author":"Y Tan","year":"2010","unstructured":"Tan Y, Zhu Y (2010) Fireworks algorithm for optimization. Adv Swarm Intell 6145:355\u2013364","journal-title":"Adv Swarm Intell"},{"key":"3592_CR13","unstructured":"Yang X-S (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010), pp 65\u201374"},{"issue":"3","key":"3592_CR14","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-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303\u2013315","journal-title":"Comput Aided Des"},{"issue":"6","key":"3592_CR15","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702\u2013713","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"3592_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCS.2002.1004010","volume":"22","author":"KM Passino","year":"2002","unstructured":"Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst 22(3):52\u201367","journal-title":"IEEE Control Syst"},{"key":"3592_CR17","doi-asserted-by":"publisher","unstructured":"Zhang Y, Wang S, Ji G (2015) A comprehensive survey on particle swarm optimization algorithm and its applications. Math Probl Eng. https:\/\/doi.org\/10.1155\/2015\/931256","DOI":"10.1155\/2015\/931256"},{"issue":"1","key":"3592_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (abc) algorithm and applications. Artif Intell Rev 42(1):21\u201357","journal-title":"Artif Intell Rev"},{"key":"3592_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2016.12.005","volume":"33","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, Li C, Yang S (2017) A survey of swarm intelligence for dynamic optimization: algorithms and applications. Swarm Evol Comput 33:1\u201317","journal-title":"Swarm Evol Comput"},{"key":"3592_CR20","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.asoc.2017.02.034","volume":"61","author":"M Shehab","year":"2017","unstructured":"Shehab M, Khader AT, Al-Betar MA (2017) A survey on applications and variants of the cuckoo search algorithm. Appl Soft Comput 61:1041\u20131059","journal-title":"Appl Soft Comput"},{"key":"3592_CR21","doi-asserted-by":"publisher","unstructured":"Tilahun SL, Ngnotchouye JMT, Hamadneh NN (2017) Continuous versions of firefly algorithm: a review. Artif Intell Rev. https:\/\/doi.org\/10.1007\/s10462-017-9568-0","DOI":"10.1007\/s10462-017-9568-0"},{"key":"3592_CR22","first-page":"149","volume":"285","author":"S Gao","year":"2016","unstructured":"Gao S, Wang Y, Cheng J, Inazumi Y, Tang Z (2016) Ant colony optimization with clustering for solving the dynamic location routing problem. Appl Math Comput 285:149\u2013173","journal-title":"Appl Math Comput"},{"key":"3592_CR23","unstructured":"Yang X-S (2011) Metaheuristic optimization: algorithm analysis and open problems. In: International symposium on experimental algorithms. Springer, Berlin, pp 21\u201332"},{"issue":"4","key":"3592_CR24","doi-asserted-by":"publisher","first-page":"6532","DOI":"10.4249\/scholarpedia.6532","volume":"10","author":"F Glover","year":"2015","unstructured":"Glover F, S\u00f6rensen K (2015) Metaheuristics. Scholarpedia 10(4):6532","journal-title":"Scholarpedia"},{"key":"3592_CR25","unstructured":"Sorensen K, Sevaux M, Glover F (2017) A history of metaheuristics. arXiv preprint arXiv:1704.00853"},{"key":"3592_CR26","doi-asserted-by":"publisher","unstructured":"Yang X-S (2012) Swarm-based metaheuristic algorithms and no-free-lunch theorems. Theory and New Applications of Swarm Intelligence Rafael Parpinelli. IntechOpen. https:\/\/doi.org\/10.5772\/30852","DOI":"10.5772\/30852"},{"key":"3592_CR27","doi-asserted-by":"crossref","unstructured":"Leguizam\u00f3n G, Coello CAC (2010) An alternative $$\\text{ACO}_{\\mathbb{R}}$$ ACO R algorithm for continuous optimization problems. In: International conference on swarm intelligence. Springer, Berlin, pp 48\u201359","DOI":"10.1007\/978-3-642-15461-4_5"},{"issue":"2","key":"3592_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1515\/jaiscr-2015-0001","volume":"4","author":"S Cheng","year":"2014","unstructured":"Cheng S, Shi Y, Qin Q, Zhang Q, Bai R (2014) Population diversity maintenance in brain storm optimization algorithm. J Artif Intell Soft Comput Res 4(2):83\u201397","journal-title":"J Artif Intell Soft Comput Res"},{"issue":"2","key":"3592_CR29","first-page":"150","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil M, Yang X-S (2013) A literature survey of benchmark functions for global optimisation problems. Int J Math Model Numer Optim 4(2):150\u2013194","journal-title":"Int J Math Model Numer Optim"},{"issue":"3","key":"3592_CR30","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/21.256541","volume":"23","author":"J-SR Jang","year":"1993","unstructured":"Jang J-SR (1993) Anfis: adaptive-network-based fuzzy inference system. IEEE Trans Syst, Man Cybern 23(3):665\u2013685","journal-title":"IEEE Trans Syst, Man Cybern"},{"key":"3592_CR31","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.asoc.2013.10.014","volume":"15","author":"S Kar","year":"2014","unstructured":"Kar S, Das S, Ghosh PK (2014) Applications of neuro fuzzy systems: a brief review and future outline. Appl Soft Comput 15:243\u2013259","journal-title":"Appl Soft Comput"},{"key":"3592_CR32","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.oceaneng.2015.10.053","volume":"111","author":"M Najafzadeh","year":"2016","unstructured":"Najafzadeh M, Etemad-Shahidi A, Lim SY (2016) Scour prediction in long contractions using anfis and SVM. Ocean Eng 111:128\u2013135","journal-title":"Ocean Eng"},{"key":"3592_CR33","doi-asserted-by":"crossref","unstructured":"Karaboga D, Kaya E (2013) Training anfis using artificial bee colony algorithm. In: 2013 IEEE international symposium on innovations in intelligent systems and applications (INISTA). IEEE, pp 1\u20135","DOI":"10.1109\/INISTA.2013.6577625"},{"key":"3592_CR34","doi-asserted-by":"crossref","unstructured":"Zhan Z, Zhang J, Shi Y, Liu H (2012) A modified brain storm optimization. In: 2012 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2012.6256594"},{"issue":"1","key":"3592_CR35","first-page":"108","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108\u2013132","journal-title":"Appl Math Comput"},{"issue":"1","key":"3592_CR36","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1166\/jctn.2016.4864","volume":"13","author":"NM Nawi","year":"2016","unstructured":"Nawi NM, Rehman MZ, Khan A, Chiroma H, Herawan T (2016) A modified bat algorithm based on gaussian distribution for solving optimization problem. J Comput Theor Nanosci 13(1):706\u2013714","journal-title":"J Comput Theor Nanosci"},{"issue":"9","key":"3592_CR37","doi-asserted-by":"publisher","first-page":"e0163230","DOI":"10.1371\/journal.pone.0163230","volume":"11","author":"L Zhang","year":"2016","unstructured":"Zhang L, Liu L, Yang X-S, Dai Y (2016) A novel hybrid firefly algorithm for global optimization. PloS ONE 11(9):e0163230","journal-title":"PloS ONE"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3592-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3592-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3592-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T14:41:45Z","timestamp":1751726505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3592-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,3]]},"references-count":37,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["3592"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3592-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,3]]},"assertion":[{"value":"19 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}