{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:30:14Z","timestamp":1750177814301,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"GUST","award":["251896"],"award-info":[{"award-number":["251896"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00521-023-08322-5","type":"journal-article","created":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T11:30:32Z","timestamp":1678102232000},"page":"11807-11814","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Laplace\u2019s rule of succession: a simple and efficient way to compare metaheuristics"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4695-6919","authenticated-orcid":false,"given":"Mahamed Ghasib Hussein","family":"Omran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Clerc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"issue":"1","key":"8322_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H Beyer","year":"2002","unstructured":"Beyer H, Schwefel H (2002) Evolution strategies: A comprehensive introduction. Natural Comput 1(1):3\u201352","journal-title":"Natural Comput"},{"key":"8322_CR2","unstructured":"Maurice Clerc (2021) MAMSO (Multi-agents multi-strategies optimiser). https:\/\/hal.archives-ouvertes.fr\/hal-03150719"},{"key":"8322_CR3","first-page":"311","volume-title":"Ant colony optimization: overview and recent advances","author":"M Dorigo","year":"2019","unstructured":"Dorigo M, St\u00fctzle T (2019) Ant colony optimization: overview and recent advances. Springer International Publishing, Cham, pp 311\u2013351"},{"issue":"3","key":"8322_CR4","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1016\/j.eswa.2007.02.002","volume":"34","author":"Coelho L dos Santos","year":"2008","unstructured":"dos Santos Coelho L, Mariani VC (2008) Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization. Expert Syst Appl 34(3):1905\u20131913","journal-title":"Expert Syst Appl"},{"issue":"200","key":"8322_CR5","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675\u2013701","journal-title":"J Am Stat Assoc"},{"key":"8322_CR6","series-title":"Optimization and Machine Learning","volume-title":"Genetic algorithms in search","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic algorithms in search. Optimization and Machine Learning. Addison-Wesley Professional, Boston"},{"issue":"1","key":"8322_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2331554","volume":"6","author":"W Gosset","year":"1908","unstructured":"Gosset W (1908) The probable error of a mean. Biometrika 6(1):1\u201325","journal-title":"Biometrika"},{"issue":"6","key":"8322_CR8","doi-asserted-by":"publisher","first-page":"3275","DOI":"10.1007\/s10489-020-01920-z","volume":"51","author":"H Eghbal","year":"2021","unstructured":"Eghbal H, Kayhan Zrar G, Ali E, Ali Safaa S, Danda BR (2021) Novel metaheuristic based on multiverse theory for optimization problems in emerging systems. Appl Intell 51(6):3275\u20133292","journal-title":"Appl Intell"},{"key":"8322_CR9","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari AA, Mirjalili S, Faris H, Aljarah I, Mafarja M, Chen H (2019) Harris hawks optimization: Algorithm and applications. Future Gener Comput Syst 97:849\u2013872","journal-title":"Future Gener Comput Syst"},{"issue":"5","key":"8322_CR10","doi-asserted-by":"publisher","first-page":"5784","DOI":"10.1007\/s10489-021-02665-z","volume":"52","author":"Fei Han","year":"2022","unstructured":"Han Fei, Zheng Mingpeng, Ling Qinghua (2022) An improved multiobjective particle swarm optimization algorithm based on tripartite competition mechanism. Appl Intell 52(5):5784\u20135816","journal-title":"Appl Intell"},{"issue":"10","key":"8322_CR11","doi-asserted-by":"publisher","first-page":"6798","DOI":"10.1016\/j.eswa.2010.03.046","volume":"37","author":"AH Kayhan","year":"2010","unstructured":"Kayhan AH, Ceylan H, Ayvaz MT, Gurarslan G (2010) Psolver: A new hybrid particle swarm optimization algorithm for solving continuous optimization problems. Expert Syst Appl 37(10):6798\u20136808","journal-title":"Expert Syst Appl"},{"key":"8322_CR12","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R(1995) Particle swarm optimization. In: IEEE international conference on neural networks, pp 1942\u20131948. IEEE","DOI":"10.1109\/ICNN.1995.488968"},{"key":"8322_CR13","volume-title":"Essai philosophique sur les probabilit\u00e9s","author":"P Laplace","year":"1814","unstructured":"Laplace P (1814) Essai philosophique sur les probabilit\u00e9s. Courcier, Paris"},{"key":"8322_CR14","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: A new method for stochastic optimization. Future Gener Comput Syst 111:300\u2013323","journal-title":"Future Gener Comput Syst"},{"key":"8322_CR15","unstructured":"Misuse of p-values (2022) Misuse of $$p$$-values\u2014Wikipedia, the free encyclopedia, [Online; accessed 10-June-2022]"},{"issue":"1","key":"8322_CR16","first-page":"19","volume":"7","author":"RV Rao","year":"2016","unstructured":"Rao RV (2016) Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19\u201334","journal-title":"Int J Ind Eng Comput"},{"key":"8322_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55444-0","volume-title":"The data science design manual","author":"S Skiena","year":"2017","unstructured":"Skiena S (2017) The data science design manual. Springer, Berlin"},{"key":"8322_CR18","unstructured":"Storn R, Price K (1995) Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces. ICSI, Technical report, Berkeley"},{"key":"8322_CR19","volume-title":"The history of statistics: the measurement of uncertainty before 1900","author":"S Stigler","year":"1986","unstructured":"Stigler S (1986) The history of statistics: the measurement of uncertainty before 1900. Belknap Press of Harvard University Press, Cambridge"},{"issue":"6","key":"8322_CR20","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"Frank Wilcoxon","year":"1945","unstructured":"Wilcoxon Frank (1945) Individual comparisons by ranking methods. Biomet Bull 1(6):80\u201383","journal-title":"Biomet Bull"},{"key":"8322_CR21","volume-title":"Nature-inspired optimization algorithms","author":"X-S Yang","year":"2014","unstructured":"Yang X-S (2014) Nature-inspired optimization algorithms. Elsevier, Amsterdam"},{"issue":"7","key":"8322_CR22","doi-asserted-by":"publisher","first-page":"4962","DOI":"10.1007\/s10489-020-02091-7","volume":"51","author":"Xuxu Zhong","year":"2021","unstructured":"Zhong Xuxu, Cheng Peng (2021) An elite-guided hierarchical differential evolution algorithm. Appl Intell 51(7):4962\u20134983","journal-title":"Appl Intell"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08322-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08322-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08322-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T20:56:53Z","timestamp":1729025813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08322-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,6]]},"references-count":22,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["8322"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08322-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2023,3,6]]},"assertion":[{"value":"16 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this article certify that they have NO affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}