{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T14:49:49Z","timestamp":1780584589656,"version":"3.54.1"},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:00:00Z","timestamp":1660262400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:00:00Z","timestamp":1660262400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Single-solution-based optimization algorithms have gained little to no attention by the research community, unlike population-based approaches. This paper proposes a novel optimization algorithm, called Single Candidate Optimizer (SCO), that relies only on a single candidate solution throughout the whole optimization process. The proposed algorithm implements a unique set of equations to effectively update the position of the candidate solution. To balance exploration and exploitation, SCO is integrated with the two-phase strategy where the candidate solution updates its position differently in each phase. The effectiveness of the proposed approach is validated by testing it on thirty three classical benchmarking functions and four real-world engineering problems. SCO is compared with three well-known optimization algorithms, i.e., Particle Swarm Optimization, Grey Wolf Optimizer, and Gravitational Search Algorithm and with four recent high-performance algorithms: Equilibrium Optimizer, Archimedes Optimization Algorithm, Mayfly Algorithm, and Salp Swarm Algorithm. According to Friedman and Wilcoxon rank-sum tests, SCO can significantly outperform all other algorithms for the majority of the investigated problems. The results achieved by SCO motivates the design and development of new single-solution-based optimization algorithms to further improve the performance. The source code of SCO is publicly available at:<jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/uk.mathworks.com\/matlabcentral\/fileexchange\/116100-single-candidate-optimizer\">https:\/\/uk.mathworks.com\/matlabcentral\/fileexchange\/116100-single-candidate-optimizer<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/s12065-022-00762-7","type":"journal-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T16:02:52Z","timestamp":1660320172000},"page":"863-887","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":75,"title":["Single candidate optimizer: a novel optimization algorithm"],"prefix":"10.1007","volume":"17","author":[{"given":"Tareq M.","family":"Shami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Grace","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alister","family":"Burr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul D.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,12]]},"reference":[{"issue":"1","key":"762_CR1","first-page":"1","volume":"3","author":"M Afshar","year":"2010","unstructured":"Afshar M, Faramarzi A (2010) Size optimization of truss structures by cellular automata. J Comput Sci Eng 3(1):1\u20139","journal-title":"J Comput Sci Eng"},{"issue":"3","key":"762_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/10286608.2013.820280","volume":"31","author":"A Faramarzi","year":"2014","unstructured":"Faramarzi A, Afshar M (2014) A novel hybrid cellular automata-linear programming approach for the optimal sizing of planar truss structures. Civil Eng Environ Syst 31(3):209\u2013228","journal-title":"Civil Eng Environ Syst"},{"issue":"1","key":"762_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13638-019-1487-0","volume":"2019","author":"TM Shami","year":"2019","unstructured":"Shami TM, Grace D, Burr A, Vardakas JS (2019) Load balancing and control with interference mitigation in 5G heterogeneous networks. EURASIP J Wireless Commun Netw 2019(1):1\u201312","journal-title":"EURASIP J Wireless Commun Netw"},{"issue":"1","key":"762_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13634-021-00751-5","volume":"2021","author":"S Feng","year":"2021","unstructured":"Feng S, Chen Y, Zhai Q, Huang M, Shu F (2021) Optimizing computation offloading strategy in mobile edge computing based on swarm intelligence algorithms. EURASIP J Adv Signal Process 2021(1):1\u201315","journal-title":"EURASIP J Adv Signal Process"},{"issue":"4","key":"762_CR5","doi-asserted-by":"crossref","first-page":"4285","DOI":"10.1109\/TVT.2020.2973294","volume":"69","author":"Q-V Pham","year":"2020","unstructured":"Pham Q-V, Mirjalili S, Kumar N, Alazab M, Hwang W-J (2020) Whale optimization algorithm with applications to resource allocation in wireless networks. IEEE Trans Vehicular Technol 69(4):4285\u20134297","journal-title":"IEEE Trans Vehicular Technol"},{"issue":"8","key":"762_CR6","doi-asserted-by":"crossref","first-page":"888","DOI":"10.3390\/jmse9080888","volume":"9","author":"Q Al-Tashi","year":"2021","unstructured":"Al-Tashi Q, Akhir EAP, Abdulkadir SJ, Mirjalili S, Shami TM, Alhusssian H, Alqushaibi A, Alwadain A, Balogun AO, Al-Zidi N (2021) Classification of reservoir recovery factor for oil and gas reservoirs: a multi-objective feature selection approach. J Marine Sci Eng 9(8):888","journal-title":"J Marine Sci Eng"},{"issue":"2","key":"762_CR7","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1007\/s00366-019-00882-2","volume":"37","author":"H Moayedi","year":"2021","unstructured":"Moayedi H, Nguyen H, Kok Foong L (2021) Nonlinear evolutionary swarm intelligence of grasshopper optimization algorithm and gray wolf optimization for weight adjustment of neural network. Eng Comput 37(2):1265\u20131275","journal-title":"Eng Comput"},{"key":"762_CR8","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100863","volume":"63","author":"P Singh","year":"2021","unstructured":"Singh P, Chaudhury S, Panigrahi BK (2021) Hybrid mpso-cnn: multi-level particle swarm optimized hyperparameters of convolutional neural network. Swarm Evol Comput 63:100863","journal-title":"Swarm Evol Comput"},{"key":"762_CR9","doi-asserted-by":"crossref","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","journal-title":"Adv Eng Softw"},{"key":"762_CR10","doi-asserted-by":"crossref","unstructured":"Shami TM, El-Saleh AA, Alswaitti M, Al-Tashi Q, Summakieh MA, Mirjalili S (2022) Particle swarm optimization: a comprehensive survey. IEEE Access","DOI":"10.1109\/ACCESS.2022.3142859"},{"key":"762_CR11","doi-asserted-by":"crossref","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","journal-title":"Adv Eng Softw"},{"key":"762_CR12","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks 4:1942\u20131948 . IEEE","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4","key":"762_CR13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"762_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191","journal-title":"Adv Eng Softw"},{"issue":"12","key":"762_CR15","doi-asserted-by":"crossref","first-page":"4831","DOI":"10.1016\/j.cnsns.2012.05.010","volume":"17","author":"AH Gandomi","year":"2012","unstructured":"Gandomi AH, Alavi AH (2012) Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831\u20134845","journal-title":"Commun Nonlinear Sci Numer Simul"},{"issue":"3","key":"762_CR16","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s00500-018-3102-4","volume":"23","author":"S Arora","year":"2019","unstructured":"Arora S, Singh S (2019) Butterfly optimization algorithm: a novel approach for global optimization. Soft Comput 23(3):715\u2013734","journal-title":"Soft Comput"},{"key":"762_CR17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.knosys.2018.11.024","volume":"165","author":"G Dhiman","year":"2019","unstructured":"Dhiman G, Kumar V (2019) Seagull optimization algorithm: theory and its applications for large-scale industrial engineering problems. Knowl Based Syst 165:169\u2013196","journal-title":"Knowl Based Syst"},{"key":"762_CR18","doi-asserted-by":"crossref","unstructured":"Yang XS, Deb S (2009) Cuckoo search via l\u00e9vy flights. In: 2009 World congress on nature and biologically inspired computing (NaBIC), pp 210\u2013214. IEEE","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"762_CR19","unstructured":"Holland J (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor"},{"key":"762_CR20","volume-title":"Artificial intelligence through simulated evolution","author":"DB Fogel","year":"1998","unstructured":"Fogel DB (1998) Artificial intelligence through simulated evolution. Wiley-IEEE Press, London"},{"issue":"4","key":"762_CR21","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Glob Opt 11(4):341\u2013359","journal-title":"J Glob Opt"},{"issue":"1","key":"762_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen N, M\u00fcller SD, Koumoutsakos P (2003) Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol Comput 11(1):1\u201318","journal-title":"Evol Comput"},{"key":"762_CR23","doi-asserted-by":"crossref","unstructured":"Kirkpatrick S, Gelatt Jr CD, Vecchi MP (1987) Optimization by simulated annealing. In: Readings in computer vision, pp 606\u2013615. Elsevier","DOI":"10.1016\/B978-0-08-051581-6.50059-3"},{"issue":"13","key":"762_CR24","doi-asserted-by":"crossref","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 179(13):2232\u20132248","journal-title":"Inf Sci"},{"key":"762_CR25","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.105190","volume":"191","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi A, Heidarinejad M, Stephens B, Mirjalili S (2020) Equilibrium optimizer: a novel optimization algorithm. Knowl Based Syst 191:105190","journal-title":"Knowl Based Syst"},{"key":"762_CR26","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.future.2019.07.015","volume":"101","author":"FA Hashim","year":"2019","unstructured":"Hashim FA, Houssein EH, Mabrouk MS, Al-Atabany W, Mirjalili S (2019) Henry gas solubility optimization: a novel physics-based algorithm. Future Generation Comput Syst 101:646\u2013667","journal-title":"Future Generation Comput Syst"},{"key":"762_CR27","doi-asserted-by":"crossref","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 Generation Comput Syst 97:849\u2013872","journal-title":"Future Generation Comput Syst"},{"key":"762_CR28","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.knosys.2018.08.030","volume":"163","author":"W Zhao","year":"2019","unstructured":"Zhao W, Wang L, Zhang Z (2019) Atom search optimization and its application to solve a hydrogeologic parameter estimation problem. Knowl Based Syst 163:283\u2013304","journal-title":"Knowl Based Syst"},{"key":"762_CR29","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.asoc.2019.03.012","volume":"78","author":"H Yapici","year":"2019","unstructured":"Yapici H, Cetinkaya N (2019) A new meta-heuristic optimizer: pathfinder algorithm. Appl Soft Comput 78:545\u2013568","journal-title":"Appl Soft Comput"},{"key":"762_CR30","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.engappai.2019.01.001","volume":"80","author":"S Shadravan","year":"2019","unstructured":"Shadravan S, Naji H, Bardsiri VK (2019) The sailfish optimizer: a novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems. Eng Appl Artif Intell 80:20\u201334","journal-title":"Eng Appl Artif Intell"},{"key":"762_CR31","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113377","volume":"152","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi A, Heidarinejad M, Mirjalili S, Gandomi AH (2020) Marine predators algorithm: a nature-inspired metaheuristic. Exp Syst Appl 152:113377","journal-title":"Exp Syst Appl"},{"key":"762_CR32","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113702","volume":"161","author":"Q Askari","year":"2020","unstructured":"Askari Q, Saeed M, Younas I (2020) Heap-based optimizer inspired by corporate rank hierarchy for global optimization. Exp Syst Appl 161:113702","journal-title":"Exp Syst Appl"},{"key":"762_CR33","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.ins.2020.06.037","volume":"540","author":"I Ahmadianfar","year":"2020","unstructured":"Ahmadianfar I, Bozorg-Haddad O, Chu X (2020) Gradient-based optimizer: a new metaheuristic optimization algorithm. Inf Sci 540:131\u2013159","journal-title":"Inf Sci"},{"key":"762_CR34","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106559","volume":"145","author":"K Zervoudakis","year":"2020","unstructured":"Zervoudakis K, Tsafarakis S (2020) A mayfly optimization algorithm. Comput Ind Eng 145:106559","journal-title":"Comput Ind Eng"},{"issue":"17","key":"762_CR35","doi-asserted-by":"crossref","first-page":"13003","DOI":"10.1007\/s00500-020-04721-1","volume":"24","author":"A Ghasemi-Marzbali","year":"2020","unstructured":"Ghasemi-Marzbali A (2020) A novel nature-inspired meta-heuristic algorithm for optimization: bear smell search algorithm. Soft Comput 24(17):13003\u201313035","journal-title":"Soft Comput"},{"key":"762_CR36","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.105709","volume":"195","author":"Q Askari","year":"2020","unstructured":"Askari Q, Younas I, Saeed M (2020) Political optimizer: a novel socio-inspired meta-heuristic for global optimization. Knowl Based Syst 195:105709","journal-title":"Knowl Based Syst"},{"key":"762_CR37","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113246","volume":"148","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Jin Z (2020) Group teaching optimization algorithm: a novel metaheuristic method for solving global optimization problems. Exp Syst Appl 148:113246","journal-title":"Exp Syst Appl"},{"key":"762_CR38","doi-asserted-by":"crossref","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A, Mirjalili S, Abd Elaziz M, Gandomi AH (2021) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:113609","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"3","key":"762_CR39","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1007\/s10489-020-01893-z","volume":"51","author":"FA Hashim","year":"2021","unstructured":"Hashim FA, Hussain K, Houssein EH, Mabrouk MS, Al-Atabany W (2021) Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems. Appl Intell 51(3):1531\u20131551","journal-title":"Appl Intell"},{"key":"762_CR40","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107250","volume":"157","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Yousri D, Abd Elaziz M, Ewees AA, Al-qaness MA, Gandomi AH (2021) Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput Ind Eng 157:107250","journal-title":"Comput Ind Eng"},{"key":"762_CR41","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114107","volume":"166","author":"D Po\u0142ap","year":"2021","unstructured":"Po\u0142ap D, Wo\u017aniak M (2021) Red fox optimization algorithm. Exp Syst Appl 166:114107","journal-title":"Exp Syst Appl"},{"key":"762_CR42","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.106711","volume":"213","author":"F MiarNaeimi","year":"2021","unstructured":"MiarNaeimi F, Azizyan G, Rashki M (2021) Horse herd optimization algorithm: a nature-inspired algorithm for high-dimensional optimization problems. Knowl Based Syst 213:106711","journal-title":"Knowl Based Syst"},{"key":"762_CR43","volume":"185","author":"H Jia","year":"2021","unstructured":"Jia H, Peng X, Lang C (2021) Remora optimization algorithm. Exp Syst Appl 185:115665","journal-title":"Exp Syst Appl"},{"key":"762_CR44","doi-asserted-by":"crossref","DOI":"10.1016\/j.cma.2022.114570","volume":"391","author":"JO Agushaka","year":"2022","unstructured":"Agushaka JO, Ezugwu AE, Abualigah L (2022) Dwarf mongoose optimization algorithm. Comput Methods Appl Mech Eng 391:114570","journal-title":"Comput Methods Appl Mech Eng"},{"key":"762_CR45","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.108320","volume":"242","author":"FA Hashim","year":"2022","unstructured":"Hashim FA, Hussien AG (2022) Snake optimizer: a novel meta-heuristic optimization algorithm. Knowl Based Syst 242:108320","journal-title":"Knowl Based Syst"},{"key":"762_CR46","doi-asserted-by":"crossref","first-page":"16150","DOI":"10.1109\/ACCESS.2022.3147821","volume":"10","author":"ON Oyelade","year":"2022","unstructured":"Oyelade ON, Ezugwu AE-S, Mohamed TI, Abualigah L (2022) Ebola optimization search algorithm: a new nature-inspired metaheuristic optimization algorithm. IEEE Access 10:16150\u201316177","journal-title":"IEEE Access"},{"key":"762_CR47","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.116158","volume":"191","author":"L Abualigah","year":"2022","unstructured":"Abualigah L, Abd Elaziz M, Sumari P, Geem ZW, Gandomi AH (2022) Reptile search algorithm (rsa): a nature-inspired meta-heuristic optimizer. Exp Syst Appl 191:116158","journal-title":"Exp Syst Appl"},{"key":"762_CR48","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl Based Syst 96:120\u2013133","journal-title":"Knowl Based Syst"},{"key":"762_CR49","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.compstruc.2012.07.010","volume":"110","author":"H Eskandar","year":"2012","unstructured":"Eskandar H, Sadollah A, Bahreininejad A, Hamdi M (2012) Water cycle algorithm\u2014a novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput Struct 110:151\u2013166","journal-title":"Comput Struct"},{"key":"762_CR50","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175\u2013184","journal-title":"Inf Sci"},{"key":"762_CR51","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.advengsoft.2017.03.014","volume":"110","author":"A Kaveh","year":"2017","unstructured":"Kaveh A, Dadras A (2017) A novel meta-heuristic optimization algorithm: thermal exchange optimization. Adv Eng Softw 110:69\u201384","journal-title":"Adv Eng Softw"},{"key":"762_CR52","doi-asserted-by":"crossref","unstructured":"Borji A (2007) A new global optimization algorithm inspired by parliamentary political competitions. In: Mexican international conference on artificial intelligence, pp 61\u201371 . Springer","DOI":"10.1007\/978-3-540-76631-5_7"},{"issue":"3","key":"762_CR53","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao RV, Savsani VJ, Vakharia D (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":"1","key":"762_CR54","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1016\/j.procs.2010.04.153","volume":"1","author":"W Lv","year":"2010","unstructured":"Lv W, He C, Li D, Cheng S, Luo S, Zhang X (2010) Election campaign optimization algorithm. Proc Comput Sci 1(1):1377\u20131386","journal-title":"Proc Comput Sci"},{"key":"762_CR55","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.swevo.2017.05.001","volume":"37","author":"M El-Abd","year":"2017","unstructured":"El-Abd M (2017) Global-best brain storm optimization algorithm. Swarm Evol Comput 37:27\u201344","journal-title":"Swarm Evol Comput"},{"key":"762_CR56","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.asoc.2014.02.006","volume":"19","author":"N Ghorbani","year":"2014","unstructured":"Ghorbani N, Babaei E (2014) Exchange market algorithm. Appl Soft Comput 19:177\u2013187","journal-title":"Appl Soft Comput"},{"issue":"1","key":"762_CR57","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s42044-018-0025-2","volume":"2","author":"M Bodaghi","year":"2019","unstructured":"Bodaghi M, Samieefar K (2019) Meta-heuristic bus transportation algorithm. Iran J Comput Sci 2(1):23\u201332","journal-title":"Iran J Comput Sci"},{"key":"762_CR58","volume":"146","author":"B Das","year":"2020","unstructured":"Das B, Mukherjee V, Das D (2020) Student psychology based optimization algorithm: a new population based optimization algorithm for solving optimization problems. Adv Eng Softw 146:102804","journal-title":"Adv Eng Softw"},{"issue":"4","key":"762_CR59","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10462-016-9486-6","volume":"47","author":"S Akyol","year":"2017","unstructured":"Akyol S, Alatas B (2017) Plant intelligence based metaheuristic optimization algorithms. Artif Intell Rev 47(4):417\u2013462","journal-title":"Artif Intell Rev"},{"key":"762_CR60","doi-asserted-by":"crossref","unstructured":"Alatas B, Bingol H (2020) Comparative assessment of light-based intelligent search and optimization algorithms. Light Eng 28(6)","DOI":"10.33383\/2019-029"},{"issue":"3","key":"762_CR61","doi-asserted-by":"crossref","first-page":"373","DOI":"10.5755\/j01.itc.48.3.20627","volume":"48","author":"B Alatas","year":"2019","unstructured":"Alatas B, Bingol H (2019) A physics based novel approach for travelling tournament problem: optics inspired optimization. Inf Technol Control 48(3):373\u2013388","journal-title":"Inf Technol Control"},{"key":"762_CR62","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2020.110434","volume":"141","author":"H Bingol","year":"2020","unstructured":"Bingol H, Alatas B (2020) Chaos based optics inspired optimization algorithms as global solution search approach. Chaos Solitons Fractals 141:110434","journal-title":"Chaos Solitons Fractals"},{"key":"762_CR63","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1998) Tabu search. In: Handbook of combinatorial optimization, pp 2093\u20132229. Springer","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"762_CR64","doi-asserted-by":"crossref","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","journal-title":"Knowl Based Syst"},{"key":"762_CR65","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.matcom.2021.08.013","volume":"192","author":"FA Hashim","year":"2022","unstructured":"Hashim FA, Houssein EH, Hussain K, Mabrouk MS, Al-Atabany W (2022) Honey badger algorithm: New metaheuristic algorithm for solving optimization problems. Math Comput Simul 192:84\u2013110","journal-title":"Math Comput Simul"},{"key":"762_CR66","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.advengsoft.2015.01.010","volume":"83","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80\u201398","journal-title":"Adv Eng Softw"},{"key":"762_CR67","doi-asserted-by":"crossref","first-page":"25073","DOI":"10.1109\/ACCESS.2022.3153493","volume":"10","author":"TS Ayyarao","year":"2022","unstructured":"Ayyarao TS, RamaKrishna N, Elavarasan RM, Polumahanthi N, Rambabu M, Saini G, Khan B, Alatas B (2022) War strategy optimization algorithm: a new effective metaheuristic algorithm for global optimization. IEEE Access 10:25073\u201325105","journal-title":"IEEE Access"},{"issue":"10","key":"762_CR68","doi-asserted-by":"crossref","first-page":"13170","DOI":"10.1016\/j.eswa.2011.04.126","volume":"38","author":"B Alatas","year":"2011","unstructured":"Alatas B (2011) Acroa: artificial chemical reaction optimization algorithm for global optimization. Exp Syst Appl 38(10):13170\u201313180","journal-title":"Exp Syst Appl"},{"issue":"1","key":"762_CR69","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67\u201382","journal-title":"IEEE Trans Evolut Comput"},{"issue":"2","key":"762_CR70","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"762_CR71","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1080\/00207160108805080","volume":"77","author":"JG Digalakis","year":"2001","unstructured":"Digalakis JG, Margaritis KG (2001) On benchmarking functions for genetic algorithms. Int J Comput Math 77(4):481\u2013506","journal-title":"Int J Comput Math"},{"key":"762_CR72","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1\u201314","journal-title":"Swarm Evol Comput"},{"key":"762_CR73","doi-asserted-by":"crossref","unstructured":"Tanabe R, Fukunaga A (2013) Success-history based parameter adaptation for differential evolution. In: 2013 IEEE congress on evolutionary computation, pp 71\u201378 . IEEE","DOI":"10.1109\/CEC.2013.6557555"},{"key":"762_CR74","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.asoc.2017.11.050","volume":"64","author":"X He","year":"2018","unstructured":"He X, Zhou Y (2018) Enhancing the performance of differential evolution with covariance matrix self-adaptation. Appl Soft Comput 64:227\u2013243","journal-title":"Appl Soft Comput"},{"issue":"5","key":"762_CR75","first-page":"21","volume":"1","author":"M Pant","year":"2009","unstructured":"Pant M, Thangaraj R, Singh V (2009) Optimization of mechanical design problems using improved differential evolution algorithm. Int J Recent Trends Eng 1(5):21","journal-title":"Int J Recent Trends Eng"},{"issue":"3","key":"762_CR76","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2004.826069","volume":"8","author":"F Van den Bergh","year":"2004","unstructured":"Van den Bergh F, Engelbrecht AP (2004) A cooperative approach to particle swarm optimization. IEEE Trans Evol Comput 8(3):225\u2013239","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"762_CR77","first-page":"262","volume":"7","author":"A Gharaei","year":"2020","unstructured":"Gharaei A, Hoseini Shekarabi SA, Karimi M (2020) Modelling and optimal lot-sizing of the replenishments in constrained, multi-product and bi-objective EPQ models with defective products: Generalised cross decomposition. Int J Syst Sci Oper Logist 7(3):262\u2013274","journal-title":"Int J Syst Sci Oper Logist"},{"issue":"4","key":"762_CR78","first-page":"309","volume":"7","author":"A Gharaei","year":"2020","unstructured":"Gharaei A, Karimi M, Hoseini Shekarabi SA (2020) Joint economic lot-sizing in multi-product multi-level integrated supply chains: Generalized benders decomposition. Int J Syst Sci Oper Logist 7(4):309\u2013325","journal-title":"Int J Syst Sci Oper Logist"},{"key":"762_CR79","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.eswa.2017.08.050","volume":"91","author":"M Alswaitti","year":"2018","unstructured":"Alswaitti M, Albughdadi M, Isa NAM (2018) Density-based particle swarm optimization algorithm for data clustering. Exp Syst Appl 91:170\u2013186","journal-title":"Exp Syst Appl"},{"key":"762_CR80","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.swevo.2019.06.002","volume":"49","author":"Y Wang","year":"2019","unstructured":"Wang Y, Zhang H, Zhang G (2019) cPSO-CNN: An efficient pso-based algorithm for fine-tuning hyper-parameters of convolutional neural networks. Swarm Evol Comput 49:114\u2013123","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"762_CR81","first-page":"162","volume":"6","author":"M Rabbani","year":"2019","unstructured":"Rabbani M, Foroozesh N, Mousavi SM, Farrokhi-Asl H (2019) Sustainable supplier selection by a new decision model based on interval-valued Fuzzy sets and possibilistic statistical reference point systems under uncertainty. Int J Syst Sci Oper Logist 6(2):162\u2013178","journal-title":"Int J Syst Sci Oper Logist"},{"issue":"23","key":"762_CR82","doi-asserted-by":"crossref","first-page":"7160","DOI":"10.1080\/00207543.2018.1436789","volume":"56","author":"C Duan","year":"2018","unstructured":"Duan C, Deng C, Gharaei A, Wu J, Wang B (2018) Selective maintenance scheduling under stochastic maintenance quality with multiple maintenance actions. Int J Prod Res 56(23):7160\u20137178","journal-title":"Int J Prod Res"},{"key":"762_CR83","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.103731","volume":"94","author":"EH Houssein","year":"2020","unstructured":"Houssein EH, Saad MR, Hashim FA, Shaban H, Hassaballah M (2020) L\u00e9vy flight distribution: a new metaheuristic algorithm for solving engineering optimization problems. Eng Appl Artif Intell 94:103731","journal-title":"Eng Appl Artif Intell"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-022-00762-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-022-00762-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-022-00762-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T12:29:46Z","timestamp":1727785786000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-022-00762-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,12]]},"references-count":83,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["762"],"URL":"https:\/\/doi.org\/10.1007\/s12065-022-00762-7","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,12]]},"assertion":[{"value":"8 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no financial or personal relationships related to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}