{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T22:17:21Z","timestamp":1779401841342,"version":"3.53.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032261229","type":"print"},{"value":"9783032261236","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-26123-6_7","type":"book-chapter","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T21:21:39Z","timestamp":1779398499000},"page":"82-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Convergence and\u00a0Running Time of\u00a0Time-Dependent Ant Colony Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6278-5059","authenticated-orcid":false,"given":"Bodo","family":"Manthey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3416-7672","authenticated-orcid":false,"given":"Jesse","family":"van Rhijn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0471-1884","authenticated-orcid":false,"given":"Ashkan","family":"Safari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6357-8622","authenticated-orcid":false,"given":"Tjark","family":"Vredeveld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,22]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ipl.2007.08.013","volume":"105","author":"N Attiratanasunthron","year":"2008","unstructured":"Attiratanasunthron, N., Fakcharoenphol, J.: A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs. Inf. Process. Lett. 105(3), 88\u201392 (2008)","journal-title":"Inf. Process. Lett."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1613\/jair.530","volume":"9","author":"G Di Caro","year":"1998","unstructured":"Di Caro, G., Dorigo, M.: Antnet: distributed stigmergetic control for communications networks. J. Artif. Intell. Res. 9, 317\u2013365 (1998)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Di\u00a0Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), vol.\u00a02, pp. 1470\u20131477. IEEE (1999)","DOI":"10.1109\/CEC.1999.782657"},{"key":"7_CR4","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: an autocatalytic optimization process. Res. Rept. 91\u2013016 (1991)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: The ant colony optimization metaheuristic: algorithms, applications, and advances. Handb. Metaheuristics 250\u2013285 (2003)","DOI":"10.1007\/0-306-48056-5_9"},{"key":"7_CR6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. The MIT Press, Massachusetts (2004)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Gutjahr, W.: First steps to the runtime complexity analysis of ant colony optimization. Comput. Oper. Res. 35(9), 2711\u20132727 (2008). part Special Issue: Bio-inspired Methods in Combinatorial Optimization","DOI":"10.1016\/j.cor.2006.12.017"},{"issue":"8","key":"7_CR8","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"W Gutjahr","year":"2000","unstructured":"Gutjahr, W.: A graph-based ant system and its convergence. Futur. Gener. Comput. Syst. 16(8), 873\u2013888 (2000)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(01)00258-7","volume":"82","author":"W Gutjahr","year":"2002","unstructured":"Gutjahr, W.: ACO algorithms with guaranteed convergence to the optimal solution. Inf. Process. Lett. 82(3), 145\u2013153 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1017\/S0269964803174086","volume":"17","author":"W Gutjahr","year":"2003","unstructured":"Gutjahr, W.: A generalized convergence result for the graph-based ant system metaheuristic. Probab. Eng. Inf. Sci. 17(4), 545\u2013569 (2003)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Lehre, P., Neumann, F., Oliveto, P.: Ant colony optimization and the minimum cut problem. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 1393\u20131400 (2010)","DOI":"10.1145\/1830483.1830741"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11721-011-0059-7","volume":"6","author":"T K\u00f6tzing","year":"2012","unstructured":"K\u00f6tzing, T., Neumann, F., R\u00f6glin, H., Witt, C.: Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell. 6(1), 1\u201321 (2012)","journal-title":"Swarm Intell."},{"key":"7_CR13","unstructured":"Manthey, B., van Rhijn, J., Safari, A., Vredeveld, T.: Convergence and running time of time-dependent ant colony algorithms. arXiv preprint arXiv:2501.10810 (2025)"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Mavrovouniotis, M., Yang, S.: Adapting the pheromone evaporation rate in dynamic routing problems. In: Esparcia-Alc\u00e1zar, A.I. (eds.) Applications of Evolutionary Computation. EvoApplications 2013. LNCS, vol. 7835, pp. 606\u2013615. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37192-9_61","DOI":"10.1007\/978-3-642-37192-9_61"},{"key":"7_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00453-007-9134-2","volume":"54","author":"F Neumann","year":"2009","unstructured":"Neumann, F., Witt, C.: Runtime analysis of a simple ant colony optimization algorithm. Algorithmica 54(2), 243\u2013255 (2009)","journal-title":"Algorithmica"},{"issue":"25","key":"7_CR17","doi-asserted-by":"publisher","first-page":"2406","DOI":"10.1016\/j.tcs.2010.02.012","volume":"411","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Ant colony optimization and the minimum spanning tree problem. Theor. Comput. Sci. 411(25), 2406\u20132413 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s11721-011-0061-0","volume":"6","author":"P Pellegrini","year":"2012","unstructured":"Pellegrini, P., St\u00fctzle, T., Birattari, M.: A critical analysis of parameter adaptation in ant colony optimization. Swarm Intell. 6, 23\u201348 (2012)","journal-title":"Swarm Intell."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/B:ANOR.0000039523.95673.33","volume":"131","author":"S Shyu","year":"2004","unstructured":"Shyu, S., Yin, P., Lin, B.: An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann. Oper. Res. 131, 283\u2013304 (2004)","journal-title":"Ann. Oper. Res."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.: Max-min ant system and local search for the traveling salesman problem. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC), pp. 309\u2013314. IEEE (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"8","key":"7_CR21","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.: Max\u2013min ant system. Futur. Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.jda.2011.06.002","volume":"10","author":"D Sudholt","year":"2012","unstructured":"Sudholt, D., Thyssen, C.: Running time analysis of ant colony optimization for shortest path problems. J. Discret. Algorithms 10, 165\u2013180 (2012)","journal-title":"J. Discret. Algorithms"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/s44196-024-00652-z","volume":"17","author":"Y Tian","year":"2024","unstructured":"Tian, Y., Zhang, J., Wang, Q., Liu, S., Guo, Z., Zhang, H.: Application of hybrid algorithm based on ant colony optimization and sparrow search in UAV path planning. Int. J. Comput. Intell. Syst. 17(1), 286 (2024)","journal-title":"Int. J. Comput. Intell. Syst."},{"issue":"5","key":"7_CR24","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1109\/TEVC.2009.2016570","volume":"13","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y.: Runtime analysis of an ant colony optimization algorithm for TSP instances. IEEE Trans. Evol. Comput. 13(5), 1083\u20131092 (2009)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26123-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T21:21:42Z","timestamp":1779398502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26123-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032261229","9783032261236"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26123-6_7","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":"22 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ANTS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Darmstadt","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":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"antsw2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ants2026.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}