{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:35:26Z","timestamp":1772120126494,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Artif Intell"],"DOI":"10.1007\/s44163-025-00367-w","type":"journal-article","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T08:33:27Z","timestamp":1750322007000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An artificial intelligence technique: experimental analysis of population-based physarum-energy optimization algorithm"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0742-0633","authenticated-orcid":false,"given":"Mehmet Fatih","family":"Demiral","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,19]]},"reference":[{"key":"367_CR1","doi-asserted-by":"publisher","first-page":"10637","DOI":"10.1007\/s13369-020-04828-5","volume":"45","author":"J Euchi","year":"2020","unstructured":"Euchi J, Zidi S, Laouamer L. A hybrid approach to solve the vehicle routing problem with time windows and synchronized visits in-home health care. Arab J Sci Eng. 2020;45:10637\u201352. https:\/\/doi.org\/10.1007\/s13369-020-04828-5.","journal-title":"Arab J Sci Eng"},{"key":"367_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10732-019-09431-y","volume":"26","author":"QM Ha","year":"2020","unstructured":"Ha QM, Deville Y, Pham QD, H\u00e0 MH. A hybrid genetic algorithm for the traveling salesman problem with drone. J Heuristics. 2020;26:219\u201347. https:\/\/doi.org\/10.1007\/s10732-019-09431-y.","journal-title":"J Heuristics"},{"key":"367_CR3","doi-asserted-by":"publisher","first-page":"3233","DOI":"10.1007\/s13369-020-04348-2","volume":"45","author":"MZ Mistarihi","year":"2020","unstructured":"Mistarihi MZ, Okour RA, Magableh GM, Salameh HM. Integrating advanced harmony search with fuzzy logic for solving buffer allocation problems. Arab J Sci Eng. 2020;45:3233\u201344. https:\/\/doi.org\/10.1007\/s13369-020-04348-2.","journal-title":"Arab J Sci Eng"},{"key":"367_CR4","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/s13369-020-04808-9","volume":"46","author":"U Raut","year":"2021","unstructured":"Raut U, Mishra S. Enhanced sine\u2013cosine algorithm for optimal planning of distribution network by incorporating network reconfiguration and distributed generation. Arab J Sci Eng. 2021;46:1029\u201351. https:\/\/doi.org\/10.1007\/s13369-020-04808-9.","journal-title":"Arab J Sci Eng"},{"issue":"4","key":"367_CR5","doi-asserted-by":"publisher","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","volume":"11","author":"X Geng","year":"2011","unstructured":"Geng X, Chen Z, Yang W, Shi D, Zhao K. Solving the travelling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl Soft Comput. 2011;11(4):3680\u20139.","journal-title":"Appl Soft Comput"},{"key":"367_CR6","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1057\/jors.2012.24","volume":"64","author":"A Subramanian","year":"2013","unstructured":"Subramanian A, Battarra M. An iterated local search algorithm for the travelling salesman problem with pickups and deliveries. J Oper Res Soc. 2013;64:402\u20139.","journal-title":"J Oper Res Soc"},{"key":"367_CR7","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1007\/s00500-013-1203-7","volume":"18","author":"HP Chiang","year":"2014","unstructured":"Chiang HP, Chou YH, Chiu CH, Kuo SY, Huang YM. A quantum-inspired tabu search algorithm for solving combinato rial optimization problems. Soft Comput. 2014;18:1771\u201381.","journal-title":"Soft Comput"},{"key":"367_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","volume":"68","author":"H Samrat","year":"2018","unstructured":"Samrat H, Chatterjee A, Dewanji A. Improving variable neighborhood search to solve the traveling salesman problem. Appl Soft Comput. 2018;68:83\u201391.","journal-title":"Appl Soft Comput"},{"key":"367_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.01.002","volume":"105","author":"F Arnold","year":"2019","unstructured":"Arnold F, S\u00f6rensen K. Knowledge-guided local search for the vehicle routing problem. Comput Oper Res. 2019;105:32\u201346.","journal-title":"Comput Oper Res"},{"key":"367_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s12190-008-0093-9","volume":"28","author":"Q Liu","year":"2008","unstructured":"Liu Q, Zhao Q, Zang W. Study on multi-objective optimization of flow allocation in a multi-commodity stochastic-flow network with unreliable nodes. J Appl Math Comput. 2008;28:185\u201398. https:\/\/doi.org\/10.1007\/s12190-008-0093-9.","journal-title":"J Appl Math Comput"},{"key":"367_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.cor.2014.10.011","volume":"55","author":"KA Husseinzadeh","year":"2015","unstructured":"Husseinzadeh KA. A new metaheuristic for optimization: Optics inspired optimization (OIO). Comput Oper Res. 2015;55:99\u2013125. https:\/\/doi.org\/10.1016\/j.cor.2014.10.011.","journal-title":"Comput Oper Res"},{"issue":"Sup.1","key":"367_CR12","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.3906\/elk-1109-44","volume":"21","author":"M Peker","year":"2013","unstructured":"Peker M, \u015een B, Kumru P. An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by Taguchi method. Turk J Elec Eng Comp Sci. 2013;21(Sup.1):2015\u201336.","journal-title":"Turk J Elec Eng Comp Sci"},{"key":"367_CR13","volume-title":"Research and development in intelligent systems XXVI","author":"XS Yang","year":"2010","unstructured":"Yang XS. Firefly algorithm, l\u00e9vy flights and global optimization. In: Bramer M, Ellis R, Petridis M, editors. Research and development in intelligent systems XXVI. London: Springer; 2010."},{"key":"367_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K. Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous space. J Global Optim. 1997;11:341\u201359. https:\/\/doi.org\/10.1023\/A:1008202821328.","journal-title":"J Global Optim"},{"key":"367_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30504-7_8","volume-title":"Handbook of Optimization. Inteligent systems reference library","author":"KV Price","year":"2013","unstructured":"Price KV. Differential evolution. In: Sn\u00e1\u0161el V, Abraham A, Zelinka I, editors. Handbook of Optimization. Inteligent systems reference library. Heidelberg: Springer; 2013. https:\/\/doi.org\/10.1007\/978-3-642-30504-7_8."},{"key":"367_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou A. Black hole: a new heuristic optimization approach for data clustering. Inf Sci. 2013;222:175\u201384.","journal-title":"Inf Sci"},{"key":"367_CR17","doi-asserted-by":"publisher","first-page":"8167","DOI":"10.1007\/s00500-017-2760-y","volume":"22","author":"A Hatamlou","year":"2018","unstructured":"Hatamlou A. Solving travelling salesman problem using black hole algorithm. Soft Comput. 2018;22:8167\u201375. https:\/\/doi.org\/10.1007\/s00500-017-2760-y.","journal-title":"Soft Comput"},{"key":"367_CR18","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.asoc.2014.08.056","volume":"24","author":"HREH Bouchekara","year":"2014","unstructured":"Bouchekara HREH. Optimal power flow using black-hole-based optimization approach. Appl Soft Comput. 2014;24:879\u201388.","journal-title":"Appl Soft Comput"},{"key":"367_CR19","unstructured":"Arnaout JP. Worm optimization: A novel optimization algorithm inspired by C. Elegans. Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management, Bali, Indonesia; 2014."},{"issue":"1","key":"367_CR20","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.jcde.2015.06.003","volume":"3","author":"M Yazdani","year":"2016","unstructured":"Yazdani M, Jolai F. Lion optimization algorithm (LOA): A nature-inspired metaheuristic algorithm. J Comput Design Eng. 2016;3(1):24\u201336.","journal-title":"J Comput Design Eng"},{"key":"367_CR21","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S. SCA: A sine cosine algorithm for solving optimization problems. Knowl-Based Syst. 2016;96:120\u201333. https:\/\/doi.org\/10.1016\/j.knosys.2015.12.022.","journal-title":"Knowl-Based Syst"},{"key":"367_CR22","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/4231647","author":"C Qu","year":"2018","unstructured":"Qu C, Zeng Z, Dai J, Yi Z, He W. A modified sine-cosine algorithm based on neighborhood search and greedy levy mutation. Comput Intell Neurosci. 2018. https:\/\/doi.org\/10.1155\/2018\/4231647.","journal-title":"Comput Intell Neurosci"},{"key":"367_CR23","doi-asserted-by":"publisher","first-page":"4041","DOI":"10.1007\/s13369-017-2790-x","volume":"43","author":"KS Reddy","year":"2018","unstructured":"Reddy KS, Panwar LK, Panigrahi B, Kumar R. A new binary variant of sine\u2013cosine algorithm: Development and application to solve profit-based unit commitment problem. Arab J Sci Eng. 2018;43:4041\u201356. https:\/\/doi.org\/10.1007\/s13369-017-2790-x.","journal-title":"Arab J Sci Eng"},{"key":"367_CR24","doi-asserted-by":"publisher","first-page":"3669","DOI":"10.1007\/s13369-018-3617-0","volume":"44","author":"MA Tawhid","year":"2019","unstructured":"Tawhid MA, Savsani P. Discrete sine-cosine algorithm (DSCA) with local search for solving traveling salesman problem. Arab J Sci Eng. 2019;44:3669\u201379. https:\/\/doi.org\/10.1007\/s13369-018-3617-0.","journal-title":"Arab J Sci Eng"},{"issue":"2","key":"367_CR25","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1080\/08839514.2020.1848276","volume":"35","author":"Q Li","year":"2021","unstructured":"Li Q, Ning H, Gong J, Li X, Dai B. A hybrid greedy sine cosine algorithm with differential evolution for global optimization and cylindricity error evaluation. Appl Artif Intell. 2021;35(2):171\u201391.","journal-title":"Appl Artif Intell"},{"key":"367_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2014.10.008","volume":"55","author":"YJ Zheng","year":"2015","unstructured":"Zheng YJ. Water wave optimization: a new nature-inspired metaheuristic. Comput Oper Res. 2015;55:1\u201311.","journal-title":"Comput Oper Res"},{"key":"367_CR27","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s00500-017-2796-z","volume":"23","author":"X Feng","year":"2019","unstructured":"Feng X, Liu Y, Yu H, Luo F. Physarum-energy optimization algorithm. Soft Comput. 2019;23:871\u201388. https:\/\/doi.org\/10.1007\/s00500-017-2796-z.","journal-title":"Soft Comput"},{"issue":"1\u20133","key":"367_CR28","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0166-218X(01)00345-6","volume":"123","author":"Y Crama","year":"2002","unstructured":"Crama Y, van de Klundert J, Spieksma FCR. Production planning problems in printed circuit board assembly. Discrete Appl Math. 2002;123(1\u20133):339\u201361.","journal-title":"Discrete Appl Math"},{"key":"367_CR29","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02936173","volume":"16","author":"ZN Azimi","year":"2014","unstructured":"Azimi ZN. Comparison of metaheuristic algorithms for examination timetabling problem. J Appl Math Comput. 2014;16:337\u201354. https:\/\/doi.org\/10.1007\/BF02936173.","journal-title":"J Appl Math Comput"},{"key":"367_CR30","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1007\/s00500-012-0855-z","volume":"16","author":"W Deng","year":"2012","unstructured":"Deng W, Chen R, He B, Liu Y, Yin L, Guo J. A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput. 2012;16:1707\u201322.","journal-title":"Soft Comput"},{"issue":"2","key":"367_CR31","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/j.ejor.2011.11.035","volume":"218","author":"BI Kim","year":"2012","unstructured":"Kim BI, Kim S, Park J. A school bus scheduling problem. Eur J Oper Res. 2012;218(2):577\u201385.","journal-title":"Eur J Oper Res"},{"key":"367_CR32","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/892914","author":"H Shen","year":"2014","unstructured":"Shen H, Zhu Y, Liang X. Lifecycle-based swarm optimization method for numerical optimization. Discret Dyn Nat Soc. 2014. https:\/\/doi.org\/10.1155\/2014\/892914.","journal-title":"Discret Dyn Nat Soc"},{"issue":"3","key":"367_CR33","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TC.2013.229","volume":"64","author":"L Liu","year":"2015","unstructured":"Liu L, Song Y, Zhang H, Huadong M, Vasilakos AV. Physarum optimization: a biology-inspired algorithm for the steiner tree problem in networks. IEEE Trans Comput. 2015;64(3):818\u201331.","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"367_CR34","first-page":"285","volume":"5","author":"A Hatamlou","year":"2016","unstructured":"Hatamlou A, Ghaniyarlou E. Solving knapsack problems using heart algorithm. Int J Artif Intell Soft Comput. 2016;5(4):285\u201393.","journal-title":"Int J Artif Intell Soft Comput"},{"key":"367_CR35","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s12190-019-01255-0","volume":"61","author":"XX Liang","year":"2019","unstructured":"Liang XX, Zhang B, Wang JB, Yin N, Huang X. Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects. J Appl Math Comput. 2019;61:373\u201388. https:\/\/doi.org\/10.1007\/s12190-019-01255-0.","journal-title":"J Appl Math Comput"},{"key":"367_CR36","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1007\/s11831-020-09412-6","volume":"28","author":"M Sharma","year":"2021","unstructured":"Sharma M, Kaur P. A comprehensive analysis of nature inspired techniques for feature selection problem. Arch Comput Method Eng. 2021;28:1103\u201327.","journal-title":"Arch Comput Method Eng"},{"key":"367_CR37","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2006","unstructured":"Applegate DL, Bixby RE, Chvatal V, Cook W. The traveling salesman problem: a computational study. Oxford: Princeton University Press; 2006."},{"issue":"7","key":"367_CR38","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1166\/jctn.2009.1230","volume":"6","author":"Z Wang","year":"2009","unstructured":"Wang Z, Geng X, Shao Z. An effective simulated annealing algorithm for solving the traveling salesman problem. J Comput Theor Nanos. 2009;6(7):1680\u20136.","journal-title":"J Comput Theor Nanos"},{"issue":"7","key":"367_CR39","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1007\/s00500-010-0680-1","volume":"15","author":"M Mavrovouniotis","year":"2011","unstructured":"Mavrovouniotis M, Yang S. A memetic ant colony optimization algorithm for the dynamic travelling salesman problem. Soft Comput. 2011;15(7):1405\u201325.","journal-title":"Soft Comput"},{"issue":"22","key":"367_CR40","doi-asserted-by":"publisher","first-page":"7619","DOI":"10.1007\/s00500-017-2735-z","volume":"22","author":"AE Yildirim","year":"2018","unstructured":"Yildirim AE, Karci A. Applications of artificial atom algorithm to small-scale traveling salesman problems. Soft Comput. 2018;22(22):7619\u201331. https:\/\/doi.org\/10.1007\/s00500-017-2735-z.","journal-title":"Soft Comput"},{"key":"367_CR41","doi-asserted-by":"publisher","first-page":"105460","DOI":"10.1016\/j.asoc.2019.04.030","volume":"81","author":"J Li","year":"2019","unstructured":"Li J, Li T, Yu Y, Zhang Z, Pardalos PM, Zhang Y, Ma Y. Discrete firefly algorithm with compound neighborhoods for asymmetric multi-depot vehicle routing problem in the maintenance of farm machinery. Appl Soft Comput. 2019;81:105460.","journal-title":"Appl Soft Comput"},{"issue":"3","key":"367_CR42","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.cor.2007.11.008","volume":"36","author":"T Oncan","year":"2009","unstructured":"Oncan T, Alt\u0131nel IK, Laporte G. A comparative analysis of several asymmetric traveling salesman problem formulations. Comput Oper Res. 2009;36(3):637\u201354.","journal-title":"Comput Oper Res"},{"issue":"10","key":"367_CR43","doi-asserted-by":"publisher","first-page":"8947","DOI":"10.1016\/j.eswa.2012.02.029","volume":"39","author":"Y Nagata","year":"2012","unstructured":"Nagata Y, Soler D. A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst Appl. 2012;39(10):8947\u201353.","journal-title":"Expert Syst Appl"},{"key":"367_CR44","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.asoc.2016.08.036","volume":"49","author":"Y Lin","year":"2016","unstructured":"Lin Y, Bian Z, Liu X. Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing- tabu search algorithm to solve the symmetrical traveling salesman problem. Appl Soft Comput. 2016;49:937\u201352.","journal-title":"Appl Soft Comput"},{"key":"367_CR45","unstructured":"TSPLIB. Available online: http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/ (accessed on 30\/09\/2024)"},{"issue":"1","key":"367_CR46","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"Szeto WY, Wu Y, Ho SC. An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur J Oper Res. 2011;215(1):126\u201335. https:\/\/doi.org\/10.1016\/j.ejor.2011.06.006.","journal-title":"Eur J Oper Res"},{"key":"367_CR47","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11831-017-9247-y","volume":"26","author":"AH Halim","year":"2019","unstructured":"Halim AH, Ismail I. Combinatorial optimization: comparison of heuristic algorithms in travelling salesman problem. Arch Comput Method Eng. 2019;26:367\u201380. https:\/\/doi.org\/10.1007\/s11831-017-9247-y.","journal-title":"Arch Comput Method Eng"},{"key":"367_CR48","first-page":"107","volume-title":"Nature-inspired optimizers","author":"S Saremi","year":"2020","unstructured":"Saremi S, Mirjalili S, Mirjalili S, Dong JS. Grasshopper optimization algorithm: theory, literature review, and appliction in hand posture estimation. In: Mirjalili S, Song Dong J, Lewis A, editors. Nature-inspired optimizers. Berlin: Springer; 2020. p. 107\u201322."},{"key":"367_CR49","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.engappai.2019.01.011","volume":"80","author":"MH Qais","year":"2019","unstructured":"Qais MH, Hasanien HM, Alghuwainem S. Enhanced salp swarm algorithm: application to variable speed wind generators. Eng Appl Artif Intell. 2019;80:82\u201396.","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"367_CR50","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1007\/s00366-020-01127-3","volume":"38","author":"VK Pathak","year":"2022","unstructured":"Pathak VK, Srivastava AK. A novel upgraded bat algorithm based on cuckoo search and Sugeno inertia weight for large scale and constrained engineering design optimization problems. Eng Comput. 2022;38(2):1731\u201358. https:\/\/doi.org\/10.1007\/s00366-020-01127-3.","journal-title":"Eng Comput"},{"issue":"2","key":"367_CR51","doi-asserted-by":"publisher","first-page":"150","DOI":"10.31181\/dmame622023644","volume":"6","author":"T Mzili","year":"2023","unstructured":"Mzili T, Mzili I, Riffi ME. Artificial rat optimization with decision-making: a bio-inspired metaheuristic algorithm for solving the traveling salesman problem. Decis Mak Appl Manag Eng. 2023;6(2):150\u201376. https:\/\/doi.org\/10.31181\/dmame622023644.","journal-title":"Decis Mak Appl Manag Eng"},{"key":"367_CR52","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-023-05513-8","author":"E Dalirinia","year":"2023","unstructured":"Dalirinia E, Jalali M, Yaghoobi M, Tabatabaee H. Lotus effect optimization algorithm (LEA): A lotus nature inspired algorithm for engineering design optimization. J Supercomput. 2023. https:\/\/doi.org\/10.1007\/s11227-023-05513-8.","journal-title":"J Supercomput"},{"key":"367_CR53","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-31876-2","author":"S Mohapatra","year":"2023","unstructured":"Mohapatra S, Mohapatra P. American zebra optimization algorithm for global optimization problems. Sci Rep. 2023. https:\/\/doi.org\/10.1038\/s41598-023-31876-2.","journal-title":"Sci Rep"},{"issue":"1","key":"367_CR54","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.32604\/cmes.2023.029404","volume":"139","author":"EV Altay","year":"2024","unstructured":"Altay EV, Altay O, \u00d6z\u00e7evik YA. Comparative study of metaheuristic optimization algorithms for solving real-world engineering design problems. Comput Model Eng Sci. 2024;139(1):1039\u201394. https:\/\/doi.org\/10.32604\/cmes.2023.029404.","journal-title":"Comput Model Eng Sci"},{"issue":"2","key":"367_CR55","doi-asserted-by":"publisher","first-page":"10","DOI":"10.58429\/pgjsrt.v2n2a14","volume":"2","author":"SM Almufti","year":"2023","unstructured":"Almufti SM, Ahmad Shaban A, Arif Ali Z, Ismael Ali R, Dela Fuente JA. Overview of metaheuristic algorithms. Polaris Global J Sch Res Trends. 2023;2(2):10\u201332. https:\/\/doi.org\/10.58429\/pgjsrt.v2n2a14.","journal-title":"Polaris Global J Sch Res Trends"}],"container-title":["Discover Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-025-00367-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44163-025-00367-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-025-00367-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T08:33:31Z","timestamp":1750322011000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44163-025-00367-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,19]]},"references-count":55,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["367"],"URL":"https:\/\/doi.org\/10.1007\/s44163-025-00367-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-5296966\/v1","asserted-by":"object"}]},"ISSN":["2731-0809"],"issn-type":[{"value":"2731-0809","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,19]]},"assertion":[{"value":"20 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2025","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"115"}}