{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:40:33Z","timestamp":1779896433478,"version":"3.53.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,10,15]],"date-time":"2011-10-15T00:00:00Z","timestamp":1318636800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Swarm Intell"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11721-011-0059-7","type":"journal-article","created":{"date-parts":[[2011,10,13]],"date-time":"2011-10-13T20:46:20Z","timestamp":1318538780000},"page":"1-21","source":"Crossref","is-referenced-by-count":42,"title":["Theoretical analysis of two ACO approaches for the traveling salesman problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Timo","family":"K\u00f6tzing","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heiko","family":"R\u00f6glin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,10,15]]},"reference":[{"issue":"6","key":"59_CR1","doi-asserted-by":"crossref","first-page":"1998","DOI":"10.1137\/S0097539793251244","volume":"28","author":"B. Chandra","year":"1999","unstructured":"Chandra, B., Karloff, H. J., & Tovey, C. A. (1999). New results on the old k-Opt algorithm for the traveling salesman problem. SIAM Journal on Computing, 28(6), 1998\u20132029.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"59_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), 53\u201366.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"59_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., & St\u00fctzle, T. (2004). Ant colony optimization. Cambridge: MIT Press."},{"key":"59_CR4","volume-title":"Introduction to evolutionary computing","author":"A. Eiben","year":"2007","unstructured":"Eiben, A., & Smith, J. (2007). Introduction to evolutionary computing (2nd\u00a0ed.). Berlin: Springer.","edition":"2"},{"key":"59_CR5","first-page":"1295","volume-title":"SODA\u201907: Proceedings of the eighteenth annual ACM\u2013SIAM symposium on discrete algorithms","author":"M. Englert","year":"2007","unstructured":"Englert, M., R\u00f6glin, H., & V\u00f6cking, B. (2007). Worst case and probabilistic analysis of the 2-opt algorithm for the TSP: extended abstract. In N. Bansal, K. Pruhs, & C. Stein (Eds.), SODA\u201907: Proceedings of the eighteenth annual ACM\u2013SIAM symposium on discrete algorithms (pp.\u00a01295\u20131304). Philadelphia: Society for Industrial and Applied Mathematics."},{"issue":"1","key":"59_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s11721-007-0001-1","volume":"1","author":"W. J. Gutjahr","year":"2007","unstructured":"Gutjahr, W. J. (2007). Mathematical runtime analysis of ACO algorithms: survey on an emerging issue. Swarm Intelligence, 1(1), 59\u201379.","journal-title":"Swarm Intelligence"},{"issue":"3","key":"59_CR7","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s11009-007-9047-1","volume":"10","author":"W. J. Gutjahr","year":"2008","unstructured":"Gutjahr, W. J., & Sebastiani, G. (2008). Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability, 10(3), 409\u2013433.","journal-title":"Methodology and Computing in Applied Probability"},{"issue":"1","key":"59_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J. He","year":"2004","unstructured":"He, J., & Yao, X. (2004). A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1), 21\u201335.","journal-title":"Natural Computing"},{"key":"59_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-3-642-03751-1_6","volume-title":"Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics, second international workshop, SLS","author":"C. Horoba","year":"2009","unstructured":"Horoba, C., & Sudholt, D. (2009). Running time analysis of ACO systems for shortest path problems. In T. St\u00fctzle, M. Birattari, & H. H. Hoos (Eds.), Lecture notes in computer science: Vol. 5752. Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics, second international workshop, SLS, 2009 (pp.\u00a076\u201391). Berlin: Springer."},{"key":"59_CR10","volume-title":"Local search in combinatorial optimization","author":"D. S. Johnson","year":"1997","unstructured":"Johnson, D. S., & McGeoch, L. A. (1997). The traveling salesman problem: a case study in local optimization. In E. H. L. Aarts & J. K. Lenstra (Eds.), Local search in combinatorial optimization. Somerset: Wiley."},{"key":"59_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-642-15461-4_28","volume-title":"Swarm intelligence, 7th international conference, ANTS","author":"T. K\u00f6tzing","year":"2010","unstructured":"K\u00f6tzing, T., Neumann, F., R\u00f6glin, H., & Witt, C. (2010). Theoretical properties of two ACO approaches for the traveling salesman problem. In M. Dorigo, M. Birattari, G. A. D. Caro, R. Doursat, A. P. Engelbrecht, D. Floreano, L. M. Gambardella, R. Gro\u00df, E. Sahin, H. Sayama, & T. St\u00fctzle (Eds.), Lecture notes in computer science: Vol. 6234. Swarm intelligence, 7th international conference, ANTS, 2010 (pp.\u00a0324\u2013335). Berlin: Springer."},{"key":"59_CR12","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/978-3-540-87527-7_12","volume-title":"Ant colony optimization and swarm intelligence, 6th international conference, ANTS","author":"F. Neumann","year":"2008","unstructured":"Neumann, F., Sudholt, D., & Witt, C. (2008). Rigorous analyses for the combination of ant colony optimization and local search. In M. Dorigo, M. Birattari, C. Blum, M. Clerc, T. St\u00fctzle, & A. F. T. Winfield (Eds.), Lecture notes in computer science: Vol. 5217. Ant colony optimization and swarm intelligence, 6th international conference, ANTS, 2008 (pp.\u00a0132\u2013143). Berlin: Springer."},{"issue":"1","key":"59_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s11721-008-0023-3","volume":"3","author":"F. Neumann","year":"2009","unstructured":"Neumann, F., Sudholt, D., & Witt, C. (2009). Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence, 3(1), 35\u201368.","journal-title":"Swarm Intelligence"},{"issue":"2","key":"59_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00453-007-9134-2","volume":"54","author":"F. Neumann","year":"2009","unstructured":"Neumann, F., & Witt, C. (2009). Runtime analysis of a simple ant colony optimization algorithm. Algorithmica, 54(2), 243\u2013255.","journal-title":"Algorithmica"},{"issue":"25","key":"59_CR15","doi-asserted-by":"crossref","first-page":"2406","DOI":"10.1016\/j.tcs.2010.02.012","volume":"411","author":"F. Neumann","year":"2010","unstructured":"Neumann, F., & Witt, C. (2010). Ant colony optimization and the minimum spanning tree problem. Theoretical Computer Science, 411(25), 2406\u20132413.","journal-title":"Theoretical Computer Science"},{"key":"59_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired computation in combinatorial optimization\u2014algorithms and their computational complexity","author":"F. Neumann","year":"2010","unstructured":"Neumann, F., & Witt, C. (2010). Bioinspired computation in combinatorial optimization\u2014algorithms and their computational complexity. Berlin: Springer."},{"issue":"3","key":"59_CR17","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D. A. Spielman","year":"2004","unstructured":"Spielman, D. A., & Teng, S.-H. (2004). Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. Journal of the ACM, 51(3), 385\u2013463.","journal-title":"Journal of the ACM"},{"issue":"8","key":"59_CR18","doi-asserted-by":"crossref","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. H. (2000). $\\mathcal{MAX}$ \u2013 $\\mathcal{MIN}$ ant system. Future Generations Computer Systems, 16(8), 889\u2013914.","journal-title":"Future Generations Computer Systems"},{"issue":"5","key":"59_CR19","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1109\/TEVC.2009.2016570","volume":"13","author":"Y. Zhou","year":"2009","unstructured":"Zhou, Y. (2009). Runtime analysis of an ant colony optimization algorithm for TSP instances. IEEE Transactions on Evolutionary Computation, 13(5), 1083\u20131092.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-011-0059-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11721-011-0059-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-011-0059-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:27:25Z","timestamp":1559561245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11721-011-0059-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,15]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s11721-011-0059-7","relation":{},"ISSN":["1935-3812","1935-3820"],"issn-type":[{"value":"1935-3812","type":"print"},{"value":"1935-3820","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,15]]}}}