{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T22:14:22Z","timestamp":1776204862908,"version":"3.50.1"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T00:00:00Z","timestamp":1680912000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T00:00:00Z","timestamp":1680912000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00500-023-08084-1","type":"journal-article","created":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T15:02:37Z","timestamp":1680966157000},"page":"9501-9518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lens law based optimization algorithm: a novel approach"],"prefix":"10.1007","volume":"27","author":[{"given":"Byamakesh","family":"Nayak","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0618-5312","authenticated-orcid":false,"given":"Tanmoy","family":"Roy Choudhury","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,8]]},"reference":[{"key":"8084_CR1","doi-asserted-by":"crossref","unstructured":"Abbass HA (2001) MBO: marriage in honey bees optimization: a haplometrosis polygynous swarming approach. In: Evolutionary computation, 2001. Proceedings of the 2001 congress on, pp 207\u2013214","DOI":"10.1109\/CEC.2001.934391"},{"key":"8084_CR2","doi-asserted-by":"publisher","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. Expert Syst Appl 38:13170\u201313180","journal-title":"Expert Syst Appl"},{"key":"8084_CR3","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TEVC.2005.843751","volume":"9","author":"E Alba","year":"2005","unstructured":"Alba E, Dorronsoro B (2005) The exploration\/exploitation tradeoff in dynamic cellular genetic algorithms. Evolut Comput IEEE Trans 9:126\u2013142","journal-title":"Evolut Comput IEEE Trans"},{"key":"8084_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012064155-0\/50012-4","volume-title":"Introduction to optimum design","author":"JS Arora","year":"2004","unstructured":"Arora JS (2004) Introduction to optimum design. Academic Press"},{"key":"8084_CR5","first-page":"1983","volume":"43","author":"AD Belegundu","year":"1983","unstructured":"Belegundu AD (1983) Study of mathematical programming methods for structural optimization. Diss Abstr Int Part b: Sci Eng 43:1983","journal-title":"Diss Abstr Int Part b: Sci Eng"},{"key":"8084_CR6","doi-asserted-by":"crossref","unstructured":"Biswas A, Mishra K, Tiwari S, Misra A (2013) Physics-inspired optimization algorithms: a survey, J Optim 2013","DOI":"10.1155\/2013\/438152"},{"key":"8084_CR7","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm intelligence: from natural to artificial systems","author":"E Bonabeau","year":"1999","unstructured":"Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence: from natural to artificial systems. OUP"},{"key":"8084_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussa\u00efd","year":"2013","unstructured":"Boussa\u00efd I, Lepagnot J, Siarry P (2013) A survey on optimization metaheuristics. Inf Sci 237:82\u2013117","journal-title":"Inf Sci"},{"key":"8084_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-3615(99)00046-9","volume":"41","author":"CAC Coello","year":"2000","unstructured":"Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113\u2013127","journal-title":"Comput Ind"},{"key":"8084_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-3615(99)00046-9","volume":"41","author":"CAC Coello","year":"2000","unstructured":"Coello CAC (2000) Use of a self-adaptive penalty approach for engineering op- imization problems. Comput Ind 41:113\u2013127","journal-title":"Comput Ind"},{"key":"8084_CR11","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CAC Coello","year":"2002","unstructured":"Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191:1245\u20131287","journal-title":"Comput Methods Appl Mech Eng"},{"key":"8084_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S1474-0346(02)00011-3","volume":"16","author":"CAC Coello","year":"2002","unstructured":"Coello CAC, Mezura ME (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inform 16:193\u2013203","journal-title":"Adv Eng Inform"},{"key":"8084_CR13","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/00207160108805080","volume":"77","author":"J Digalakis","year":"2001","unstructured":"Digalakis J, Margaritis K (2001) On benchmarking functions for genetic algorithms. Int J Comput Math 77:481\u2013506","journal-title":"Int J Comput Math"},{"key":"8084_CR14","doi-asserted-by":"publisher","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. Comput Intell Magaz IEEE 1:28\u201339","journal-title":"Comput Intell Magaz IEEE"},{"key":"8084_CR15","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.advengsoft.2005.04.005","volume":"37","author":"OK Erol","year":"2006","unstructured":"Erol OK, Eksin I (2006) A new optimization method: big bang\u2013big crunch. Adv Eng Softw 37:106\u2013111","journal-title":"Adv Eng Softw"},{"key":"8084_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544600.ch7","volume-title":"Artificial intelligence through simulated evolution","author":"D Fogel","year":"2009","unstructured":"Fogel D (2009) Artificial intelligence through simulated evolution. Wiley-IEEE Press"},{"key":"8084_CR17","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2528\/PIER07082403","volume":"77","author":"RA Formato","year":"2007","unstructured":"Formato RA (2007) Central force optimization: a new metaheuristic with applications in applied electromagnetics. Prog Electromag Res 77:425\u2013491","journal-title":"Prog Electromag Res"},{"issue":"12","key":"8084_CR18","doi-asserted-by":"publisher","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"},{"key":"8084_CR19","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1007\/s11831-021-09624-4","volume":"29","author":"S Ghafori","year":"2022","unstructured":"Ghafori S, Gharehchopogh FS (2022) Advances in Spotted Hyena Optimizer: A Comprehensive Survey. Arch Computat Methods Eng 29:1569\u20131590. https:\/\/doi.org\/10.1007\/s11831-021-09624-4","journal-title":"Arch Computat Methods Eng"},{"key":"8084_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2019.03.004","volume":"48","author":"FS Gharehchopogh","year":"2019","unstructured":"Gharehchopogh FS, Gholizadeh H (2019) A comprehensive survey: whale optimization algorithm and its applications. Swarm Evolut Comput 48:1\u201324. https:\/\/doi.org\/10.1016\/j.swevo.2019.03.004","journal-title":"Swarm Evolut Comput"},{"key":"8084_CR21","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1007\/s10462-019-09733-4","volume":"53","author":"FS Gharehchopogh","year":"2020","unstructured":"Gharehchopogh FS, Shayanfar H, Gholizadeh H (2020) A comprehensive survey on symbiotic organisms search algorithms. Artif Intell Rev 53:2265\u20132312. https:\/\/doi.org\/10.1007\/s10462-019-09733-4","journal-title":"Artif Intell Rev"},{"key":"8084_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11831-022-09804-w","volume":"30","author":"FS Gharehchopogh","year":"2023","unstructured":"Gharehchopogh FS, Namazi M, Ebrahimi L et al (2023) Advances in sparrow search algorithm: a comprehensive survey. Arch Computat Methods Eng 30:427\u2013455. https:\/\/doi.org\/10.1007\/s11831-022-09804-w","journal-title":"Arch Computat Methods Eng"},{"key":"8084_CR23","volume-title":"Introduction to evolutionary computing","author":"D Goldberg","year":"2003","unstructured":"Goldberg D (2003) Genetic algorithms in optimization, search and machine learning, Addison Wesley, New York. In: Eiben AE, Smith JE (eds) Introduction to evolutionary computing. Springer"},{"key":"8084_CR24","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2012","unstructured":"Hatamlou A (2012) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175\u2013184","journal-title":"Inf Sci"},{"key":"8084_CR25","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic algorithms. Sci Am 267:66\u201372","journal-title":"Sci Am"},{"key":"8084_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/1045343.1045373","volume":"63","author":"JH Holland","year":"1977","unstructured":"Holland JH, Reitman JS (1977) Cognitive systems based on adaptive algorithms. ACM SIGART Bull 63:49\u201349","journal-title":"ACM SIGART Bull"},{"key":"8084_CR27","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.amc.2006.07.105","volume":"186","author":"F Huang","year":"2007","unstructured":"Huang F, Wang L, He Q (2007) An effective co-evolutionary differential evolution forconstrained optimization. Appl Math Comput 186:340\u2013356","journal-title":"Appl Math Comput"},{"issue":"1989","key":"8084_CR28","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-49197-2_23","volume":"905","author":"J Jacq","year":"1995","unstructured":"Jacq J, Roux C (1995) Registration of nonsegmentedimages using a genetic algorithm. Lect Notes Comput Sci 905(1989):205\u2013211","journal-title":"Lect Notes Comput Sci"},{"key":"8084_CR29","volume-title":"Introduction to stochastics search and optimization","author":"C James","year":"2003","unstructured":"James C (2003) Introduction to stochastics search and optimization. Wiley-Interscience, NewJersey"},{"key":"8084_CR30","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.asoc.2013.12.005","volume":"16","author":"AH Kashan","year":"2014","unstructured":"Kashan AH (2014) League Championship algorithm (LCA):an algorithm for global optimization inspired by sport championships. Appl Soft Comput 16:171\u2013200","journal-title":"Appl Soft Comput"},{"key":"8084_CR31","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.compstruc.2012.09.003","volume":"112","author":"A Kaveh","year":"2012","unstructured":"Kaveh A, Khayatazad M (2012) A new meta-heuristic method: ray optimization. Comput Struct 112:283\u2013294","journal-title":"Comput Struct"},{"key":"8084_CR32","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00707-009-0270-4","volume":"213","author":"A Kaveh","year":"2010","unstructured":"Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mech 213:267\u2013289","journal-title":"Acta Mech"},{"key":"8084_CR33","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization, in Neural Networks, 1995. In: Proceedings, IEEE international conference on, pp 1942\u20131948"},{"key":"8084_CR34","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on systems, man, and cybernetics"},{"key":"8084_CR35","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick Jr","year":"1983","unstructured":"Kirkpatrick S Jr, Gelatt DG, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"8084_CR36","doi-asserted-by":"crossref","unstructured":"Koza JR (1992) Genetic programming","DOI":"10.1177\/105971239200100203"},{"key":"8084_CR37","unstructured":"Li X (2003) A new intelligent optimization-artificial fish swarm algorithm. Doctor thesis, Zhejiang University of Zhejiang"},{"key":"8084_CR38","doi-asserted-by":"crossref","unstructured":"Liang J, Suganthan P, Deb K (2005) Novel composition test functions for numerical global ptimization. In: Swarm intelligence symposium, 2005. SIS 2005. proceedings 2005 IEEE, pp 68\u201375","DOI":"10.1109\/SIS.2005.1501604"},{"key":"8084_CR39","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00500-008-0303-2","volume":"13","author":"L Lin","year":"2009","unstructured":"Lin L, Gen M (2009) Auto-tuning strategy for evolutionary algorithms: balancing between exploration and exploitation. Soft Comput 13:157\u2013168","journal-title":"Soft Comput"},{"key":"8084_CR40","doi-asserted-by":"crossref","unstructured":"Lu X, Zhou Y (2008) A novel global convergence algorithm: bee collecting pollen algorithm. In: Advanced intelligent computing theories and applications. With aspects of artificial intelligence, Springer, pp 518\u201325","DOI":"10.1007\/978-3-540-85984-0_62"},{"key":"8084_CR41","doi-asserted-by":"publisher","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 Evolut Comput 9:1\u201314","journal-title":"Swarm Evolut Comput"},{"key":"8084_CR42","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","journal-title":"Adv Eng Softw"},{"key":"8084_CR43","doi-asserted-by":"crossref","first-page":"11125","DOI":"10.1016\/j.amc.2012.04.069","volume":"218","author":"S Mirjalili","year":"2012","unstructured":"Mirjalili S, Mohd Hashim SZ, Moradian SH (2012) Training feedforward neural networks using hybrid particle swarm optimization and gravitational search algorithm. Appl Math Comput 218:11125\u201311137","journal-title":"Appl Math Comput"},{"key":"8084_CR44","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","journal-title":"Adv Eng Softw"},{"key":"8084_CR45","doi-asserted-by":"crossref","unstructured":"Mirjalili S, Hashim SZM (2010) A new hybrid PSOGSA algorithm for function optimization. In: Computer and information application (ICCIA), 2010 international conference on, pp 374\u201377","DOI":"10.1109\/ICCIA.2010.6141614"},{"issue":"1","key":"8084_CR46","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1108\/WJE-04-2017-0093","volume":"15","author":"A Mohapatra","year":"2018","unstructured":"Mohapatra A, Nayak B (2018) Parameter estimation of single diode PV module based on Nelder-Mead optimization algorithm World. J Eng 15(1):70\u201381. https:\/\/doi.org\/10.1108\/WJE-04-2017-0093","journal-title":"J Eng"},{"key":"8084_CR47","doi-asserted-by":"crossref","unstructured":"Mucherino A, Seref O (2007) Monkey search: a novel metaheuristic search for global optimization. In: AIP conference proceedings, p 162","DOI":"10.1063\/1.2817338"},{"issue":"3","key":"8084_CR48","first-page":"696","volume":"9","author":"B Nayak","year":"2018","unstructured":"Nayak B, Sahu S, Choudhury TR (2018) Parameter estimation of DC motor using adaptive transfer function based on Nelder-Mead optimisationIndonesian. J Electr Eng Comput Sci 9(3):696\u2013670","journal-title":"J Electr Eng Comput Sci"},{"key":"8084_CR49","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.aeue.2018.02.005","volume":"87","author":"B Nayak","year":"2018","unstructured":"Nayak B, Choudhury TR, Misra B (2018) Component value selection for active filters based on minimization of GSP and E12 compatible using grey wolf and particle swarm optimization. AEU-Int J Electron Commun 87:48\u201353","journal-title":"AEU-Int J Electron Commun"},{"key":"8084_CR50","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.aeue.2018.05.024","volume":"93","author":"B Nayak","year":"2018","unstructured":"Nayak B, Misra B, Choudhury TR (2018) Meta-heuristic optimization algorithms for design of gain constrained state variable filter. AEU-Inte J Electron Commun 93:7\u201318","journal-title":"AEU-Inte J Electron Commun"},{"key":"8084_CR51","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-171965","author":"B Nayak","year":"2019","unstructured":"Nayak B, Choudhury TR, Misra B, Mohapatra A (2019) Estimation of component values of filter design using optimization algorithms. J Intell Fuzzy Syst. https:\/\/doi.org\/10.3233\/JIFS-171965","journal-title":"J Intell Fuzzy Syst"},{"key":"8084_CR52","doi-asserted-by":"crossref","unstructured":"Nayak BK, Mohapatra A, Mohanty KB (2013) Parameters estimation of photovoltaic module using nonlinear least square algorithm: a comparative study 2013 Annual IEEE India Conference, INDICON","DOI":"10.1109\/INDCON.2013.6726120"},{"key":"8084_CR53","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.knosys.2011.07.001","volume":"26","author":"W-T Pan","year":"2012","unstructured":"Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26:69\u201374","journal-title":"Knowl-Based Syst"},{"key":"8084_CR54","doi-asserted-by":"crossref","unstructured":"Pinto PC, Runkler TA, Sousa JM (2007) Wasp swarm algorithm for dynamic MAX-SAT problems. In: Adaptive and natural computing algorithms, Springer, pp 350\u201357","DOI":"10.1007\/978-3-540-71618-1_39"},{"key":"8084_CR55","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 D (2011) Teaching\u2013learning based optimization: an ovel method for constrained mechanical design optimization problems. Comput-Aided Des 43:303\u2013315","journal-title":"Comput-Aided Des"},{"key":"8084_CR56","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 179:2232\u20132248","journal-title":"Inf Sci"},{"key":"8084_CR57","unstructured":"Rechenberg I (1994) Evolution strategy. Comput Intel Imitat Life 1"},{"key":"8084_CR58","unstructured":"Roth M (2005) Termite: a swarm intelligent routing algorithm for mobile wirelessad-hoc networks"},{"key":"8084_CR59","doi-asserted-by":"publisher","first-page":"2592","DOI":"10.1016\/j.asoc.2012.11.026","volume":"13","author":"A Sadollah","year":"2013","unstructured":"Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: an new population based algorithm for solving constrained engineering optimiza-tion problems. Appl Soft Comput 13:2592\u20132612","journal-title":"Appl Soft Comput"},{"key":"8084_CR60","first-page":"1","volume":"000","author":"SCA SeyedaliMirjalili","year":"2016","unstructured":"SeyedaliMirjalili SCA (2016) Sine cosine algorithm for solving optimization problems. Knowl-Based Syst 000:1\u201314","journal-title":"Knowl-Based Syst"},{"key":"8084_CR61","doi-asserted-by":"crossref","unstructured":"Shiqin Y, Jianjun J, Guangxing Y (2009) A dolphin partner optimization. In: Intelligent systems, 2009. GCIS\u201909. WRI Global Congress on, pp 124\u201328","DOI":"10.1109\/GCIS.2009.464"},{"key":"8084_CR62","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. Evolut Comput IEEE Trans 12:702\u2013713","journal-title":"Evolut Comput IEEE Trans"},{"key":"8084_CR63","unstructured":"Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, et al. (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on realparameter optimization, Technical Report, Nanyang Technological University, Singapore, http:\/\/www.ntu.edu.sg\/home\/EPNSugan"},{"key":"8084_CR64","unstructured":"Webster B, Bernhard PJ (2003) A local search optimization algorithm based on natural principles of gravitation. In: Proceedings of the 2003 international conference on information and knowledge engineering (IKE\u201903), Las Vegas, Nevada, pp 255\u201361"},{"key":"8084_CR65","doi-asserted-by":"publisher","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. Evolut Comput IEEE Trans 1:67\u201382","journal-title":"Evolut Comput IEEE Trans"},{"key":"8084_CR66","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1504\/IJBIC.2010.032124","volume":"2","author":"X-S Yang","year":"2010","unstructured":"Yang X-S (2010) Firefly algorithm, stochastic test functions and design optimisation. Int J Bio-Inspir Comput 2:78\u201384","journal-title":"Int J Bio-Inspir Comput"},{"key":"8084_CR67","doi-asserted-by":"crossref","unstructured":"Yang X-S (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010), Springer, pp 65\u201374. https:\/\/arxiv.org\/abs\/1004.4170","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"8084_CR68","doi-asserted-by":"crossref","unstructured":"Yang X-S, Deb S (2009) Cuckoo search via L\u00e9vy flights. In: Nature and biologically inspired computing, 2009. NaBIC 2009. World Congress on, pp 210\u201314","DOI":"10.1109\/NABIC.2009.5393690"},{"issue":"2","key":"8084_CR69","doi-asserted-by":"publisher","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 Evolut Comput 3(2):82\u2013102","journal-title":"IEEE Trans Evolut Comput"},{"key":"8084_CR70","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multi objective evolutionary algorithms: a survey of the state of the art, Swarm. Evol Comput 1:32\u201349","journal-title":"Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08084-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-08084-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08084-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,10]],"date-time":"2023-12-10T06:28:14Z","timestamp":1702189694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-08084-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,8]]},"references-count":70,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["8084"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-08084-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-685571\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,8]]},"assertion":[{"value":"19 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Author 1 declares that he\/she has no conflict of interest. Author 2 declares that he\/she has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}