{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:25:12Z","timestamp":1725564312198},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642154607"},{"type":"electronic","value":"9783642154614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15461-4_28","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T12:14:30Z","timestamp":1283516070000},"page":"324-335","source":"Crossref","is-referenced-by-count":5,"title":["Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Timo","family":"K\u00f6tzing","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Heiko","family":"R\u00f6glin","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1998","DOI":"10.1137\/S0097539793251244","volume":"28","author":"B. Chandra","year":"1999","unstructured":"Chandra, B., Karloff, H.J., Tovey, C.A.: New results on the old k-Opt algorithm for the traveling salesman problem. SIAM J. Comput.\u00a028(6), 1998\u20132029 (1999)","journal-title":"SIAM J. Comput."},{"key":"28_CR2","doi-asserted-by":"crossref","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. MIT Press, Cambrigde (2004)"},{"key":"28_CR3","volume-title":"Introduction to Evolutionary Computing","author":"A. Eiben","year":"2007","unstructured":"Eiben, A., Smith, J.: Introduction to Evolutionary Computing, 2nd edn. Springer, Berlin (2007)","edition":"2"},{"key":"28_CR4","first-page":"1295","volume-title":"SODA","author":"M. Englert","year":"2007","unstructured":"Englert, M., R\u00f6glin, H., V\u00f6cking, B.: Worst case and probabilistic analysis of the 2-opt algorithm for the tsp: extended abstract. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 1295\u20131304. SIAM, Philadelphia (2007)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s11009-007-9047-1","volume":"10","author":"W.J. Gutjahr","year":"2008","unstructured":"Gutjahr, W.J., Sebastiani, G.: Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability\u00a010, 409\u2013433 (2008)","journal-title":"Methodology and Computing in Applied Probability"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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","author":"C. Horoba","year":"2009","unstructured":"Horoba, C., Sudholt, D.: Running time analysis of ACO systems for shortest path problems. In: St\u00fctzle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2009. LNCS, vol.\u00a05752, pp. 76\u201391. Springer, Heidelberg (2009)"},{"key":"28_CR7","unstructured":"Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization. Wiley, Chichester (1997)"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s11721-008-0023-3","volume":"3","author":"F. Neumann","year":"2009","unstructured":"Neumann, F., Sudholt, D., Witt, C.: Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence\u00a03(1), 35\u201368 (2009)","journal-title":"Swarm Intelligence"},{"issue":"2","key":"28_CR9","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\u00a054(2), 243\u2013255 (2009)","journal-title":"Algorithmica"},{"issue":"3","key":"28_CR10","first-page":"385","volume":"51","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J.\u00a0ACM\u00a051(3), 385\u2013463 (2004)","journal-title":"J.\u00a0ACM"},{"issue":"5","key":"28_CR11","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 Transactions on Evolutionary Computation\u00a013(5), 1083\u20131092 (2009)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15461-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T17:32:03Z","timestamp":1553016723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15461-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642154607","9783642154614"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15461-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}