Theory of Evolutionary Algorithms and Genetic Programming

Randomized search heuristics are an alternative to specialized and problem-specific algorithms. They are applied to NP-hard problems with the hope of being efficient in typical cases. They are an alternative if no problem-specific algorithm is available. And they are the only choice in black-box optimization where the function to be optimized is not known. Evolutionary algorithms (EA) are a special class of randomized algorithms with many successful applications. However, the theory of evolutionary algorithms is in its infancy. Here many new contributions to constructing such a theory are presented and discussed.

[1]  Günter Rudolph,et al.  How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time , 1996, Evolutionary Computation.

[2]  Thomas Jansen,et al.  The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.

[3]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on Classifications of Fitness Functions on Classifications of Fitness Functions , 2022 .

[4]  Ingo Wegener,et al.  Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .

[5]  Günter Rudolph,et al.  Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets , 1998, Evolutionary Programming.

[6]  James Kennedy,et al.  Proceedings of the 1998 IEEE International Conference on Evolutionary Computation [Book Review] , 1999, IEEE Transactions on Evolutionary Computation.

[7]  Günter Rudolph,et al.  A partial order approach to noisy fitness functions , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[8]  Ju Airgen Guddat,et al.  Multiobjective and stochastic optimization based on parametric optimization , 1987 .

[9]  Ingo Wegener,et al.  Approximations by OBDDs and the Variable Ordering Problem , 1999, ICALP.

[10]  M. Yanagiya,et al.  Efficient genetic programming based on binary decision diagrams , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[11]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Günter Rudolph,et al.  Self-adaptation and global convergence: a counter-example , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[13]  I. Wegener,et al.  On the Behavior of the (1+1) Evolutionary Algorithm on Quadratic Pseudo-Boolean Functions , 2001 .

[14]  H Valkonen,et al.  Birds-eye view. , 1997, Nursing times.

[15]  Marc Schoenauer,et al.  Rigorous Hitting Times for Binary Mutations , 1999, Evolutionary Computation.

[16]  W. Vent,et al.  Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann‐Holzboog‐Verlag. Stuttgart 1973. Broschiert , 1975 .

[17]  Kumar Chellapilla,et al.  Evolving computer programs without subtree crossover , 1997, IEEE Trans. Evol. Comput..

[18]  Dirk Wiesmann,et al.  Metric Based Evolutionary Algorithms , 2000, EuroGP.

[19]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[20]  Melanie Mitchell,et al.  Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.

[21]  I. Wegener.  Branching Programs and Binary Deci-sion Diagrams-Theory and Applications , 1987 .

[22]  Günter Rudolph,et al.  Dynamic Neighborhood Structures in Parallel Evolution Strategies , 2001, Complex Syst..

[23]  Donna Crystal Llewellyn,et al.  Local optimization on graphs , 1989, Discret. Appl. Math..

[24]  Jim Smith,et al.  Replacement Strategies in Steady State Genetic Algorithms: Static Environments , 1998, FOGA.

[25]  Stefan Droste.  Efficient Genetic Programming for Finding Good Generalizing Boolean Functions , 1998 .

[26]  Kalyanmoy Deb,et al.  Long Path Problems , 1994, PPSN.

[27]  I. Wegener.  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 On the Design and Analysis of Evolutionary Algorithms , 2004 .

[28]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Choice of the Mutation Probability for the ( 1 + 1 ) EA , 2006 .

[29]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

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

[31]  Thomas Jansen,et al.  Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions , 2002, Theor. Comput. Sci..

[32]  Ingo Wegener,et al.  A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.

[33]  J. L. Selfridge,et al.  A counter-example , 1982, The Mathematical Gazette.

[34]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[35]  XI FachbereichInformatik.  Finite Markov Chain Results in Evolutionary Computation: a Tour D'horizon , 1998 .

[36]  G. Rudolph.  On a multi-objective evolutionary algorithm and its convergence to the Pareto set , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[37]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[38]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[39]  Thomas Hanne,et al.  On the convergence of multiobjective evolutionary algorithms , 1999, Eur. J. Oper. Res..

[40]  Thomas Bäck,et al.  Optimal Mutation Rates in Genetic Search , 1993, ICGA.

