Genetic algorithms: Bridging the convergence gap

Theoretical Computer Science

Volumn 229, Issue 1-2, 1999, Pages 11-22

  Lozano, J A ^a   Larranaga P ^a   Grana M ^a   Albizuri, F X ^a  

^a Departamento de Ciencias   (Spain)

Author keywords

Convergence; Genetic algorithms; Inhomogeneous Markov chain; Reduction operator; Simulated annealing

Indexed keywords

EID: 0013281794     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00090-0     Document Type: Article

References (18)

1. S. Anily, A. Federgruen, Ergodicity in parametric nonstationary Markov chains: an application to simulated annealing methods, Oper. Res. 35 (6) (1987) 867-874.
2. G.L. Bilbro, L.C. Hall, A probably convergent inhomogeneous genetic annealing algorithm, SPIE 1766 (1992) 50-60.
3. T.E. Davis, J.C. Príncipe, A Markov chain framework for the simple genetic algorithm, Evol. Comput. 1(3) (1993) 269-288.
4. K.A. De Jong, An analysis of the behaviour of a class of genetic adaptative systems, Ph.D. thesis, University of Michigan, Ann Arbor, MI. 1975.
5. A.E. Eiben, E.H.L. Aarts, K.M. Van Hee, Global convergence of genetic algorithms: a Markov chain analysis, in: Parallel Problem Solving from Nature, Lectures Notes in Computer Science, vol. 496, Springer, Berlin, 1991, pp. 4-12.
6. W. Feller, An Introduction to Probability Theory and its Applications, 3rd ed., Wiley, New York, 1971.
7. D.E. Goldberg, A note on Boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing, Complex Systems 4 (1990) 445-460.
8. D.L. Isaacson, R.W. Madsen, Markov Chains Theory and Applications, Wiley, New York, 1976.
9. F. Lin, C. Kao, C. Hsu, Applying the genetic approach to simulated annealing in solving some NP-hard problems, IEEE Trans. Systems, Man, Cybernet. 23 (6) (1993) 1752-1767.
10. S.W. Mahfoud, Finite Markov chain models of an alternative selection strategy for the genetic algorithm, Complex Systems 7 (1993) 155-170.
11. S.W. Mahfoud, D.E. Goldberg, Parallel recombinative simulated annealing: a genetic algorithm, Parallel Computing 21 (1995) 1-28.
12. A.E. Nix, M.D. Vose, Modeling genetic algorithms with Markov chains, Ann. Math. Artif. Intell. 5 (1992) 79-88.
13. G. Rudolph, Convergence analysis of canonical genetic algorithms, IEEE Trans. Neural Networks 5 (1) (1994) 96-101.
14. G. Rudolph, Convergence Properties of Evolutionary Algorithms, Kovač, Hamburg, 1997.
15. J. Suzuki, A Markov chain analysis on simple genetic algorithms, IEEE Trans. Systems Man, Cybernet. 25 (4) (1995) 655-659.
16. J. Suzuki, 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. - Part B 28 (1) (1998) 95-102.
17. P.J.M. Van Laarhoven, E.H.L. Aarts, Simulated Annealing: Theory and Applications, Reidel, Dordrecht, Holland, 1987.
18. M.D. Vose, Modeling simple genetic algorithms, Computer Science Dept., 107 Ayres Hall, The University of Tennesse, Knoxville, TN 37996-1301, 1993.