Theory of Genetic Algorithms II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling

Theoretical Computer Science

Volumn 310, Issue 1-3, 2004, Pages 181-231

  Schmitt, Lothar M ^a  

^a UNIVERSITY OF AIZU   (Japan)

Author keywords

Asymptotic convergence of genetic algorithms; Coevolution; Neighborhood based search; Non commuting crossover and mutation operators; Simulated annealing; Unbounded power law scaled proportional fitness selection

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; EVOLUTIONARY ALGORITHMS; GLOBAL OPTIMIZATION; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MUTAGENESIS; PROBABILITY; SIMULATED ANNEALING; TENSORS;

MUTATIONS;

GENETIC ALGORITHMS;

EID: 0242440265     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00393-1     Document Type: Article

References (73)

1. Aarts E.H.L., van Laarhoven P.J.M. Simulated annealing. an introduction Statist. Neerlandica. 43:1989;31-52.
2. Agapie A. Theoretical analysis of mutation-adaptive evolutionary algorithms. Evol. Comput. 9:2001;127-146.
3. Anily S., Federgruen A. Ergodicity in parametric non-stationary markov chains. an application to simulated annealing methods Oper. Res. 35:1987;867-874.
4. Aytug H., Koehler G.J. Stopping criteria for finite length genetic algorithms. INFORMS J. Comput. 8:1996;183-191.
5. Baker J.E. Reducing bias and inefficiency in the selection algorithm. Grefenstette J.J. Genetic Algorithms and Their Applications: Proc. Second Internat. Conf. on Genetic Algorithms. 1987;Lawrence Erlbaum Publishers, Mahwah, NJ, USA.
6. W. Banzhaf, F.D. Francone, P. Nordin, The effect of extensive use of the mutation operator on generalization in genetic programming using sparse data sets, in: H.-M. Voigt, et al. (Eds.), Proc. Internat. Conf. on Evolutionary Computation and Fourth Conf. Parallel Problem Solving from Nature (PPSN IV), Berlin, Germany, September 1996, Springer, Berlin, Germany, 1996, pp. 300-309.
7. ν Complex Systems. 8:1994;227-256.
8. Bremermann H.J., Rogson J., Salaff S. Global Properties of Evolution Processes. Pattee H.H., et al. Natural Automata and Useful Simulations. 1966;3-42 Spartan Books, Washington, DC, USA.
9. Bridges C.L., Goldberg D.E. An analysis of reproduction and crossover in a binary-coded genetic algorithm. Grefenstette J.J. Genetic Algorithms and Their Applications: Proc. of the Second Internat. Conf. on Genetic Algorithms. 1987;9-13 Lawrence Erlbaum, Mahwah, NJ, USA.
10. O. Catoni, Large deviations for annealing, Ph.D. Dissertation, Université Paris XI, 1990.
11. Catoni O. Sharp large deviations estimates for simulated annealing algorithms. Ann. Inst. H. Poincaré. Probab. Statist. 27:1991;291-383.
12. Catoni O. Applications of sharp large deviations estimates to optimal cooling schedules. Ann. Inst. H. Poincaré. Probab. Statist. 27:1991;493-518.
13. Catoni O. Rough large deviations estimates for simulated annealing - application to exponential schedules. Ann. Probab. 20:1992;1109-1146.
14. R. Cerf, An asymptotic theory for genetic algorithms. in: J.M. Alliot, et al. (Eds.), Artificial Evolution European Conf. AE '95, Brest, France, September 4-6, 1995, Selected Papers, Lecture Notes in Computer Science, Vol. 1063, Springer, Berlin, Germany, 1996, pp. 37-53.
15. Cerf R. Asymptotic convergence of genetic algorithms. Adv. Appl. Probab. 30:1998;521-550.
16. T.E. Davis, Toward an extrapolation of the simulated annealing convergence theory onto the simple genetic algorithm, Ph.D. Dissertation, University of Florida, 1991.
17. Davis T.E., Principe J.C. A simulated annealing-like convergence theory for the simple genetic algorithm. Belew R.K., Booker L.B. Proc. Fourth Internat. Conf. on Genetic Algorithms '91. 1991;174-181 Morgan Kaufmann Publishers, San Francisco, CA, USA.
18. Davis T.E., Principe J.C. A Markov chain framework for the simple genetic algorithm. Evol. Comput. 1:1993;269-288.
19. K. De Jong, Lecture on coevolution, in: H.-G. Beyer, et al. (Chairs), Theory of Evolutionary Computation 2002, Max Planck Institute for Computer Science Conference Center, Schloß Dagstuhl, Saarland, Germany, 2002.
20. Fogel D.B. Asymptotic convergence properties of genetic algorithms and evolutionary programming. analysis and experiments Cybernet. Systems. 25:1994;389-407.
21. Geiringer H. On the probability theory of linkage in mendelian heredity. Ann. of Math. Statist. 15:1944;25-57.
22. Goldberg D.E. Simple genetic algorithms and the minimal deceptive problem. Davis L. Genetic Algorithms and Simulated Annealing. 1987;74-88 Hyperion Books, New York, NY, USA, Morgan Kaufmann, San Francisco, CA, USA.
23. Goldberg D.E. Genetic Algorithms, in Search, Optimization & Machine Learning. 1989;Addison-Wesley, Boston, MA, USA.
24. Goldberg D.E. A note on Boltzmann tournament selection for genetic algorithms and population oriented simulated annealing. Complex Systems. 4:1990;445-460.
25. Goldberg D.E., Deb K. A comparative analysis of selection schemes used in genetic algorithms. Rawlins G.J.E. Foundations of Genetic Algorithms. 1991;69-93 Morgan Kaufmann, San Francisco, CA, USA.
26. Greenwood G.W., Zhu Q.J. Convergence in evolutionary programs with self-adaptation. Evol. Comput. 9:2001;147-157.
27. Griffiths R.C., Taveré S. Computational methods for the coalescent. Donnelly P., Taveré S. Progress in Population Genetics and Human Evolution. IMA Volumes in Mathematics and its Applications. Vol. 87:1997;165-182 Springer, Berlin, Germany.
28. He J., Kang L. On the convergence rates of genetic algorithms. Theoret. Comput. Sci. 229:1999;23-39.
29. Holland J.H. Adaptation in natural and artificial systems. 1975;University of Michigan Press, Ann Arbor, MI, USA. (extended new edition, MIT Press, Cambridge, MA, USA, 1992).
30. Isaacson D.L., Madsen R.W. Markov chains: theory and applications. 1961;Prentice-Hall, Upper Saddle River, NJ, USA.
31. Koehler G.J. A proof of the Vose-Liepins conjecture. Ann. Math. Artif. Intell. 10:1994;408-422.
32. Koehler G.J., Bhattacharyya S., Vose M.D. General cardinality genetic algorithms. Evol. Comput. 5:1998;439-459.
33. Lang S. Linear Algebra. 2nd Ed. 1970;Addison-Wesley, Boston, MA, USA.
34. Lang S. Complex Analysis. 1977;Addison-Wesley, Boston, MA, USA.
35. Y. Leung, Z.-P. Chen, Z.-B. Xu, K.-S. Leung, Convergence rate for non-binary genetic algorithms with different crossover operators. The Chinese University of Hong Kong, preprint, 1998.
36. Lozano J.A., Larrañaga P., Graña M., Albizuri F.X. Genetic algorithms. bridging the convergence gap Theoret. Comput. Sci. 229:1999;23-39.
37. Mahfoud S.W. Finite Markov chain models of an alternative selection strategy for genetic algorithms. Complex Systems. 7:1993;155-170.
38. S.W. Mahfoud, D.E. Goldberg, A genetic algorithm for parallel simulated annealing, in: R. Männer, B. Manderick (Eds.), Parallel Problem Solving from Nature, Vol. 2, Elsevier, Amsterdam, The Netherlands, 1992, pp. 301-310.
39. Mahfoud S.W., Goldberg D.E. Parallel recombinative simulated annealing. a genetic algorithm Parallel Comput. 21:1995;1-28.
40. A. Márkus, G. Renner, J. Vanza, Spline interpolation with genetic algorithms, in: T.L. Kunii, et al. (Chairs), Proc. Internat. Conf. Shape Modeling, The University of Aizu, Aizu-Wakamatsu, Japan, March 3-6, 1997, IEEE Computer Society Press, Washington, DC, USA, 1997, pp. 47-54.
41. Michalewicz Z. Genetic Algorithms. + Data Structures = Evolution Programs 2nd, extended ed. 1994;Springer, Berlin, Germany.
42. Mitchell M. An Introduction to Genetic Algorithms. 1996;MIT Press, Cambridge, MA, USA.
43. Mühlenbein H. Genetic algorithms. Aarts E., Lenstra L. Local Search in Combinatorial Optimization. 1997;131-171 Wiley Publishers, Hoboken, NJ, USA.
44. Nix A.E., Vose M.D. Modeling genetic algorithms with Markov chains. Ann. Math. Artif. Intel. 5:1992;79-88.
45. Nomura T., Shimohara K. An analysis of two-parent recombinations for real-valued chromosomes in an infinite population. Evol. Comput. 9:2001;283-308.
46. Poli R. Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover. Genetic Programming Evol. Mach. 2:2001;123-163.
47. Poli A., Langdon M. Schema theory for genetic programming with one-point crossover and point mutation. Evol. Comput. 6(3):1998;231-252.
48. Rechenberg I. Evolutionsstrategie. Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 1973;Frommann-Holzboog Verlag, Stuttgart, Germany.
49. Rudin W. Functional Analysis. 1973;McGraw-Hill, New York, NY, USA.
50. Rudolph G. Convergence analysis of canonical genetic algorithms. IEEE Trans. Neural Networks. 5:1994;96-101.
51. Rudolph G. An evolutionary algorithm for integer programming. Davidor Y., et al. Proc. Third Internat. Conf. Parallel Problem Solving From Nature (PPSN III). 1994;139-148 Springer, Berlin, Germany.
52. Rudolph G. Finite Markov chain results in evolutionary computation. a tour d'Horizon Fund. Inform. 35:1998;67-89.
53. Schaefer H.H. Banach lattices and positive operators. Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen. Vol. 215:1974;Springer, Berlin, Germany.
54. L.M. Schmitt, Mathematica Computation, ftp://ftp.u-aizu.ac.jp/u-aizu/doc/Tech-Report/1999/99-2-004.tar.gz .
55. L.M. Schmitt, Theory of genetic algorithms, Tech. Report 2000-2-002, The University of Aizu, Aizu-Wakamatsu, Japan, 2000, pp. 1-61.
56. Schmitt L.M. Theory of genetic algorithms. Theoret. Comput. Sci. 259:2001;1-61.
57. L.M. Schmitt, Asymptotic convergence of scaled genetic algorithms to global optima - a gentle introduction to the theory -, in: A. Menon (Ed.), Computing Horizons: the Hilbert Challenge Essays on the Frontiers of Evolutionary Computation, in preparation; D.E. Goldberg (Ed.), Kluwer Series in Evolutionary Computation, Kluwer, Dordrecht, The Netherlands, 2003, pp. 178-221.
58. L.M. Schmitt, Coevolutionary convergence to global optima, Technical Report 2003-2-002, The University of Aizu, Aizu-Wakamatsu, Japan, 2003, pp. 1-12, in: Erick Cantu-Paz, et al. (Eds.), Proc. Genetic and Evolutionary Computation Conf. GECCO 2003 (coevolution track: poster), The Holiday Inn, Chicago, IL, USA, July 12-16, 2003, Lecture Notes in Computer Science, Vol. 2723, Springer, Berlin, Germany, 2003, pp. 375-376.
59. L.M. Schmitt, Optimization with genetic algorithms in multi-species environments, in: L. Jiao, et al. (Eds.), Proc. Fifth Internat. Conf. Computation Intelligence and Multimedia Applications (ICCIMA 2003), Xidian University, Xi'an, China, September 27-30, 2003, Sponsored by IEEE, The Printing House (publisher), Quincy, FL, USA, pp. 194-199, ISBN 0-7695-1957-1.
60. L.M. Schmitt, Theory of coevolutionary genetic algorithms, in: M. Guo, L.T. Yang (Eds.), Proc. of 'The 2003 Internat. Symp. Parallel and Distributed Processing and Applications' ISPA 2003, The University of Aizu, Aizu-Wakamatsu, Japan, July 2-4, 2003, Sponsored by ACM and IPSJ, Lecture Notes in Computer Science, Vol. 2745, Springer, Berlin, Germany, 2003, pp. 285-293.
61. Schmitt L.M., Nehaniv C.L. The linear geometry of genetic operators with applications to the analysis of genetic drift and genetic algorithms using tournament selection. Nehaniv C.L. Mathematical and Computational Biology: Computational Morphogenesis, Hierarchical Complexity and Digital Evolution, An International Workshop, The University of Aizu, Aizu-Wakamatsu, Japan, October 21-25, 1997. Lectures on Mathematics in the Life Sciences Series. Vol. 26:1999;147-166 American Mathematical Society, Providence, RI, USA.
62. Schmitt L.M., Nehaniv C.L., Fujii R.H. Linear analysis of genetic algorithms. Theoret. Comput. Sci. 200:1998;101-134.
63. E. Seneta, Non-Negative Matrices and Markov Chains, Springer Series in Statistics, Springer, Berlin, Germany, 1981.
64. Stephens C.R., Waelbroeck H. Effective degrees of freedom in genetic algorithms and the block hypothesis. Back T. Proc. Seventh Internat. Conf. Genetic Algorithms. 1997;34-40 Lawrence Erlbaum, Mahwah, NJ, USA.
65. J. Suzuki, A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy, in: R.K. Belew, M.D. Vose (Eds.), Foundations of Genetic Algorithms, Vol. 4, Morgan Kaufmann, San Francisco, CA, USA, 1997, pp. 53-72.
66. Suzuki J. A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy. IEEE Trans. Systems Man Cybernet. B. 28:1998;95-102.
67. Vose M.D. Random heuristic search. Theoret. Comput. Sci. 229:1999;103-142.
68. Vose M.D. The Simple Genetic Algorithm: Foundations and Theory. 1999;MIT Press, Cambridge, MA, USA.
69. Vose M.D., Liepins G.E. Punctuated equilibria in genetic search. Complex Systems. 5:1991;31-44.
70. Vose M.D., Wright A.H. The simple genetic algorithm and the Walsh transform. part I, theory Evol. Comput. 6:1998;253-273.
71. Vose M.D., Wright A.H. The simple genetic algorithm and the Walsh transform. part II, the inverse Evol. Comput. 6:1998;275-289.
72. Vose M.D., Wright A.H. Form invariance and implicit parallelism. Evol. Comput. 9:2001;355-370.
73. D. Whitley, An executable model of a simple genetic algorithm, in: L.D. Whitley (Ed.), Foundations of Genetic Algorithms, Vol. 2, Morgan Kaufmann, San Francisco, CA, USA, 1993, pp. 45-62.