Theory of genetic algorithms

Theoretical Computer Science

Volumn 259, Issue 1-2, 2001, Pages 1-61

  Schmitt, Lothar M ^a  

^a UNIVERSITY OF AIZU   (Japan)

Author keywords

Convergence in the zero mutation limit case; Convergent simulated annealing type genetic algorithm; Genetic drift; Non binary genetic algorithms; Scaled proportional fitness selection; Spectral analysis of mutation crossover

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; THEOREM PROVING;

MUTATION OPERATOR;

GENETIC ALGORITHMS;

EID: 0034914489     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00406-0     Document Type: Article

References (75)

1. Simulated annealing: An introduction
2. Simulated annealing methods with general acceptance probabilities
3. A new interpretation of Schema notation that overturns the binary encoding constraint
4. The evolution of cooperation
5. Stopping criteria for finite length genetic algorithms
6. Reducing bias and inefficiency in the selection algorithm
7. The effect of extensive use of the mutation operator on generalization in genetic programming using sparse data sets
8. ν
9. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
10. A simulated annealing-like convergence theory for the simple genetic algorithm
11. A Markow chain framework for the simple genetic algorithm
12. Asymptotic convergence properties of genetic algorithms and evolutionary programming: Analysis and experiments
13. On the probability theory of linkage in Mendelian heredity
14. Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images
15. Nonstationary Markov chains and convergence of the annealing algorithm
16. A note on Boltzmann tournament selection for genetic algorithms and population oriented simulated annealing
17. Genetic algorithms
18. Genetic algorithms tutorial
19. A comparative analysis of selection schemes used in genetic algorithms
20. Messy genetic algorithms revisited: Studies in mixed size and scale
21. Finite Markov chain analysis of genetic algorithms
22. Cooling schedules for optimal annealing
23. Mendelian proportions in a mixed population
24. Finite Markov chain analysis of genetic algorithms with niching
25. A proof of the Vose-Liepins conjecture
26. General cardinality genetic algorithms
27. Finite Markov chain models of an alternative selection strategy for genetic algorithms
28. A genetic algorithm for parallel simulated annealing
29. Equations of state calculations by fast computing machines
30. Convergence and finite time behavior of simulated annealing
31. Modeling genetic algorithms with Markov chains
32. Mathematical and computational biology: Computational morphogenesis, hierarchical complexity, and digital evolution
33. C*-algebras and their automorphism groups
34. Why do asexual and self-fertilizing populations tend to occur in marginal environments?
35. Schema theory for genetic programming with one-point crossover and point mutation
36. Convergence analysis of canonical genetic algorithms
37. An evolutionary algorithm for integer programming
38. Banach lattices and positive operators
39. The linear geometry of genetic operators with applications to the analysis of genetic drift and genetic algorithms using tournament selection
40. Linear analysis of genetic algorithms
41. The social life of automata
42. A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy
43. A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy
44. Achte Auflage der Modernen Algebra
45. Formalizing genetic algorithms
46. Modeling simple genetic algorithms
47. Punctuated equilibria in genetic search
48. The simple genetic algorithm and the Walsh transform: Part I, theory
49. The simple genetic algorithm and the Walsh transform: Part II, the inverse
50. Über Vererbungsgesetze beim Menschen
51. Statistical genetics and evolution