{"title":"Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","doi":"10.1145/3321707.3321792","publication_identifier":{"isbn":["978-1-4503-6111-8"]},"abstract":[{"lang":"eng","text":"We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. This includes the (1+1) EA and RLS in a setting where the number of colors is bounded and we are minimizing the number of conflicts as well as iterated local search algorithms that use an unbounded color palette and aim to use the smallest colors and - as a consequence - the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i. e. starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. Furthermore, we show how to speed up computations by using problem specific operators concentrating on parts of the graph where changes have occurred."}],"place":"New York, NY, USA","_id":"48843","date_updated":"2023-12-13T10:42:37Z","publication_status":"published","page":"1443–1451","language":[{"iso":"eng"}],"type":"conference","user_id":"102979","status":"public","keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"citation":{"apa":"Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2019). Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451. https://doi.org/10.1145/3321707.3321792","mla":"Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2019, pp. 1443–1451, doi:10.1145/3321707.3321792.","chicago":"Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321792.","bibtex":"@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA}, series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring}, DOI={10.1145/3321707.3321792}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2019}, pages={1443–1451}, collection={GECCO ’19} }","ama":"Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’19. Association for Computing Machinery; 2019:1443–1451. doi:10.1145/3321707.3321792","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 1443–1451.","ieee":"J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2019, pp. 1443–1451, doi: 10.1145/3321707.3321792."},"extern":"1","date_created":"2023-11-14T15:58:52Z","publisher":"Association for Computing Machinery","series_title":"GECCO ’19","author":[{"full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","id":"102979"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"},{"first_name":"Dirk","full_name":"Sudholt, Dirk","last_name":"Sudholt"}],"department":[{"_id":"819"}],"year":"2019"}