{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T11:04:01Z","timestamp":1744974241524},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74446-7_5","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T03:39:15Z","timestamp":1187667555000},"page":"61-75","source":"Crossref","is-referenced-by-count":10,"title":["Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions"],"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":"5_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":"5_CR2","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: An autocatalytic optimizing process. Technical Report 91-016 Revised, Politecnico di Milano (1991)"},{"key":"5_CR3","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":"5_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambr. Univ.Press, Cambridge (1995)"},{"key":"5_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing\u00a0\u2013\u00a0Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing\u00a0\u2013\u00a0Randomized Algorithms and Probabilistic Analysis. Cambr. Univ. Press, Cambridge (2005)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(01)00258-7","volume":"82","author":"W.J. Gutjahr","year":"2002","unstructured":"Gutjahr, W.J.: ACO algorithms with guaranteed convergence to the optimal solution. Inform. Process. Lett.\u00a082, 145\u2013153 (2002)","journal-title":"Inform. Process. Lett."},{"key":"5_CR7","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":"5_CR8","doi-asserted-by":"crossref","unstructured":"Gutjahr, W.J.: First steps to the runtime complexity analysis of Ant Colony Optimization. Comput. Oper. Res (to appear)","DOI":"10.1016\/j.cor.2006.12.017"},{"key":"5_CR9","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) extended version to appear in Algorithmica"},{"key":"5_CR10","volume-title":"Proc. of GECCO 2007","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 2007, ACM Press, New York (2007)"},{"key":"5_CR11","unstructured":"Gutjahr, W.J., Sebastiani, G.: Runtime analysis of ant colony optimization. Technical report, Mathematics department, \u201dSapienza\u201d Univ. of Rome, 2007\/03 (2007)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Gutjahr, W.J.: Mathematical runtime analysis of ACO algorithms: Survey on an emerging issue. Swarm Intelligence (to appear)","DOI":"10.1007\/s11721-007-0001-1"},{"key":"5_CR13","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. Methodol. Comput. Appli. Probab.\u00a08, 105\u2013133 (2006)","journal-title":"Methodol. Comput. Appli. Probab."},{"key":"5_CR14","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. J. Future Gener. Comput. Syst.\u00a016, 889\u2013914 (2000)","journal-title":"J. Future Gener. Comput. Syst."},{"issue":"6","key":"5_CR15","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/4235.974841","volume":"5","author":"T. Jansen","year":"2001","unstructured":"Jansen, T., Wegener, I.: Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evolut. Comput.\u00a05(6), 589\u2013599 (2001)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J. Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolut. Comput.\u00a07, 173\u2013203 (1999)","journal-title":"Evolut. Comput."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S0963548304006650","volume":"14","author":"I. Wegener","year":"2005","unstructured":"Wegener, I., Witt, C.: On the optimization of monotone polynomials by simple randomized search heuristics. Combin. Probab. Comput.\u00a014, 225\u2013247 (2005)","journal-title":"Combin. Probab. Comput."},{"key":"5_CR18","first-page":"349","volume-title":"Evolutionary Optimization","author":"I. Wegener","year":"2002","unstructured":"Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Sarker, R., Yao, X., Mohammadian, M. (eds.) Evolutionary Optimization, pp. 349\u2013369. Kluwer, Dordrecht (2002)"},{"key":"5_CR19","unstructured":"Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Kova\u010d (1997)"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74446-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:27:49Z","timestamp":1619504869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74446-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744450"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74446-7_5","relation":{},"subject":[]}}