Evolutionary algorithms and dynamic programming

Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation, which enables them to construct solutions in a dynamic programming fashion. We take a general approach and relate the construction of such algorithms to the development of algorithms using dynamic programming techniques. Thereby, we give general guidelines on how to develop evolutionary algorithms that have the additional ability of carrying out dynamic programming steps.

[1]  Hans-Paul Schwefel,et al.  How to analyse evolutionary algorithms , 2002, Theor. Comput. Sci..

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

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

[4]  Marco Laumanns,et al.  Running time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem , 2002 .

[5]  Frank Neumann,et al.  Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators , 2007, Evolutionary Computation.

[6]  David J. Sherratt.  Mobile Genetic elements , 1995 .

[7]  Madeleine Theile,et al.  Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm , 2009, EvoCOP.

[8]  Anne Auger,et al.  Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.

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

[10]  Benjamin Doerr,et al.  Improved analysis methods for crossover-based algorithms , 2009, GECCO.

[11]  Gerhard J. Woeginger,et al.  When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? , 2000, INFORMS J. Comput..

[12]  Rolf Klötzler,et al.  Multiobjective dynamic programming , 1978 .

[13]  Giorgio Ausiello,et al.  Local Search, Reducibility and Approximability of NP-Optimization Problems , 1995, Inf. Process. Lett..

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

[15]  R. Bellman.  Dynamic programming. , 1957, Science.

[16]  Martin Skutella,et al.  Evolutionary Algorithms and Matroid Optimization Problems , 2007, GECCO '07.

[17]  Anton V. Eremeev,et al.  Evolutionary algorithms and dynamic programming , 2011, Theor. Comput. Sci..

[18]  Rezaul Alan Chowdhury,et al.  Cache-Oblivious Dynamic Programming for Bioinformatics , 2010, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  P. B. Coaker,et al.  Applied Dynamic Programming , 1964 .

[21]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[22]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[23]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[24]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

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

[26]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[27]  Benjamin Doerr,et al.  Crossover can provably be useful in evolutionary computation , 2008, GECCO '08.

[28]  Benjamin Doerr,et al.  Faster Evolutionary Algorithms by Superior Graph Representation , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

[29]  S. Kyes,et al.  Variable var transition rates underlie antigenic variation in malaria. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[30]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[31]  Frank Neumann,et al.  Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms , 2008, PPSN.

[32]  Frank Neumann,et al.  Computing Minimum Cuts by Randomized Search Heuristics , 2008, GECCO '08.

[33]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[34]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[35]  Benjamin Doerr,et al.  Adjacency list matchings: an ideal genotype for cycle covers , 2007, GECCO '07.

[36]  Christian Horoba,et al.  Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem , 2009, FOGA '09.

[37]  Frank Neumann,et al.  How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem , 2010, PPSN.

[38]  Bryant A. Julstrom,et al.  Edge sets: an effective evolutionary coding of spanning trees , 2003, IEEE Trans. Evol. Comput..

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

[40]  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 .

[41]  L. G. Mitten.  Composition Principles for Synthesis of Optimal Multistage Processes , 1964 .

[42]  Gerhard J. Woeginger,et al.  Approximation of the supply scheduling problem , 2005, Oper. Res. Lett..