Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem

Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast, the theoretical understanding of the interplay of different optimization methods is rare. In this paper, we make a first step into the rigorous analysis of such combinations for combinatorial optimization problems. The subject of our analyses is the vertex cover problem for which several approximation algorithms have been proposed. We point out specific instances where solutions can (or cannot) be improved by the search process of a simple evolutionary algorithm in expected polynomial time.

[1]  Ingo Wegener,et al.  Maximum cardinality matchings on trees by randomized local search , 2006, GECCO '06.

[2]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[3]  Frank Neumann,et al.  Expected runtimes of evolutionary algorithms for the Eulerian cycle problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[4]  Ingo Wegener,et al.  Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.

[5]  Carsten Witt,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  George Karakostas,et al.  A better approximation ratio for the vertex cover problem , 2005, TALG.

[8]  Dirk Sudholt.  Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency , 2006, ISAAC.

[9]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[10]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[11]  Ingo Wegener,et al.  On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics , 2005, Combinatorics, Probability and Computing.

[12]  Frank Neumann,et al.  Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators , 2006, PPSN.

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  Ingo Wegener,et al.  The analysis of evolutionary algorithms on sorting and shortest paths problems , 2004, J. Math. Model. Algorithms.

[15]  The Centre of Excellence for Research in Computational Intelligence and Applications , .

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[18]  Xin Yao,et al.  A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem , 2005, IEEE Trans. Syst. Man Cybern. Part C.

[19]  Frank Neumann,et al.  Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem , 2004, Eur. J. Oper. Res..

[20]  Frank Neumann,et al.  Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem , 2004, GECCO.

[21]  Frank Neumann,et al.  A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems , 2006, EvoCOP.

[22]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[23]  Alex A. Freitas,et al.  Evolutionary Computation , 2002 .

[24]  Isaac K. Evans,et al.  Evolutionary Algorithms for Vertex Cover , 1998, Evolutionary Programming.

[25]  Carsten Witt,et al.  Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2007, Evolutionary Computation.

[26]  Jörn Hopf,et al.  Genetic algorithms within the framework of evolutionary computation: Proceedings of the KI-94 Workshop , 1994 .

[27]  Dirk Sudholt,et al.  On the analysis of the (1+1) memetic algorithm , 2006, GECCO.

[28]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .