Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem

In this paper, we perform theoretical analyses on the behaviour of an evolutionary algorithm and a randomised search algorithm for the dynamic vertex cover problem based on its dual formulation. The dynamic vertex cover problem has already been theoretically investigated to some extent and it has been shown that using its dual formulation to represent possible solutions can lead to a better approximation behaviour. We improve some of the existing results, i.e. we find a linear expected re-optimization time for a (1+1) EA to re-discover a 2-approximation when edges are dynamically deleted from the graph. Furthermore, we investigate a different setting for applying the dynamism to the problem, in which a dynamic change happens at each step with a probability $P_D$. We also expand these analyses to the weighted vertex cover problem, in which weights are assigned to vertices and the goal is to find a cover set with minimum total weight. Similar to the classical case, the dynamic changes that we consider on the weighted vertex cover problem are adding and removing edges to and from the graph. We aim at finding a maximal solution for the dual problem, which gives a 2-approximate solution for the vertex cover problem. This is equivalent to the maximal matching problem for the classical vertex cover problem.

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

[2]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[3]  Martin Dietzfelbinger,et al.  Tight Bounds for Blind Search on the Integers and the Reals , 2010, Comb. Probab. Comput..

[4]  Frank Neumann,et al.  Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2010, Evolutionary Computation.

[5]  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).

[6]  Jason M. Daida,et al.  (1+1) genetic algorithm fitness dynamics in a changing environment , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[8]  Pietro Simone Oliveto,et al.  Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems , 2009, IEEE Transactions on Evolutionary Computation.

[9]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[10]  Carsten Witt,et al.  (1+1) EA on Generalized Dynamic OneMax , 2015, FOGA.

[11]  Frank Neumann,et al.  Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem , 2012, Algorithmica.

[12]  Shengxiang Yang,et al.  Evolutionary dynamic optimization: A survey of the state of the art , 2012, Swarm Evol. Comput..

[13]  Benjamin Doerr,et al.  The Right Mutation Strength for Multi-Valued Decision Variables , 2016, GECCO.

[14]  Mojgan Pourhassan,et al.  On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms , 2017, FOGA '17.

[15]  Mojgan Pourhassan,et al.  Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem , 2019, Evolutionary Computation.

[16]  Pietro Simone Oliveto,et al.  Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change , 2015, Theor. Comput. Sci..

[17]  Mojgan Pourhassan,et al.  Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem , 2016, PPSN.

[18]  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).

[19]  Xin Yao,et al.  Continuous Dynamic Constrained Optimization—The Challenges , 2012, IEEE Transactions on Evolutionary Computation.

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

[21]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

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

[23]  Thomas Jansen,et al.  Approximating vertex cover using edge-based representations , 2013, FOGA XII '13.