New stopping criterion for genetic algorithms
Authors:
- Haldun AytugHAHaldun Aytug
- Gary J. KoehlerGKGary J. Koehler
- 1 November 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 126 (3) , 662-674
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Convergence Criteria for Genetic AlgorithmsSIAM Journal on Computing, 2000
- General Cardinality Genetic AlgorithmsEvolutionary Computation, 1997
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- A Markov Chain analysis of genetic algorithms with power of 2 cardinality alphabetsEuropean Journal of Operational Research, 1997
- New directions in genetic algorithm theoryAnnals of Operations Research, 1997
- Logarithmic Convergence of Random Heuristic SearchEvolutionary Computation, 1996
- Stopping Criteria for Finite Length Genetic AlgorithmsINFORMS Journal on Computing, 1996
- Modeling genetic algorithms with Markov chainsAnnals of Mathematics and Artificial Intelligence, 1992