[41]  Günter Rudolph,et al.  Convergence properties of some multi-objective evolutionary algorithms , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[42]  Günter Rudolph,et al.  The Fundamental Matrix of the General Random Walk with Absorbing Boundaries , 2001 .

[43]  Dominic Heutelbeck,et al.  Distributed Hybrid Genetic Programming for Learning Boolean Functions , 2000, PPSN.

[44]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Perhaps Not a Free Lunch but at Least a Free Appetizer Perhaps Not a Free Lunch but at Least a Free Appetizer , 2022 .

[45]  Marco Laumanns,et al.  A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study , 1998, PPSN.

[46]  Ingo Wegener,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 On the Expected Runtime and the Success Probability of Evolutionary Algorithms , 2001 .

[47]  Günter Rudolph,et al.  Takeover Times and Probabilities of Non-Generational Selection Rules , 2000, GECCO.

[48]  J. Pollack,et al.  Hierarchically consistent test problems for genetic algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[49]  Kalyanmoy Deb,et al.  Analysis of Selection Algorithms: A Markov Chain Approach , 1996, Evolutionary Computation.

[50]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .

[51]  A. Sinclair,et al.  A computational view of population genetics , 1998 .

[52]  G. Rudolph.  On Takeover Times in Spatially Structured Populations : Array and Ring , 2001 .

[53]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.

[54]  Günter Rudolph,et al.  Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon , 1998, Fundam. Informaticae.

[55]  H. Schwefel,et al.  Approximating the Pareto Set: Concepts, Diversity Issues, and Performance Assessment , 1999 .

[56]  Thomas Jansen,et al.  On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm , 1998, PPSN.

[57]  Günter Rudolph,et al.  Takeover Times of Noisy Non-Generational Selection Rules that Undo Extinction , 2001 .

[58]  I. Wegener,et al.  Dynamic Parameter Control in Simple Evolutionary Algorithms , 2001 .

[59]  Ingo Wegener,et al.  On the utility of populations in evolutionary algorithms , 2001 .

[60]  I. Wegener,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods A Natural and Simple Function Which is Hard For All Evolutionary Algorithms , 2007 .

[61]  Stephanie Forrest,et al.  Proceedings of the 5th International Conference on Genetic Algorithms , 1993 .

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

[63]  Eldon Hansen,et al.  Global optimization using interval analysis , 1992, Pure and applied mathematics.

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

[65]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[66]  L. Kallel,et al.  Theoretical Aspects of Evolutionary Computing , 2001, Natural Computing Series.

[67]  Thomas Jansen,et al.  On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help , 1999 .

[68]  H. P. Schwefel,et al.  Numerische Optimierung von Computermodellen mittels der Evo-lutionsstrategie , 1977 .

[69]  I. Wegener,et al.  A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[70]  Thomas Bäck,et al.  An Overview of Parameter Control Methods by Self-Adaption in Evolutionary Algorithms , 1998, Fundam. Informaticae.

[71]  John R. Koza,et al.  Genetic programming 2 - automatic discovery of reusable programs , 1994, Complex Adaptive Systems.

[72]  Peter C. Fishburn,et al.  Interval orders and interval graphs : a study of partially ordered sets , 1985 .

[73]  Detlef Sieling.  The Nonapproximability of OBDD Minimization , 2002, Inf. Comput..

[74]  Adam Prügel-Bennett,et al.  The Mixing Rate of Different Crossover Operators , 2000, FOGA.

[75]  John H. Holland,et al.  When will a Genetic Algorithm Outperform Hill Climbing , 1993, NIPS.

[76]  Günter Rudolph,et al.  Some Theoretical Properties of Evolutionary Algorithms under Partially Ordered Fitness Values , 2001 .

[77]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[78]  Dirk Wiesmann,et al.  On Representation and Genetic Operators in Evolutionary Algorithms , 1998 .

[79]  Günter Rudolph,et al.  Theory of Evolutionary Algorithms: A Bird's Eye View , 1999, Theor. Comput. Sci..

[80]  Thomas Jansen,et al.  A New Framework for the Valuation of Algorithms for Black-Box Optimization , 2002, FOGA.