A general steady state distribution based stopping criteria for finite length genetic algorithms

European Journal of Operational Research

Volumn 176, Issue 3, 2007, Pages 1436-1451

  Pendharkar, Parag C ^a   Koehler, Gary J ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

Error bounds; Genetic algorithms; Heuristic search; Markov processes; Worst case analysis

Indexed keywords

BOUNDARY VALUE PROBLEMS; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; HEURISTIC METHODS; MARKOV PROCESSES; OPERATIONS RESEARCH;

CROSSOVER RATE; ERROR BOUNDS; MUTATION RATE; TRANSITION MATRIX;

GENETIC ALGORITHMS;

EID: 33750220795     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.10.050     Document Type: Article

References (21)

1. Agapie A. Theoretical analysis of mutation-adaptive evolutionary algorithms. Evolutionary Computation 9 2 (2001) 127-146
2. Aldous, D., Fill, J. Reversible Markov chains and random walks on graphs, in preparation.
3. Aytug H., and Koehler G.J. Stopping criteria for finite length genetic algorithms. INFORMS Journal on Computing 8 2 (1996) 183-191
4. Aytug H., and Koehler G.J. New stopping criterion for genetic algorithms. European Journal of Operational Research 126 (2000) 662-674
5. Aytug H., Bhattacharyya S., and Koehler G.J. A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets. European Journal of Operational Research 96 (1996) 195-201
6. v. Complex Systems 8 (1994) 227-256
7. Gao Y. An upper bound on the convergence rates of canonical genetic algorithms. Complexity International 5 (1998) 1-9
8. Greenhalgh D., and Marshall S. Convergence criteria for genetic algorithms. SIAM Journal on Computing 30 1 (2000) 269-282
9. Holland J.H. Adaptation in Natural and Artificial Systems (1975), The University of Michigan Press, Ann Arbor, MI
10. Koehler G.J. New directions in genetic algorithm theory. Annals of Operations Research 75 (1997) 49-68
11. Koehler G.J., Bhattacharyya S., and Vose M.D. General cardinality genetic algorithms. Evolutionary Computation 5 4 (1997) 439-459
12. Landau H.J., and Odlyzko A.M. Bounds for eigenvalues of certain stochastic matrices. Linear Algebra Applications 38 (1981) 5-15
13. Leung Y., Gao Y., and Xu Z. Degree of population diversity-A perspective on premature convergence in genetic algorithms and its Markov chain analysis. IEEE Transactions on Neural Networks 8 5 (1997) 1165-1176
14. Nix A.E., and Vose M.D. Modeling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence 5 (1992) 79-88
15. Rosenthal J.S. Convergence rates for Markov chains. SIAM Review 37 3 (1995) 387-405
16. Rudolph G. Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks 5 1 (1994) 96-101
17. 2) bound for the relaxation time of a Markov chain on cladograms, Technical Report 572, pp. 1-12. Department of Statistics, University of California, Berkley, CA.
18. Suzuki J. A Markov chain analysis on simple genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics 25 4 (1995) 655-659
19. Tabachnick B.G., and Fidell L.S. Computer-assisted Research Design and Analysis (2001), Allyn and Bacon, Boston
20. Vose M.D. The Simple Genetic Algorithm: Foundations and Theory (1999), MIT Press, Cambridge, MA
21. Vose M.D., and Liepins G.E. Punctuated equilibria in genetic search. Complex Systems 5 (1991) 31-44