New stopping criterion for genetic algorithms

European Journal of Operational Research

Volumn 126, Issue 3, 2000, Pages 662-674

  Aytug, Haldun ^a   Koehler, Gary J ^b  

^a UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

AYTUG-KOEHLER THEORY; FIRST PASSAGE TIMES;

GENETIC ALGORITHMS;

EID: 0034325483     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00321-5     Document Type: Article

References (12)

1. Aytug H., Koehler G.J. Stopping criteria for finite length genetic algorithms. ORSA Journal on Computing. 8(2):1996;183-191.
2. Aytug H., Bhattacharyya S., Koehler G.J. A Markov chain analysis of general cardinality genetic algorithms with power of cardinality alphabets. European Journal of Operational Research. 96(1):1996;195-201.
3. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
4. D. Greenhalgh, S. Marshall, Convergence criteria for genetic algorithms, SIAM Journal on Computing, forthcoming.
5. N.L. Johnson, A. Kotz, A.W. Kemp, Univariate Discrete Distributions, Wiley, New York, 1992.
6. Koehler G.J. New directions in genetic algorithm theory. Annals of Operations Research. 75:1997;49-68.
7. Koehler G.J., Bhattacharyya S., Vose M.D. General cardinality genetic algorithms. Evolutionary Computation. 5(4):1997;439-459.
8. H. Minc, Nonnegative Matrices, Wiley, New York, 1988.
9. Nix A., Vose M.D. Modeling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence. 5:1992;79-88.
10. M.D. Vose, Formalizing genetic algorithms, Proceedings of the IEEE Workshop on Genetic Algorithms, Neural Networks, and Simulated Annealing Applied to Signal and Image Processing, Glasgow, Scotland, May 1990.
11. Vose M.D. Logarithmic convergence of random heuristic search. Evolutionary Computation. 4(4):1996;395-404.
12. Wolpert D.H., MacReady W.G. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation. 1(1):1997;67-82.