On improving approximate solutions by evolutionary algorithms

Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different optimization methods is rare. The aim of this paper is to 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]  Dirk Sudholt,et al.  Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency , 2006, ISAAC.

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

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

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

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

[6]  I. Wegener,et al.  Minimum spanning trees made easier via multi-objective optimization , 2005, GECCO '05.

[7]  Xin Yao,et al.  A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[8]  Carsten Witt Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2005, STACS.

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

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

[11]  Rajeev Kumar,et al.  Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..

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

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

[14]  F. Glover,et al.  Tabu Search , 1997 .

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

[16]  A. Schrijver Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[17]  Lawrence R. Rabiner,et al.  Combinatorial optimization:Algorithms and complexity , 1984 .

[18]  Frederick Hayes-Roth,et al.  Review of "Adaptation in Natural and Artificial Systems by John H. Holland", The U. of Michigan Press, 1975 , 1975, SGAR.

[19]  Ingo Wegener,et al.  The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths Problems , 2004 .

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

[21]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

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

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