{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:36:56Z","timestamp":1781105816987,"version":"3.54.1"},"reference-count":23,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"abstract":"<jats:p>Swarm intelligence (SI) algorithms are handy tools for solving complex optimization problems. When problems grow in size and complexity, an increase in population or number of iterations might be required in order to achieve a good solution. These adjustments also impact the execution time. This article investigates the trade-off involving population size, number of iterations and problem complexity, aiming to improve the efficiency of SI algorithms. Results based on a parallel implementation of Fish School Search show that increasing the population size is beneficial for finding good solutions. However, we observed an asymptotic behavior, i.e. increasing the population over a certain threshold only leads to slight improvements. Furthermore, the execution time was analyzed.<\/jats:p>","DOI":"10.4018\/ijsir.2018100101","type":"journal-article","created":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T09:39:09Z","timestamp":1535535549000},"page":"1-20","source":"Crossref","is-referenced-by-count":2,"title":["Parameter Selection for Swarm Intelligence Algorithms"],"prefix":"10.4018","volume":"9","author":[{"given":"Breno A. M.","family":"Menezes","sequence":"first","affiliation":[{"name":"University of Muenster, Muenster, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Wrede","sequence":"additional","affiliation":[{"name":"University of Muenster, Muenster, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Herbert","family":"Kuchen","sequence":"additional","affiliation":[{"name":"University of Muenster, Muenster, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fernando B. Lima","family":"Neto","sequence":"additional","affiliation":[{"name":"University of Pernambuco, Recife, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJSIR.2018100101-0","doi-asserted-by":"publisher","DOI":"10.1504\/IJICA.2007.013403"},{"key":"IJSIR.2018100101-1","doi-asserted-by":"crossref","first-page":"2646","DOI":"10.1109\/ICSMC.2008.4811695","article-title":"A novel search algorithm based on fish school behavior.","author":"C. J. A.Bastos Filho","year":"2008","journal-title":"Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC \u201908)"},{"key":"IJSIR.2018100101-2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.2010.23"},{"key":"IJSIR.2018100101-3","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"IJSIR.2018100101-4","doi-asserted-by":"publisher","DOI":"10.1504\/IJHPCN.2012.046370"},{"key":"IJSIR.2018100101-5","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-016-0416-7"},{"issue":"3","key":"IJSIR.2018100101-6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1162\/evco.1999.7.3.231","article-title":"The Gambler\u2019s Ruin Problem, Genetic Algorithms, and the Sizing of Populations.","volume":"7","author":"G.Harik","year":"1999","journal-title":"Evolutionary Computation"},{"key":"IJSIR.2018100101-7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45706-2_86"},{"key":"IJSIR.2018100101-8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12745-3_8"},{"key":"IJSIR.2018100101-9","doi-asserted-by":"publisher","DOI":"10.5772\/30360"},{"key":"IJSIR.2018100101-10","doi-asserted-by":"crossref","unstructured":"Malan, K. M. (2014). Characterising continuous optimisation problems for particle swarm optimisation performance prediction. Unpublished doctoral dissertation, University of Pretoria, Pretoria.","DOI":"10.1007\/s11721-014-0099-x"},{"key":"IJSIR.2018100101-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.04.015"},{"key":"IJSIR.2018100101-12","unstructured":"Mathworks. (2018). Minimize Rastrigin's Function. Retrieved from https:\/\/www.mathworks.com\/help\/gads\/example-rastrigins-function.html"},{"issue":"2","key":"IJSIR.2018100101-13","first-page":"38","article-title":"Benchmark Fitness Landscape Analysis.","volume":"12","author":"G.Merkuryeva","year":"2011","journal-title":"International Journal of Simulation"},{"key":"IJSIR.2018100101-14","doi-asserted-by":"publisher","DOI":"10.1109\/ICEESE.2013.6895041"},{"key":"IJSIR.2018100101-15","unstructured":"Pessoa, L. F. A., Horstkemper, D., Braga, D. S., Hellingrath, B., Lacerda, M. G. P., & Lima Neto, F. B. (2013). Comparison of Optimization Techniques for Complex Supply Chain Network Planning Problems. In Proceedings of the XXVII ANPET - Congresso Nacional de Pesquisa e Ensino em Transporte."},{"key":"IJSIR.2018100101-16","first-page":"107","author":"O.Roeva","year":"2015","journal-title":"Population Size Influence on the Genetic and Ant Algorithms Performance in Case of Cultivation Process Modeling. In Recent Advances in Computational Optimization. Studies in Computational Intelligence"},{"key":"IJSIR.2018100101-17","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299920"},{"key":"IJSIR.2018100101-18","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916"},{"key":"IJSIR.2018100101-19","first-page":"892","article-title":"Effects of swarm size on cooperative particle swarm optimizers.","author":"F.Van Den Bergh","year":"2001","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)"},{"key":"IJSIR.2018100101-20","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568095"},{"key":"IJSIR.2018100101-21","unstructured":"Wikimedia. (2009). Rosenbrock function. Retrieved from: https:\/\/commons.wikimedia.org\/wiki\/File:Rosenbrock_function.svg"},{"key":"IJSIR.2018100101-22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIEA.2012.6496632"}],"container-title":["International Journal of Swarm Intelligence Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=212752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T06:15:24Z","timestamp":1651817724000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJSIR.2018100101"}},"subtitle":["Case Study on Parallel Implementation of FSS"],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":23,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.4018\/ijsir.2018100101","relation":{},"ISSN":["1947-9263","1947-9271"],"issn-type":[{"value":"1947-9263","type":"print"},{"value":"1947-9271","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}