Efficiency Enhancement of Estimation of Distribution Algorithms

Summary. Efficiency-enhancement techniques speedup the search process of estimation of distribution algorithms (EDAs) and thereby enable EDAs to solve hard problems in practical time. This chapter provides a decomposition and an overview of different efficiency-enhancement techniques for estimation of distribution algorithms. Principled approaches for designing an evaluation-relaxation, and a timecontinuation technique are discussed in detail.

[1]  David E. Goldberg,et al.  Scalability of the Bayesian optimization algorithm , 2002, Int. J. Approx. Reason..

[2]  Cláudio F. Lima,et al.  Parameter-Less Optimization with the Extended Compact Genetic Algorithm and Iterated Local Search , 2004, GECCO.

[3]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[4]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[5]  Natalio Krasnogor,et al.  Studies on the theory and design space of memetic algorithms , 2002 .

[6]  M. Gorges-Schleuter.  Asparagos96 and the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[7]  David E. Goldberg,et al.  Let's Get Ready to Rumble: Crossover Versus Mutation Head to Head , 2004, GECCO.

[8]  Xavier Llorà,et al.  Combating user fatigue in iGAs: partial ordering, support vector machines, and synthetic fitness , 2005, GECCO '05.

[9]  John J. Grefenstette,et al.  Genetic Search with Approximate Function Evaluation , 1985, ICGA.

[10]  Kalyanmoy Deb,et al.  Sufficient conditions for deceptive and easy binary functions , 1994, Annals of Mathematics and Artificial Intelligence.

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

[12]  J. Dennis,et al.  MANAGING APPROXIMATION MODELS IN OPTIMIZATION , 2007 .

[13]  David E. Goldberg,et al.  Efficient Discretization Scheduling In Multiple Dimensions , 2002, GECCO.

[14]  John J. Grefenstette,et al.  Case-Based Initialization of Genetic Algorithms , 1993, ICGA.

[15]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: Self-Adaptation , 1995, Evolutionary Computation.

[16]  Robert E. Smith,et al.  Fitness inheritance in genetic algorithms , 1995, SAC '95.

[17]  David E. Goldberg,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

[18]  David E. Goldberg,et al.  Bayesian optimization algorithm, decision graphs, and Occam's razor , 2001 .

[19]  A. D. Bethke,et al.  Comparison of genetic algorithms and gradient-based optimizers on parallel processors : efficiency of use of processing capacity , 1976 .

[20]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[21]  David E. Goldberg,et al.  Hierarchical BOA Solves Ising Spin Glasses and MAXSAT , 2003, GECCO.

[22]  John J. Grefenstette,et al.  A Parallel Genetic Algorithm , 1987, ICGA.

[23]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[24]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[25]  Erik D. Goodman,et al.  Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems , 1997, Evolutionary Programming.

[26]  David E. Goldberg,et al.  Combining competent crossover and mutation operators: a probabilistic model building approach , 2005, GECCO '05.

[27]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[28]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[29]  Lawrence Davis,et al.  Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints , 1993, ICGA.

[30]  Natalia Alexandrov,et al.  Multidisciplinary design optimization : state of the art , 1997 .

[31]  David E. Goldberg,et al.  Designing Competent Mutation Operators Via Probabilistic Model Building of Neighborhoods , 2004, GECCO.

[32]  Bernard Manderick,et al.  Fine-Grained Parallel Genetic Algorithms , 1989, ICGA.

[33]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

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

[35]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[36]  David E. Goldberg,et al.  Efficient Genetic Algorithms Using Discretization Scheduling , 2005, Evolutionary Computation.

[37]  Heiko Rieger,et al.  Optimization algorithms in physics , 2001 .

[38]  Martin Pelikan,et al.  Fitness Inheritance in the Bayesian Optimization Algorithm , 2004, GECCO.

[39]  George G. Robertson,et al.  Parallel Implementation of Genetic Algorithms in a Classifier Rystem , 1987, ICGA.

[40]  Martin Pelikan,et al.  Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms , 2010, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).

[41]  Masaharu Munetomo,et al.  Empirical studies on parallel network construction of Bayesian optimization algorithms , 2005, 2005 IEEE Congress on Evolutionary Computation.

[42]  John H. Holland,et al.  Distributed genetic algorithms for function optimization , 1989 .

[43]  David E. Goldberg,et al.  Fluctuating Crosstalk as a Source of Deterministic Noise and Its Effects on GA Scalability , 2006, EvoWorkshops.

[44]  David E. Goldberg.  Using Time Efficiently: Genetic-Evolutionary Algorithms and the Continuation Problem , 1999, GECCO.

[45]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[46]  Sheldon H. Jacobson,et al.  Data-independent neighborhood functions and strict local optima , 2005, Discret. Appl. Math..

[47]  R. Belew,et al.  Evolutionary algorithms with local search for combinatorial optimization , 1998 .

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

[49]  B. P. Zeigler,et al.  Comparison of genetic algorithms with conjugate gradient methods , 1972 .

[50]  Hisashi Handa.  The effectiveness of mutation operation in the case of Estimation of Distribution Algorithms , 2007, Biosyst..

[51]  Martin Pelikan,et al.  Design of Multithreaded Estimation of Distribution Algorithms , 2003, GECCO.

[52]  L. D. Whitley,et al.  Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem , 2003 .

[53]  J. Wesley Barnes,et al.  The theory of elementary landscapes , 2003, Appl. Math. Lett..

[54]  J. Barnes,et al.  Using Group Theory to Construct and Characterize Metaheuristic Search Neighborhoods , 2005 .

[55]  David E. Goldberg,et al.  Genetic Algorithms, Tournament Selection, and the Effects of Noise , 1995, Complex Syst..

[56]  Brad L. Miller,et al.  Noise, sampling, and efficient genetic algorthms , 1997 .

[57]  A. J. Booker,et al.  A rigorous framework for optimization of expensive functions by surrogates , 1998 .

[58]  Hisashi Handa,et al.  Hybridization of Estimation of Distribution Algorithms with a Repair Method for Solving Constraint Satisfaction Problems , 2003, GECCO.

[59]  Yaochu Jin,et al.  A comprehensive survey of fitness approximation in evolutionary computation , 2005, Soft Comput..

[60]  Franz Rothlauf,et al.  Evaluation-Relaxation Schemes for Genetic and Evolutionary Algorithms , 2004 .

[61]  David E. Goldberg,et al.  Efficiency enhancement of genetic algorithms via building-block-wise fitness estimation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

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

[63]  J. -F. M. Barthelemy,et al.  Approximation concepts for optimum structural design — a review , 1993 .

[64]  W. Hart.  Adaptive global optimization with local search , 1994 .

[65]  David E. Goldberg,et al.  Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.

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

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

[68]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[69]  David E. Goldberg,et al.  Efficient evaluation relaxation under integrated fitness functions , 2001 .

[70]  Paul Bryant Grosso,et al.  Computer Simulations of Genetic Adaptation: Parallel Subcomponent Interaction in a Multilocus Model , 1985 .

[71]  David E. Goldberg,et al.  Optimizing Global-Local Search Hybrids , 1999, GECCO.

[72]  D. Goldberg,et al.  Don't evaluate, inherit , 2001 .

[73]  Sheldon Howard Jacobson,et al.  Discrete Manufacturing Process Design Optimization Using Generalized Hill Climbing Algorithms , 2000 .