{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:23:13Z","timestamp":1762100593197},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_62","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"618-627","source":"Crossref","is-referenced-by-count":39,"title":["Runtime Analysis of a Simple Ant Colony Optimization Algorithm"],"prefix":"10.1007","author":[{"given":"Frank","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M. Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theor. Comput. Sci.\u00a0344, 243\u2013278 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"62_CR2","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: An autocatalytic optimizing process. Tech. Rep. 91-016 Revised, Politecnico di Milano (1991)"},{"key":"62_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci.\u00a0276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"62_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-36494-3_37","volume-title":"STACS 2003","author":"O. Giel","year":"2003","unstructured":"Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 415\u2013426. Springer, Heidelberg (2003)"},{"key":"62_CR6","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1017\/S0269964803174086","volume":"17","author":"W.J. Gutjahr","year":"2003","unstructured":"Gutjahr, W.J.: A generalized convergence result for the graph-based ant system metaheuristic. Probab. Eng. Inform. Sc.\u00a017, 545\u2013569 (2003)","journal-title":"Probab. Eng. Inform. Sc."},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"Gutjahr, W.J.: On the finite-time dynamics of ant colony optimization. Methodology and Computing in Applied Probability (to appear, 2006)","DOI":"10.1007\/s11009-006-7291-4"},{"key":"62_CR8","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1214\/aoms\/1177728178","volume":"27","author":"W. Hoeffding","year":"1956","unstructured":"Hoeffding, W.: On the distribution of the number of successes in independent trials. Ann. Math. Stat.\u00a027, 713\u2013721 (1956)","journal-title":"Ann. Math. Stat."},{"issue":"1\u20133","key":"62_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(97)00133-9","volume":"82","author":"M. Jerrum","year":"1998","unstructured":"Jerrum, M., Sorkin, G.B.: The Metropolis algorithm for graph bisection. Discrete Appl. Math.\u00a082(1\u20133), 155\u2013175 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"62_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1162\/106365602760234090","volume":"10","author":"D. Merkle","year":"2002","unstructured":"Merkle, D., Middendorf, M.: Modelling the dynamics of ant colony optimization algorithms. Evolutionary Computation\u00a010(3), 235\u2013262 (2002)","journal-title":"Evolutionary Computation"},{"key":"62_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-540-24854-5_73","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"F. Neumann","year":"2004","unstructured":"Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. In: Deb, K., et al.(eds.) GECCO 2004. LNCS, vol.\u00a03102, pp. 713\u2013724. Springer, Heidelberg (2004)"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Runtime analysis of a simple ant colony optimization algorithm. Tech. Rep. TR06-084, Electr. Colloq. on Comput. Compl. (ECCC) (2006)","DOI":"10.1007\/11940128_62"},{"key":"62_CR13","first-page":"438","volume-title":"Proc. of STOC 1990","author":"C.H. Papadimitriou","year":"1990","unstructured":"Papadimitriou, C.H., Sch\u00e4ffer, A.A., Yannakakis, M.: On the complexity of local search. In: Proc. of STOC 1990, pp. 438\u2013445. ACM Press, New York (1990)"},{"key":"62_CR14","unstructured":"Scheideler, C.: Probabilistic Methods for Coordination Problems. HNI-Verlagsschriftenreihe 78, University of Paderborn. Habilitation Thesis (2000), available at http:\/\/www14.in.tum.de\/personen\/scheideler\/index.html.en"},{"key":"62_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/11523468_48","volume-title":"Automata, Languages and Programming","author":"I. Wegener","year":"2005","unstructured":"Wegener, I.: Simulated annealing beats metropolis in combinatorial optimization. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 589\u2013601. Springer, Heidelberg (2005)"},{"key":"62_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-31856-9_4","volume-title":"STACS 2005","author":"C. Witt","year":"2005","unstructured":"Witt, C.: Worst-case and average-case approximations by simple randomized search heuristics. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 44\u201356. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T06:54:11Z","timestamp":1628146451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11940128_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}