{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:24:48Z","timestamp":1760646288924},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,10]],"date-time":"2015-02-10T00:00:00Z","timestamp":1423526400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s00453-015-9975-z","type":"journal-article","created":{"date-parts":[[2015,2,9]],"date-time":"2015-02-09T20:06:49Z","timestamp":1423512409000},"page":"554-576","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions"],"prefix":"10.1007","volume":"75","author":[{"given":"Andrei","family":"Lissovoi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,10]]},"reference":[{"key":"9975_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-30665-5","volume-title":"Metaheuristics for Dynamic Optimization. Studies in Computational Intelligence","author":"E Alba","year":"2013","unstructured":"Alba, E., Nakib, A., Siarry, P.: Metaheuristics for Dynamic Optimization. Studies in Computational Intelligence. Springer, Berlin (2013)"},{"key":"9975_CR2","volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","year":"2011","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing, Singapore (2011)"},{"key":"9975_CR3","doi-asserted-by":"crossref","unstructured":"Doerr, B., Pohl, S.: Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201912), pp. 1317\u20131324. ACM Press, New York (2012)","DOI":"10.1145\/2330163.2330346"},{"key":"9975_CR4","doi-asserted-by":"crossref","unstructured":"Droste, S.: Analysis of the (1+1) EA for a dynamically bitwise changing OneMax. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201903), pp. 909\u2013921. Springer, Berlin (2003)","DOI":"10.1007\/3-540-45105-6_103"},{"key":"9975_CR5","doi-asserted-by":"crossref","unstructured":"Gunia, C.: On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201905), pp. 571\u2013578. ACM Press, New York (2005)","DOI":"10.1145\/1068009.1068106"},{"key":"9975_CR6","doi-asserted-by":"crossref","first-page":"502","DOI":"10.2307\/1426671","volume":"14","author":"B Hajek","year":"1982","unstructured":"Hajek, B.: Hitting and occupation time bounds implied by drift analysis with applications. Adv. Appl. Probab. 14, 502\u2013525 (1982)","journal-title":"Adv. Appl. Probab."},{"key":"9975_CR7","doi-asserted-by":"crossref","unstructured":"Jansen, T., Schellbach, U.: Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201905), pp. 841\u2013848. ACM Press, New York (2005)","DOI":"10.1145\/1068009.1068152"},{"key":"9975_CR8","doi-asserted-by":"crossref","unstructured":"Jansen, T., Zarges, C.: Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201914), pp. 975\u2013982. ACM Press, New York (2014)","DOI":"10.1145\/2576768.2598344"},{"key":"9975_CR9","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Molter, H.: ACO beats EA on a dynamic pseudo-boolean function. In: Parallel Problem Solving from Nature-PPSN XII, pp. 113\u2013122. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32937-1_12"},{"key":"9975_CR10","unstructured":"Lehre, P.K., Witt, C.: General drift analysis with tail bounds (2013). arXiv:1307.2559"},{"key":"9975_CR11","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Witt, C.: MMAS versus population-based EA on a family of dynamic fitness functions. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201914), pp. 1399\u20131406. ACM Press, New York (2014)","DOI":"10.1145\/2576768.2598301"},{"key":"9975_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and their Computational Complexity. Natural Computing Series","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization: Algorithms and their Computational Complexity. Natural Computing Series. Springer, Berlin (2010)"},{"key":"9975_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"TT Nguyen","year":"2012","unstructured":"Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evolut. Comput. 6, 1\u201324 (2012)","journal-title":"Swarm Evolut. Comput."},{"key":"9975_CR14","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., Zarges, C.: Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201913), pp. 837\u2013844. ACM Press, New York (2013)","DOI":"10.1145\/2463372.2463478"},{"key":"9975_CR15","doi-asserted-by":"crossref","unstructured":"Rohlfshagen, P., Lehre, P.K., Yao, X.: Dynamic evolutionary optimisation: An analysis of frequency and magnitude of change. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201909), pp. 1713\u20131720. ACM Press, New York (2009)","DOI":"10.1145\/1569901.1570131"},{"issue":"4","key":"9975_CR16","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1162\/evco.2008.16.4.557","volume":"16","author":"T Storch","year":"2008","unstructured":"Storch, T.: On the choice of the parent population size. Evolut. Comput. 16(4), 557\u2013578 (2008)","journal-title":"Evolut. Comput."},{"issue":"8","key":"9975_CR17","doi-asserted-by":"crossref","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\u2013min ant system. Futur. Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"9975_CR18","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Using markov-chain mixing time estimates for the analysis of ant colony optimization. In: Proceedings of the 11th Workshop on Foundations of Genetic Algorithms (FOGA \u201911), pp. 139\u2013150. ACM Press, New York (2011)","DOI":"10.1145\/1967654.1967667"},{"key":"9975_CR19","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.jda.2011.06.002","volume":"10","author":"D Sudholt","year":"2012","unstructured":"Sudholt, D., Thyssen, C.: Running time analysis of ant colony optimization for shortest path problems. J. Discrete Algorithms 10, 165\u2013180 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"9975_CR20","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ipl.2013.09.013","volume":"114","author":"C Witt","year":"2014","unstructured":"Witt, C.: Fitness levels with tail bounds for the analysis of randomized search heuristics. Inf. Process. Lett. 114(1), 38\u201341 (2014)","journal-title":"Inf. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9975-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-9975-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9975-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T19:58:42Z","timestamp":1566331122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-9975-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,10]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9975"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-9975-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,10]]}}}