Stopping Criteria for Finite Length Genetic Algorithms
From MaRDI portal
Publication:5284227
DOI10.1287/ijoc.8.2.183zbMath0864.68091MaRDI QIDQ5284227
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
Related Items
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, 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