Stopping Criteria for Finite Length Genetic Algorithms
From MaRDI portal
Publication:5284227
DOI10.1287/IJOC.8.2.183zbMATH Open0864.68091OpenAlexW2148095198MaRDI QIDQ5284227FDOQ5284227
Authors: Haldun Aytug, Gary J. Koehler 
Publication date: 22 January 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.8.2.183
Recommendations
Cited In (15)
- 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
- Variance as a stopping criterion for genetic algorithms with elitist model
- A new stopping criterion for multi-objective evolutionary algorithms: application in the calibration of a hydrologic model
- A general steady state distribution based stopping criteria for finite length genetic algorithms
- The effect of multiple optima on the simple GA run-time complexity
- A new genetic algorithm for solving nonconvex nonlinear programming problems
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
- A reliable approach for terminating the GA optimization method
- Advances in Artificial Intelligence – SBIA 2004
- New stopping criterion for genetic algorithms
- Theory of genetic algorithms
- Modified genetic algorithm-based clustering for probability density functions
- A non-dominance-based online stopping criterion for multi-objective evolutionary algorithms
- Genetic algorithm for constrained global optimization in continuous variables
This page was built for publication: Stopping Criteria for Finite Length Genetic Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284227)
