Stopping Criteria for Finite Length Genetic Algorithms

DOI10.1287/IJOC.8.2.183MaRDI QIDQ5284227zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

genetic algorithmssearch algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Advances in Artificial Intelligence – SBIA 2004
• New stopping criterion for genetic algorithms
• A general steady state distribution based stopping criteria for finite length genetic algorithms
• Convergence Criteria for Genetic Algorithms

Cited in

(16)

• A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
• Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
• 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
• A new stopping criterion for multi-objective evolutionary algorithms: application in the calibration of a hydrologic model
• A non-dominance-based online stopping criterion for multi-objective evolutionary algorithms
• scientific article; zbMATH DE number 1337870 (Why is no real title available?)
• Variance as a stopping criterion for genetic algorithms with elitist model
• Modified genetic algorithm-based clustering for probability density functions
• 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
• Genetic algorithm for constrained global optimization in continuous variables
• 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

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)