{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:52:11Z","timestamp":1762390331575},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875260"},{"type":"electronic","value":"9783540875277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87527-7_12","type":"book-chapter","created":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T02:14:06Z","timestamp":1221790446000},"page":"132-143","source":"Crossref","is-referenced-by-count":21,"title":["Rigorous Analyses for the Combination of Ant\u00a0Colony\u00a0Optimization and Local Search"],"prefix":"10.1007","author":[{"given":"Frank","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","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, Cambridge (2004)"},{"key":"12_CR2","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations & Applications. Elsevier\/Morgan Kaufmann (2004)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Levine, J., Ducatelle, F.: Ant colony optimisation and local search for bin packing and cutting stock problems. Journal of the Operational Research Society (2004)","DOI":"10.1057\/palgrave.jors.2601771"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T., Dorigo, M.: Incremental local search in ant colony optimization: Why it fails for the quadratic assignment problem. In: Proc. of ANTS Workshop\u00a02006, pp. 156\u2013166 (2006)","DOI":"10.1007\/11839088_14"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1162\/106365602760234090","volume":"10","author":"D. Merkle","year":"2002","unstructured":"Merkle, D., Middendorf, M.: Modeling the dynamics of ant colony optimization. Evolutionary Computation\u00a010, 235\u2013262 (2002)","journal-title":"Evolutionary Computation"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s11009-006-7291-4","volume":"8","author":"W.J. Gutjahr","year":"2006","unstructured":"Gutjahr, W.J.: On the finite-time dynamics of ant colony optimization. Methodology and Computing in Applied Probability\u00a08, 105\u2013133 (2006)","journal-title":"Methodology and Computing in Applied Probability"},{"key":"12_CR7","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.H.: MAX-MIN ant system. Journal of Future Generation Computer Systems\u00a016, 889\u2013914 (2000)","journal-title":"Journal of Future Generation Computer Systems"},{"key":"12_CR8","first-page":"33","volume-title":"Proc. of GECCO\u00a02007","author":"B. Doerr","year":"2007","unstructured":"Doerr, B., Neumann, F., Sudholt, D., Witt, C.: On the runtime analysis of the 1-ANT ACO algorithm. In: Proc. of GECCO\u00a02007, pp. 33\u201340. ACM, New York (2007)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Gutjahr, W.J., Sebastiani, G.: Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability (to appear, 2008)","DOI":"10.1007\/s11009-007-9047-1"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-74446-7_5","volume-title":"Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics","author":"F. Neumann","year":"2007","unstructured":"Neumann, F., Sudholt, D., Witt, C.: Comparing variants of MMAS ACO algorithms on pseudo-Boolean functions. In: St\u00fctzle, T., Birattari, M., H. Hoos, H. (eds.) SLS 2007. LNCS, vol.\u00a04638, pp. 61\u201375. Springer, Heidelberg (2007)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/11940128_62","volume-title":"Algorithms and Computation","author":"F. Neumann","year":"2006","unstructured":"Neumann, F., Witt, C.: Runtime analysis of a simple ant colony optimization algorithm. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 618\u2013627. Springer, Heidelberg (2006)"},{"issue":"9","key":"12_CR12","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1016\/j.cor.2006.12.017","volume":"35","author":"W.J. Gutjahr","year":"2008","unstructured":"Gutjahr, W.J.: First steps to the runtime complexity analysis of ant colony optimization. Computers and Operations Research\u00a035(9), 2711\u20132727 (2008)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Ant Colony Optimization and Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87527-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:38:18Z","timestamp":1606167498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87527-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540875260","9783540875277"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87527-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}