Runtime analysis of randomized search heuristics for dynamic graph coloring

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.

[1]  Carsten Witt,et al.  Runtime analysis of ant colony optimization on dynamic shortest path problems , 2013, GECCO '13.

[2]  Frank Neumann,et al.  Pareto Optimization for Subset Selection with Dynamic Cost Constraints , 2018, AAAI.

[3]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[4]  Frank Neumann,et al.  On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem , 2018, PPSN.

[5]  Monika Henzinger,et al.  Dynamic Algorithms for Graph Coloring , 2017, SODA.

[6]  Dirk Sudholt,et al.  Analysis of an Iterated Local Search Algorithm for Vertex Coloring , 2010, ISAAC.

[7]  Rolf Niedermeier,et al.  Incremental list coloring of graphs, parameterized by conservation , 2010, Theor. Comput. Sci..

[8]  Qi Liu,et al.  On the First-Fit Chromatic Number of Graphs , 2008, SIAM J. Discret. Math..

[9]  Frank Neumann,et al.  Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints , 2017, GECCO.

[10]  Leonid Barenboim,et al.  Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing , 2017, ICCS.

[11]  Tommy R. Jensen,et al.  Graph Coloring Problems: Jensen/Graph , 1994 .

[12]  Duc-Cuong Dang,et al.  Populations Can Be Essential in Tracking Dynamic Optima , 2016, Algorithmica.

[13]  Mojgan Pourhassan,et al.  Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments , 2018, Theory of Evolutionary Computation.

[14]  Benjamin Doerr,et al.  Multiplicative Drift Analysis , 2010, GECCO '10.

[15]  Dirk Sudholt,et al.  Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.

[16]  Manouchehr Zaker.  Inequalities for the Grundy chromatic number of graphs , 2007, Discret. Appl. Math..

[17]  Pradip K. Srimani,et al.  Linear time self-stabilizing colorings , 2003, Inf. Process. Lett..

[18]  D. de Werra,et al.  Graph Coloring Problems , 2013 .

[19]  Mojgan Pourhassan,et al.  Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms , 2015, GECCO.

[20]  Zbigniew Michalewicz,et al.  Variants of Evolutionary Algorithms for Real-World Applications , 2011, Variants of Evolutionary Algorithms for Real-World Applications.

[21]  Ingo Wegener,et al.  The one-dimensional Ising model: Mutation versus recombination , 2005, Theor. Comput. Sci..

[22]  Jean Cardinal,et al.  Dynamic Graph Coloring , 2017, Algorithmica.

[23]  Viktor Zamaraev,et al.  Sliding Window Temporal Graph Coloring , 2018, AAAI.

[24]  Shay Solomon,et al.  Improved Dynamic Graph Coloring , 2018, ESA.

[25]  Mojgan Pourhassan,et al.  Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem , 2017, 2017 IEEE Symposium Series on Computational Intelligence (SSCI).

[26]  Per Kristian Lehre,et al.  Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change , 2009, GECCO.

[27]  Yolande Berbers,et al.  ACODYGRA: an agent algorithm for coloring dynamic graphs , 2004 .

[28]  Frank Neumann,et al.  On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling , 2015, IJCAI.

[29]  Stefan Droste,et al.  Analysis of the (1+1) EA for a dynamically changing ONEMAX-variant , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[30]  Timo Kötzing,et al.  ACO Beats EA on a Dynamic Pseudo-Boolean Function , 2012, PPSN.

[31]  Kalyanmoy Deb,et al.  Optimization for Engineering Design - Algorithms and Examples, Second Edition , 2012 .

[32]  M. Kac.  Random Walk and the Theory of Brownian Motion , 1947 .

[33]  Lijun Chang,et al.  Effective and Efficient Dynamic Graph Coloring , 2017, Proc. VLDB Endow..

[34]  Shengxiang Yang,et al.  Dynamic Optimization Using Analytic and Evolutionary Approaches: A Comparative Review , 2013, Handbook of Optimization.

[35]  Frank Neumann,et al.  Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem , 2018, GECCO.