{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:51:54Z","timestamp":1762390314965},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,5]],"date-time":"2008-12-05T00:00:00Z","timestamp":1228435200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Swarm Intell"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s11721-008-0023-3","type":"journal-article","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T19:04:58Z","timestamp":1228417498000},"page":"35-68","source":"Crossref","is-referenced-by-count":70,"title":["Analysis of different MMAS ACO algorithms on\u00a0unimodal functions and plateaus"],"prefix":"10.1007","volume":"3","author":[{"given":"Frank","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,5]]},"reference":[{"key":"23_CR1","volume-title":"Markov chains: Gibbs fields, Monte Carlo simulation, and queues","author":"P. Br\u00e9maud","year":"1998","unstructured":"Br\u00e9maud, P. (1998). Markov chains: Gibbs fields, Monte Carlo simulation, and queues. New York: Springer."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1109\/CEC.2007.4424512","volume-title":"Proceedings of the congress on evolutionary computation (CEC \u201907)","author":"B. Doerr","year":"2007","unstructured":"Doerr, B., & Johannsen, D. (2007). Refined runtime analysis of a basic ant colony optimization algorithm. In Proceedings of the congress on evolutionary computation (CEC \u201907) (pp. 501\u2013507). New York: IEEE Press."},{"key":"23_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1007\/11844297_99","volume-title":"Parallel problem solving from nature (PPSN \u201906)","author":"B. Doerr","year":"2006","unstructured":"Doerr, B., Hebbinghaus, N., & Neumann, F. (2006). Speeding up evolutionary algorithms through restricted mutation operators. In LNCS : Vol. 4193. Parallel problem solving from nature (PPSN \u201906) (pp. 978\u2013987). Berlin: Springer."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1276958.1276964","volume-title":"Proceedings of the genetic and evolutionary computation conference (GECCO \u201907)","author":"B. Doerr","year":"2007","unstructured":"Doerr, B., Neumann, F., Sudholt, D., & Witt, C. (2007). On the runtime analysis of the 1-ANT ACO algorithm. In Proceedings of the genetic and evolutionary computation conference (GECCO \u201907) (pp. 33\u201340). New York: ACM."},{"key":"23_CR5","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. (2005). Ant colony optimization theory: A survey. Theoretical Computer Science, 344, 243\u2013278.","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","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. (2004). Ant colony optimization. Cambridge: MIT Press."},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B, 26(1), 29\u201341.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics Part B"},{"key":"23_CR8","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. (2002). On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276, 51\u201381.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S. Droste","year":"2006","unstructured":"Droste, S., Jansen, T., & Wegener, I. (2006). Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 39(4), 525\u2013544.","journal-title":"Theory of Computing Systems"},{"key":"23_CR10","volume-title":"Introduction to evolutionary computing","author":"A. Eiben","year":"2007","unstructured":"Eiben, A., & Smith, J. (2007). Introduction to evolutionary computing (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","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. (1999). Rigorous hitting times for binary mutations. Evolutionary Computation, 7(2), 173\u2013203.","journal-title":"Evolutionary Computation"},{"key":"23_CR12","series-title":"LNCS","first-page":"415","volume-title":"Proceedings of the 20th annual symposium on theoretical aspects of computer science (STACS\u00a0\u201903)","author":"O. Giel","year":"2003","unstructured":"Giel, O., & Wegener, I. (2003). Evolutionary algorithms and the maximum matching problem. In LNCS : Vol.\u00a02607. Proceedings of the 20th annual symposium on theoretical aspects of computer science (STACS\u00a0\u201903) (pp. 415\u2013426). Berlin: Springer."},{"issue":"3","key":"23_CR13","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. (2002). ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters, 82(3), 145\u2013153.","journal-title":"Information Processing Letters"},{"issue":"1","key":"23_CR14","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. (2006). On the finite-time dynamics of ant colony optimization. Methodology and Computing in Applied Probability, 8(1), 105\u2013133.","journal-title":"Methodology and Computing in Applied Probability"},{"key":"23_CR15","doi-asserted-by":"publisher","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, 59\u201379.","journal-title":"Swarm Intelligence"},{"issue":"9","key":"23_CR16","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. (2008). First steps to the runtime complexity analysis of ant colony optimization. Computers and Operations Research, 35(9), 2711\u20132727.","journal-title":"Computers and Operations Research"},{"key":"23_CR17","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. (2008). Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability, 10, 409\u2013433.","journal-title":"Methodology and Computing in Applied Probability"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Jansen, T. Sudholt, D. (2009, to appear). Analysis of an asymmetric mutation operator. Evolutionary Computation.","DOI":"10.1162\/evco.2010.18.1.18101"},{"issue":"6","key":"23_CR19","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/4235.974841","volume":"5","author":"T. Jansen","year":"2001","unstructured":"Jansen, T., & Wegener, I. (2001). Evolutionary algorithms\u2014how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation, 5(6), 589\u2013599.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"23_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and computing\u2014randomized algorithms and probabilistic analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., & Upfal, E. (2005). Probability and computing\u2014randomized algorithms and probabilistic analysis. Cambridge: Cambridge University Press."},{"key":"23_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., & Raghavan, P. (1995). Randomized algorithms. Cambridge: Cambridge University Press."},{"key":"23_CR22","first-page":"904","volume-title":"Proceedings of the congress on evolutionary computation (CEC \u201904)","author":"F. Neumann","year":"2004","unstructured":"Neumann, F. (2004). Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. In Proceedings of the congress on evolutionary computation (CEC \u201904) (Vol. 1, pp. 904\u2013910). New York: IEEE Press."},{"issue":"3","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.ejor.2006.08.005","volume":"181","author":"F. Neumann","year":"2007","unstructured":"Neumann, F. (2007). Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. European Journal of Operational Research, 181(3), 1620\u20131629.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"23_CR24","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11047-006-9004-x","volume":"5","author":"F. Neumann","year":"2006","unstructured":"Neumann, F., & Wegener, I. (2006). Minimum spanning trees made easier via multi-objective optimization. Natural Computing, 5(3), 305\u2013319.","journal-title":"Natural Computing"},{"issue":"1","key":"23_CR25","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F. Neumann","year":"2007","unstructured":"Neumann, F., & Wegener, I. (2007). Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science, 378(1), 32\u201340.","journal-title":"Theoretical Computer Science"},{"key":"23_CR26","series-title":"LNCS","first-page":"618","volume-title":"Proceedings of the 17th international symposium on algorithms and computation (ISAAC\u00a0\u201906)","author":"F. Neumann","year":"2006","unstructured":"Neumann, F., & Witt, C. (2006). Runtime analysis of a simple ant colony optimization algorithm. In LNCS : Vol. 4288. Proceedings of the 17th international symposium on algorithms and computation (ISAAC\u00a0\u201906) (pp. 618\u2013627). Berlin: Springer. Extended version to appear in Algorithmica."},{"key":"23_CR27","series-title":"LNCS","first-page":"61","volume-title":"Proceedings of engineering stochastic local search algorithms (SLS \u201907)","author":"F. Neumann","year":"2007","unstructured":"Neumann, F., Sudholt, D., & Witt, C. (2007). Comparing variants of MMAS ACO algorithms on pseudo-Boolean functions. In LNCS : Vol. 4638. Proceedings of engineering stochastic local search algorithms (SLS \u201907) (pp. 61\u201375). Berlin: Springer."},{"key":"23_CR28","volume-title":"Convergence properties of evolutionary algorithms","author":"G. Rudolph","year":"1997","unstructured":"Rudolph, G. (1997). Convergence properties of evolutionary algorithms. Hamburg: Kova\u010d."},{"issue":"4","key":"23_CR29","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/B:JMMA.0000049379.14872.f5","volume":"3","author":"J. Scharnow","year":"2004","unstructured":"Scharnow, J., Tinnefeld, K., & Wegener, I. (2004). The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 3(4), 349\u2013366.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"23_CR30","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. (2000). MAX-MIN ant system. Future Generations Computer Systems, 16, 889\u2013914.","journal-title":"Future Generations Computer Systems"},{"key":"23_CR31","first-page":"349","volume-title":"Evolutionary optimization","author":"I. Wegener","year":"2002","unstructured":"Wegener, I. (2002). Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In R. Sarker, X. Yao, & M. Mohammadian (Eds.), Evolutionary optimization (pp. 349\u2013369). Dordrecht: Kluwer Academic."},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S0963548304006650","volume":"14","author":"I. Wegener","year":"2005","unstructured":"Wegener, I., & Witt, C. (2005). On the optimization of monotone polynomials by simple randomized search heuristics. Combinatorics, Probability and Computing, 14, 225\u2013247.","journal-title":"Combinatorics, Probability and Computing"},{"key":"23_CR33","series-title":"LNCS","first-page":"44","volume-title":"Proceedings of the 22nd symposium on theoretical aspects of computer science (STACS \u201905)","author":"C. Witt","year":"2005","unstructured":"Witt, C. (2005). Worst-case and average-case approximations by simple randomized search heuristics. In LNCS : Vol. 3404. Proceedings of the 22nd symposium on theoretical aspects of computer science (STACS \u201905) (pp. 44\u201356). Berlin: Springer."}],"container-title":["Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-008-0023-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11721-008-0023-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-008-0023-3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-008-0023-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T00:22:00Z","timestamp":1557966120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11721-008-0023-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,5]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s11721-008-0023-3","relation":{},"ISSN":["1935-3812","1935-3820"],"issn-type":[{"value":"1935-3812","type":"print"},{"value":"1935-3820","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,5]]}}}