Genetic Algorithms - A Survey of Models and Methods

[1]  Larry J. Eshelman,et al.  Preventing Premature Convergence in Genetic Algorithms by Preventing Incest , 1991, ICGA.

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

[3]  L. Darrell Whitley,et al.  A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms , 1998, AAAI/IAAI.

[4]  R. Salomon.  Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. , 1996, Bio Systems.

[5]  L. Darrell Whitley,et al.  Test driving three 1995 genetic algorithms: New test functions and geometric matching , 1995, J. Heuristics.

[6]  Shigenobu Kobayashi,et al.  Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.

[7]  Keith E. Mathias,et al.  Hyperplane Ranking in Simple Genetic Algorithms , 1995, ICGA.

[8]  Kenneth A. De Jong,et al.  An Analysis of Multi-Point Crossover , 1990, FOGA.

[9]  L. D. Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, ICGA.

[10]  David E. Goldberg,et al.  An Analysis of Reproduction and Crossover in a Binary-Coded Genetic Algorithm , 1987, ICGA.

[11]  L. D. Whitley.  A free lunch proof for Gray versus Binary encodings , 1999 .

[12]  Hans-Paul Schwefel,et al.  Numerical optimization of computer models , 1981 .

[13]  L. Darrell Whitley,et al.  A Comparison of Genetic Sequencing Operators , 1991, ICGA.

[14]  L. Darrell Whitley,et al.  Optimization Using Distributed Genetic Algorithms , 1990, PPSN.

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

[16]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[17]  L. Darrell Whitley,et al.  An Executable Model of a Simple Genetic Algorithm , 1992, FOGA.

[18]  Michael D. Vose,et al.  Modeling genetic algorithms with Markov chains , 1992, Annals of Mathematics and Artificial Intelligence.

[19]  Gunar E. Liepins,et al.  Punctuated Equilibria in Genetic Search , 1991, Complex Syst..

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

[21]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

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

[23]  Darrell Whitley,et al.  Genitor: a different genetic algorithm , 1988 .

[24]  L. Darrell Whitley,et al.  Polynomial Time Summary Statistics for a Generalization of MAXSAT , 1999, GECCO.

[25]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

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

[27]  H. H. Rosenbrock,et al.  An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..

[28]  J. D. Schaffer,et al.  Real-Coded Genetic Algorithms and Interval-Schemata , 1992, FOGA.

[29]  Nikolaus Hansen,et al.  Adaptive Encoding: How to Render Search Coordinate System Invariant , 2008, PPSN.

[30]  L. Darrell Whitley,et al.  Tracking primary hyperplane competitors during genetic search , 1992, Annals of Mathematics and Artificial Intelligence.

[31]  Edward M. Reingold,et al.  Efficient generation of the binary reflected gray code and its applications , 1976, CACM.

[32]  Alden H. Wright,et al.  Simple Genetic Algorithms with Linear Fitness , 1994, Evolutionary Computation.

[33]  L. Darrell Whitley,et al.  Nonlinearity, Hyperplane Ranking and the Simple Genetic Algorithm , 1996, Foundations of Genetic Algorithms.

[34]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[35]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[36]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[37]  Jean-Paul Watson,et al.  The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling , 1999 .

[38]  Nikolaus Hansen,et al.  The CMA Evolution Strategy: A Comparing Review , 2006, Towards a New Evolutionary Computation.

[39]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[40]  Riccardo Poli,et al.  Tournament Selection, Iterated Coupon-Collection Problem, and Backward-Chaining Evolutionary Algorithms , 2005, FOGA.

[41]  Michael D. Vose,et al.  Modeling Simple Genetic Algorithms , 1992, FOGA.

[42]  Y. Ho.  Heuristics, rules of thumb, and the 80/20 proposition , 1994, IEEE Trans. Autom. Control..

[43]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

[44]  Reiko Tanese,et al.  Distributed Genetic Algorithms , 1989, ICGA.

[45]  Gilbert Syswerda,et al.  The Application of Genetic Algorithms to Resource Scheduling , 1991, International Conference on Genetic Algorithms.

[46]  L. Darrell Whitley,et al.  Evaluating Evolutionary Algorithms , 1996, Artif. Intell..

[47]  David E. Goldberg,et al.  A Note on Boltzmann Tournament Selection for Genetic Algorithms and Population-Oriented Simulated Annealing , 1990, Complex Syst..

[48]  L. Darrell Whitley,et al.  Unbiased tournament selection , 2005, GECCO '05.

[49]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[50]  Kenneth A. De Jong,et al.  Genetic Algorithms are NOT Function Optimizers , 1992, FOGA.

[51]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[52]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[53]  Patrick D. Surry,et al.  Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective , 1995, Computer Science Today.

[54]  L. Darrell Whitley,et al.  Fundamental Principles of Deception in Genetic Search , 1990, FOGA.

[55]  L. Darrell Whitley,et al.  Changing Representations During Search: A Comparative Study of Delta Coding , 1994, Evolutionary Computation.

[56]  L. Darrell Whitley,et al.  Focused no free lunch theorems , 2008, GECCO '08.

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

[58]  John J. Grefenstette,et al.  Deception Considered Harmful , 1992, FOGA.

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