{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T18:49:12Z","timestamp":1782499752604,"version":"3.54.5"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032299239","type":"print"},{"value":"9783032299246","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-29924-6_14","type":"book-chapter","created":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T18:06:24Z","timestamp":1782497184000},"page":"197-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of\u00a0Parameter Settings for\u00a0the\u00a0Bat Algorithm Using Variance Evolution"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8231-5556","authenticated-orcid":false,"given":"Xin-She","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5049-2993","authenticated-orcid":false,"given":"Mehmet","family":"Karamanoglu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,27]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0377-2217(96)00121-X","volume":"96","author":"H Aytug","year":"1996","unstructured":"Aytug, H., Bhattacharrya, S., Koehler, G.J.: A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets. Eur. J. Oper. Res. 96(1), 195\u2013201 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/S0377-2217(99)00321-5","volume":"126","author":"H Aytug","year":"2000","unstructured":"Aytug, H., Koehler, G.J.: New stopping criterion for genetic algorithms. Eur. J. Oper. Res. 126(2), 662\u2013674 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR3","volume-title":"Mathematics for Dynamic Modeling","author":"EJ Beltrami","year":"1998","unstructured":"Beltrami, E.J.: Mathematics for Dynamic Modeling, 2nd edn. Academic Press, San Diego (1998)","edition":"2"},{"key":"14_CR4","doi-asserted-by":"publisher","DOI":"10.4324\/9781003002314","volume-title":"Probability Models in Engineering and Science","author":"H Benaroya","year":"2005","unstructured":"Benaroya, H., Han, S.M.: Probability Models in Engineering and Science. CRC Press, Boca Raton (2005)"},{"key":"14_CR5","first-page":"281","volume":"13","author":"J Bergstra","year":"2012","unstructured":"Bergstra, J., Bengio, Y.: Random search for hyper-parameter optimization. J. Mach. Learn. Res. 13, 281\u2013305 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"14_CR7","first-page":"319","volume":"32","author":"LC Cagnina","year":"2008","unstructured":"Cagnina, L.C., Esquivel, S.C., Coello Coello, A.C.: Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32(2), 319\u2013326 (2008)","journal-title":"Informatica"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.cor.2004.08.012","volume":"33","author":"A Chatterjee","year":"2006","unstructured":"Chatterjee, A., Siarry, P.: Nonlinear inertia variation for dynamic adaptation in particle swarm optimization. Comput. Oper. Res. 33(3), 859\u2013871 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.eswa.2018.07.036","volume":"114","author":"S Chen","year":"2018","unstructured":"Chen, S., Peng, G.H., He, X.S., Yang, X.S.: Global convergence analysis of the bat algorithm using a Markovian framework and dynamic system theory. Expert Syst. Appl. 114(1), 173\u2013182 (2018)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc, M., Kennedy, J.: The particle swarm: explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58\u201373 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.swevo.2011.02.001","volume":"1","author":"AE Eiben","year":"2011","unstructured":"Eiben, A.E., Smit, S.K.: Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm Evol. Comput. 1(1), 19\u201331 (2011)","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.jocs.2013.10.002","volume":"5","author":"AH Gandom","year":"2014","unstructured":"Gandom, A.H., Yang, X.S.: Chaotic bat algorithm. J. Comput. Sci. 5(2), 224\u2013232 (2014)","journal-title":"J. Comput. Sci."},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1007\/s00521-012-1028-9","volume":"22","author":"AH Gandomi","year":"2013","unstructured":"Gandomi, A.H., Yang, X.S., Alavi, A.H., Talatahari, S.: Bat algorithm for constrained optimization tasks. Neural Comput. Appl. 22(6), 1239\u20131255 (2013)","journal-title":"Neural Comput. Appl."},{"key":"14_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21593-8","volume-title":"Fixed Point Theory","author":"A Granas","year":"2003","unstructured":"Granas, A., Dugundji, J.: Fixed Point Theory. Springer, New York (2003)"},{"key":"14_CR15","volume-title":"Introduction to Probability","author":"CM Grindstead","year":"1997","unstructured":"Grindstead, C.M., Snell, J.L.: Introduction to Probability, 2nd edn. Americal Mathematical Society, Providence (1997)","edition":"2"},{"issue":"4","key":"14_CR16","first-page":"366","volume":"11","author":"A Hekmatinia","year":"2019","unstructured":"Hekmatinia, A., Shanghooshabad, A.M., Motevali, M.M., Almasi, M.: Tuning parameter via a new rapid, accurate and parameter-less method using meta-learning. Int. J. Data Mining Model. Manag. 11(4), 366\u2013390 (2019)","journal-title":"Int. J. Data Mining Model. Manag."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Joy, G., Huyck, C., Yang, X.S.: Parameter tuning of the firefly algorithm by three tuning methods: standard Monte Carlo, quasi-Monte Carlo and Latin hypercube sampling methods. J. Comput. Sci. 87, Article 102588 (2025)","DOI":"10.1016\/j.jocs.2025.102588"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942\u20131948. IEEE, Piscataway, NJ, USA (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"14_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033074","volume-title":"An Introduction to Metric Space and Fixed Point Theory","author":"MA Khamsi","year":"2001","unstructured":"Khamsi, M.A., Kirk, W.A.: An Introduction to Metric Space and Fixed Point Theory. Wiley, New York (2001)"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00031305.1992.10475842","volume":"46","author":"GW Oehlert","year":"1992","unstructured":"Oehlert, G.W.: A note on the delta method. Am. Stat. 46(1), 27\u201329 (1992)","journal-title":"Am. Stat."},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba, E., Yang, X.S., Diaz, F., Lopez-Garcia, P., Carballedo, R.: An improved discrete bat algorithm for symmetric and assymmetric travelling salesman problems. Eng. Appl. Artif. Intell. 48(1), 59\u201371 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"4","key":"14_CR22","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S1874-1029(13)60037-3","volume":"39","author":"F Pan","year":"2013","unstructured":"Pan, F., Li, X., Zhou, Q., Li, W., Gao, Q.: Analysis of standard particle swarm optimization algorithm based on Markov chain. Acta Automatica Sinica 39(4), 381\u2013389 (2013)","journal-title":"Acta Automatica Sinica"},{"key":"14_CR23","unstructured":"Pham, D., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., Zaidi, M.: The bees algorithm, technical note. Technical report, Cardiff University, Manufacturing Engineering Center, Cardiff (2005)"},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G Rudolph","year":"1994","unstructured":"Rudolph, G.: Convergence analysis of canonical genetic algorithms. IEEE Trans. Neural Networks 5(1), 96\u2013101 (1994)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"4","key":"14_CR25","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: a simple and efficient heuristic for global optimization. J. Global Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"issue":"21","key":"14_CR26","doi-asserted-by":"publisher","first-page":"2084","DOI":"10.1016\/j.tcs.2010.03.002","volume":"411","author":"D Sudholt","year":"2010","unstructured":"Sudholt, D., Witt, C.: Runtime analysis of a binary particle swarm optimizer. Theoret. Comput. Sci. 411(21), 2084\u20132100 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"14_CR27","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(02)00447-7","volume":"85","author":"IC Trelea","year":"2003","unstructured":"Trelea, I.C.: The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf. Process. Lett. 85(6), 317\u2013325 (2003)","journal-title":"Inf. Process. Lett."},{"key":"14_CR28","volume-title":"Introduction to Variance Estimation","author":"KM Wolter","year":"1985","unstructured":"Wolter, K.M.: Introduction to Variance Estimation. Springer, New York (1985)"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: Cruz, C., Gonz\u00e1lez, J.R., Pelta, D.A., Terrazas, G. (eds.) Nature Inspired Cooperative Strategies for Optimization (NISCO 2010). Studies in Computational Intelligence, vol. 284, pp. 65\u201374. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"14_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2020.101104","volume":"46","author":"XS Yang","year":"2020","unstructured":"Yang, X.S.: Nature-inspired optimization algorithms: challenges and open problems. J. Comput. Sci. 46, 101104 (2020)","journal-title":"J. Comput. Sci."},{"issue":"5","key":"14_CR31","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1108\/02644401211235834","volume":"29","author":"XS Yang","year":"2012","unstructured":"Yang, X.S., Gandomi, A.H.: Bat algorithm: a novel approach for global engineering optimization. Eng. Comput. 29(5), 464\u2013483 (2012)","journal-title":"Eng. Comput."},{"issue":"3","key":"14_CR32","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1016\/j.asoc.2009.02.012","volume":"9","author":"D Zaharie","year":"2009","unstructured":"Zaharie, D.: Influence of crossover on the behavior of the differential evolution algorithm. Appl. Soft Comput. 9(3), 1126\u20131138 (2009)","journal-title":"Appl. Soft Comput."},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Zaharie, D., Micota, F.: Revisting the analysis of the population variance in differential evolution algorithms. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 1811\u20131818. Donostia, Spain (2017). https:\/\/doi.org\/10.1109\/CEC.2017.7969521","DOI":"10.1109\/CEC.2017.7969521"},{"key":"14_CR34","unstructured":"Zdenek, D.: Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-29924-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T18:06:30Z","timestamp":1782497190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29924-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032299239","9783032299246"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29924-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"27 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors confirm that there are no relevant financial or non-financial competing interests to report. No funding was received for this research work. No datasets were received\/used. All results are simulated and reproducible from the proposed method.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}