{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T15:47:43Z","timestamp":1782488863284,"version":"3.54.5"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T00:00:00Z","timestamp":1711756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T00:00:00Z","timestamp":1711756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005274","name":"North-West University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005274","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This study proposes a new prairie dog optimization algorithm version called EPDO. This new version aims to address the issues of premature convergence and slow convergence that were observed in the original PDO algorithm. To improve performance, several modifications are introduced in EPDO. First, a dynamic opposite learning strategy is employed to increase the diversity of the population and prevent premature convergence. This strategy helps the algorithm avoid falling into local optima and promotes global optimization. Additionally, the L\u00e9vy dynamic random walk technique is utilized in EPDO. This modified L\u00e9vy flight with random walk reduces the algorithm\u2019s running time for the test function\u2019s ideal value, accelerating its convergence. The proposed approach is evaluated using 33 benchmark problems from CEC 2017 and compared against seven other comparative techniques: GWO, MFO, ALO, WOA, DA, SCA, and RSA. Numerical results demonstrate that EPDO produces good outcomes and performs well in solving benchmark problems. To further validate the results and assess reliability, the authors employ average rank tests, the measurement of alternatives, and ranking according to the compromise solution (MARCOS) method, as well as a convergence report of EPDO and other algorithms. Furthermore, the effectiveness of the EPDO algorithm is demonstrated by applying it to five design problems. The results indicate that EPDO achieves impressive outcomes and proves its capability to address practical issues. The algorithm performs well in solving benchmark and practical design problems, as supported by the numerical results and validation methods used in the study.<\/jats:p>","DOI":"10.1007\/s00521-024-09648-4","type":"journal-article","created":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T05:01:56Z","timestamp":1711774916000},"page":"11137-11170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Enhanced prairie dog optimization with Levy flight and dynamic opposition-based learning for global optimization and engineering design problems"],"prefix":"10.1007","volume":"36","author":[{"given":"Saptadeep","family":"Biswas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Azharuddin","family":"Shaikh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Absalom El-Shamir","family":"Ezugwu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Japie","family":"Greeff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seyedali","family":"Mirjalili","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uttam Kumar","family":"Bera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2203-4549","authenticated-orcid":false,"given":"Laith","family":"Abualigah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,30]]},"reference":[{"key":"9648_CR1","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.116158","volume":"191","author":"L Abualigah","year":"2022","unstructured":"Abualigah L, Elaziz MA, Sumari P, Geem ZW, Gandomi AH (2022) Reptile search algorithm (RSA): a nature-inspired meta-heuristic optimizer. Expert Syst Appl 191:116158","journal-title":"Expert Syst Appl"},{"key":"9648_CR2","first-page":"803","volume":"5","author":"AA Taleizadeh","year":"2023","unstructured":"Taleizadeh AA, Naghavi-Alhoseiny M-S, Eduardo C\u00e1rdenas-Barr\u00f3n L, Amjadian A (2023) Optimization of price, lot size and backordered level in an EPQ inventory model with rework process. RAIRO-Oper Res 5:803\u2013819","journal-title":"RAIRO-Oper Res"},{"key":"9648_CR3","first-page":"767","volume":"8","author":"D Cao","year":"2022","unstructured":"Cao D, Xu Y, Yang Z, Dong H, Li X (2022) An enhanced whale optimization algorithm with improved dynamic opposite learning and adaptive inertia weight strategy. Complex Intell Syst 8:767\u2013795","journal-title":"Complex Intell Syst"},{"issue":"6","key":"9648_CR4","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1080\/03052150310001624403","volume":"35","author":"I Chakraborty","year":"2003","unstructured":"Chakraborty I, Kumar V, Nair SB, Tiwari R (2003) Rolling element bearing design through genetic algorithms. Eng Optim 35(6):649\u2013659","journal-title":"Eng Optim"},{"issue":"21","key":"9648_CR5","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.3390\/math9212832","volume":"9","author":"P Coufal","year":"2021","unstructured":"Coufal P, Hub\u00e1lovsk\u00fd \u0160, Hub\u00e1lovsk\u00e1 M, Balogh Z (2021) Snow leopard optimization algorithm: a new nature-based optimization algorithm for solving optimization problems. Mathematics 9(21):2832","journal-title":"Mathematics"},{"issue":"11","key":"9648_CR6","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.3390\/math9111190","volume":"9","author":"M Dehghani","year":"2021","unstructured":"Dehghani M, Montazeri Z, Hub\u00e1lovsk\u00fd \u0160 (2021) GMBO: group mean-based optimizer for solving various optimization problems. Mathematics 9(11):1190","journal-title":"Mathematics"},{"issue":"13","key":"9648_CR7","doi-asserted-by":"crossref","first-page":"4567","DOI":"10.3390\/s21134567","volume":"21","author":"M Dehghani","year":"2021","unstructured":"Dehghani M, Trojovsk\u00fd P (2021) Teamwork optimization algorithm: a new optimization approach for function minimization\/maximization. Sensors 21(13):4567","journal-title":"Sensors"},{"issue":"4","key":"9648_CR8","doi-asserted-by":"crossref","first-page":"2543","DOI":"10.1007\/s11831-022-09876-8","volume":"30","author":"KG Dhal","year":"2023","unstructured":"Dhal KG, Ray S, Rai R, Das A (2023) Archimedes optimizer: theory, analysis, improvements, and applications. Arch Comput Methods Eng 30(4):2543\u20132578","journal-title":"Arch Comput Methods Eng"},{"key":"9648_CR9","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.106752","volume":"216","author":"H Dong","year":"2021","unstructured":"Dong H, Xu Y, Li X, Yang Z, Zou C (2021) An improved antlion optimizer with dynamic random walk and dynamic opposite learning. Knowl-Based Syst 216:106752","journal-title":"Knowl-Based Syst"},{"issue":"17","key":"9648_CR10","doi-asserted-by":"crossref","first-page":"5081","DOI":"10.1007\/s00500-016-2102-5","volume":"21","author":"W Dong","year":"2017","unstructured":"Dong W, Kang L, Zhang W (2017) Opposition-based particle swarm optimization with adaptive mutation strategy. Soft Comput 21(17):5081\u20135090","journal-title":"Soft Comput"},{"issue":"22","key":"9648_CR11","doi-asserted-by":"crossref","first-page":"20017","DOI":"10.1007\/s00521-022-07530-9","volume":"34","author":"AE Ezugwu","year":"2022","unstructured":"Ezugwu AE, Agushaka JO, Abualigah L, Mirjalili S, Gandomi AH (2022) Prairie dog optimization algorithm. Neural Comput Appl 34(22):20017\u201320065","journal-title":"Neural Comput Appl"},{"issue":"2","key":"9648_CR12","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/s10878-023-01002-z","volume":"45","author":"A Gharaei","year":"2023","unstructured":"Gharaei A, Amjadian A, Shavandi A, Amjadian A (2023) An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems. J Comb Optim 45(2):78","journal-title":"J Comb Optim"},{"issue":"1\u20133","key":"9648_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F Glover","year":"1994","unstructured":"Glover F (1994) Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discret Appl Math 49(1\u20133):231\u2013255","journal-title":"Discret Appl Math"},{"issue":"5\u20136","key":"9648_CR14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.compstruc.2009.01.002","volume":"87","author":"O Hasan\u00e7ebi","year":"2009","unstructured":"Hasan\u00e7ebi O, \u00c7arba\u015f S, Do\u01e7an E, Erdal F, Saka MP (2009) Performance evaluation of metaheuristic search techniques in the optimum design of real size pin jointed structures. Comput Struct 87(5\u20136):284\u2013302","journal-title":"Comput Struct"},{"key":"9648_CR15","volume-title":"Diffusion and ecological problems: modern perspectives","author":"IL Sirovich","year":"2009","unstructured":"Sirovich IL, Marsden JE (2009) Diffusion and ecological problems: modern perspectives, vol 8. Springer, New York"},{"issue":"2","key":"9648_CR16","first-page":"150","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil M, Yang XS (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"},{"key":"9648_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.asoc.2016.01.002","volume":"44","author":"G Jaradat","year":"2016","unstructured":"Jaradat G, Ayob M, Almarashdeh I (2016) The effect of elite pool in hybrid population-based meta-heuristics for solving combinatorial optimization problems. Appl Soft Comput J 44:45\u201356","journal-title":"Appl Soft Comput J"},{"key":"9648_CR18","doi-asserted-by":"crossref","first-page":"21888","DOI":"10.1109\/ACCESS.2018.2809457","volume":"6","author":"Q Kang","year":"2018","unstructured":"Kang Q, Xiong C, Zhou M, Meng L (2018) Opposition-based hybrid strategy for particle swarm optimization in noisy environments. IEEE Access 6:21888\u201321900","journal-title":"IEEE Access"},{"issue":"2\u20133","key":"9648_CR19","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/BF00379695","volume":"56","author":"PM Kareiva","year":"1983","unstructured":"Kareiva PM, Shigesada N (1983) Analyzing insect movement as a correlated random walk. Oecologia 56(2\u20133):234\u2013238","journal-title":"Oecologia"},{"issue":"1","key":"9648_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10462-021-10036-w","volume":"55","author":"AR Kashani","year":"2022","unstructured":"Kashani AR, Camp CV, Rostamian M, Azizi K, Gandomi AH (2022) Population-based optimization in structural engineering: a review. Artif Intell Rev 55(1):1\u2013108","journal-title":"Artif Intell Rev"},{"issue":"4598","key":"9648_CR21","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"9648_CR22","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100693","volume":"56","author":"A Kumar","year":"2020","unstructured":"Kumar A, Wu G, Ali MZ, Mallipeddi R, Suganthan PN, Das S (2020) A test-suite of non-convex constrained optimization problems from the real-world and some baseline results. Swarm Evol Comput 56:100693","journal-title":"Swarm Evol Comput"},{"key":"9648_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2017.09.010","volume":"39","author":"S Mahdavi","year":"2018","unstructured":"Mahdavi S, Rahnamayan S, Deb K (2018) Opposition based learning: a literature review. Swarm Evol Comput 39:1\u201323","journal-title":"Swarm Evol Comput"},{"issue":"22","key":"9648_CR24","doi-asserted-by":"crossref","first-page":"2946","DOI":"10.1103\/PhysRevLett.73.2946","volume":"73","author":"RN Mantegna","year":"1994","unstructured":"Mantegna RN, Stanley HE (1994) Stochastic process with ultraslow convergence to a gaussian: the truncated L\u00e9vy flight. Phys Rev Lett 73(22):2946","journal-title":"Phys Rev Lett"},{"key":"9648_CR25","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. Knowledge-Based Syst 89:228\u2013249","journal-title":"Knowledge-Based Syst"},{"key":"9648_CR26","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"},{"issue":"4","key":"9648_CR27","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27(4):1053\u20131073","journal-title":"Neural Comput Appl"},{"key":"9648_CR28","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":"9648_CR29","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":"9648_CR30","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"},{"issue":"11","key":"9648_CR31","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"key":"9648_CR32","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100888","volume":"64","author":"E Osaba","year":"2021","unstructured":"Osaba E, Villar-Rodriguez E, Del Ser J, Nebro AJ, Molina D, LaTorre A, Suganthan PN, Coello Coello CA, Herrera F (2021) A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems. Swarm Evol Comput 64:100888","journal-title":"Swarm Evol Comput"},{"issue":"1\u20132","key":"9648_CR33","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0377-0427(00)00425-8","volume":"124","author":"PM Pardalos","year":"2000","unstructured":"Pardalos PM, Romeijn HE, Tuy H (2000) Recent developments and trends in global optimization. J Comput Appl Math 124(1\u20132):209\u2013228","journal-title":"J Comput Appl Math"},{"issue":"1","key":"9648_CR34","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TEVC.2007.894200","volume":"12","author":"S Rahnamayan","year":"2008","unstructured":"Rahnamayan S, Tizhoosh H, Salama M (2008) Opposition-based differential evolution. IEEE Tran Evol Comput 12(1):64\u201379","journal-title":"IEEE Tran Evol Comput"},{"issue":"2","key":"9648_CR35","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.mechmachtheory.2006.02.004","volume":"42","author":"B Rajeswara Rao","year":"2007","unstructured":"Rajeswara Rao B, Tiwari R (2007) Optimum design of rolling element bearings using genetic algorithms. Mech Mach Theory 42(2):233\u2013250","journal-title":"Mech Mach Theory"},{"issue":"4","key":"9648_CR36","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1890\/08-0153.1","volume":"90","author":"AM Reynolds","year":"2009","unstructured":"Reynolds AM, Rhodes CJ (2009) The L\u00e9vy flight paradigm: random search patterns and mechanisms. Ecology 90(4):877\u2013887","journal-title":"Ecology"},{"key":"9648_CR37","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.cie.2017.06.028","volume":"110","author":"N Rojas-Morales","year":"2017","unstructured":"Rojas-Morales N, Riff Rojas MC, Montero Ureta E (2017) A survey and classification of Opposition-Based Metaheuristics. Comput Ind Eng 110:424\u2013435","journal-title":"Comput Ind Eng"},{"key":"9648_CR38","first-page":"2811","volume":"8","author":"SK Sahoo","year":"2022","unstructured":"Sahoo SK, Saha AK, Nama S, Masdari M (2022) An improved moth flame optimization algorithm based on modified dynamic opposite learning strategy. Artif Intell Rev 8:2811\u20132869","journal-title":"Artif Intell Rev"},{"issue":"2","key":"9648_CR39","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1115\/1.2912596","volume":"112","author":"E Sandgren","year":"1990","unstructured":"Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des, Trans ASME 112(2):223\u2013229","journal-title":"J Mech Des, Trans ASME"},{"key":"9648_CR40","volume-title":"On growth and form: fractal and non-fractal patterns in physics","author":"MF Shlesinger","year":"1986","unstructured":"Shlesinger MF, Klafter J (1986) L\u00e9vy walks versus L\u00e9vy flights. In: Stanley HE, Ostrowsky N (eds) On growth and form: fractal and non-fractal patterns in physics, vol 100. Springer, Dordrecht"},{"issue":"1","key":"9648_CR41","doi-asserted-by":"crossref","first-page":"4","DOI":"10.3390\/logistics4010004","volume":"4","author":"\u017d Stevi\u0107","year":"2020","unstructured":"Stevi\u0107 \u017d, Brkovi\u0107 N (2020) A novel integrated FUCOM-MARCOS model for evaluation of human resources in a transport company. Logistics 4(1):4","journal-title":"Logistics"},{"key":"9648_CR42","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2019.106231","volume":"140","author":"\u017d Stevi\u0107","year":"2020","unstructured":"Stevi\u0107 \u017d, Pamu\u010dar D, Pu\u0161ka A, Chatterjee P (2020) Sustainable supplier selection in healthcare industries using a new MCDM method: measurement of alternatives and ranking according to COmpromise solution (MARCOS). Comput Ind Eng 140:106231","journal-title":"Comput Ind Eng"},{"issue":"1","key":"9648_CR43","first-page":"12","volume":"10","author":"AA Taleizadeh","year":"2023","unstructured":"Taleizadeh AA, Amjadian A, Hashemi-Petroodi SE, Moon I (2023) Supply chain coordination based on mean-variance risk optimisation: pricing, warranty, and full-refund decisions. Int J Syst Sci: Oper Logist 10(1):12","journal-title":"Int J Syst Sci: Oper Logist"},{"key":"9648_CR44","unstructured":"Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: Proceedings- international conference on computational intelligence for modelling, control and automation, CIMCA 2005 and international conference on intelligent agents, Web Technologies and Internet"},{"issue":"4","key":"9648_CR45","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.2307\/1941099","volume":"72","author":"P Turchin","year":"1991","unstructured":"Turchin P (1991) Translating foraging movements in heterogeneous environments into the spatial distribution of foragers. Ecology 72(4):1253\u20131266","journal-title":"Ecology"},{"issue":"1","key":"9648_CR46","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 Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"},{"key":"9648_CR47","volume":"188","author":"Y Xu","year":"2020","unstructured":"Xu Y, Yang Z, Li X, Kang H, Yang X (2020) Dynamic opposite learning enhanced teaching-learning-based optimization. Knowl-Based Syst 188:104966","journal-title":"Knowl-Based Syst"},{"key":"9648_CR48","doi-asserted-by":"crossref","DOI":"10.1002\/9780470640425","volume-title":"Engineering optimization: an introduction with metaheuristic applications","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Engineering optimization: an introduction with metaheuristic applications. Wiley, Hoboken"},{"issue":"2","key":"9648_CR49","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1166\/jctn.2012.2012","volume":"9","author":"XS Yang","year":"2012","unstructured":"Yang XS (2012) Efficiency analysis of swarm intelligence and randomization techniques. J Comput Theor Nanosci 9(2):189\u2013198","journal-title":"J Comput Theor Nanosci"},{"key":"9648_CR50","volume":"46","author":"XS Yang","year":"2020","unstructured":"Yang XS (2020) Nature-inspired optimization algorithms: challenges and open problems. J Comput Sci 46:101104","journal-title":"J Comput Sci"},{"key":"9648_CR51","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-16936-7","volume-title":"Mathematical foundations of nature-inspired algorithms","author":"X-S Yang","year":"2019","unstructured":"Yang X-S, He X-S (2019) Mathematical foundations of nature-inspired algorithms. Springer, Cham"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-09648-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-09648-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-09648-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T11:09:29Z","timestamp":1719313769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-09648-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,30]]},"references-count":51,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["9648"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-09648-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,30]]},"assertion":[{"value":"20 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no Conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}