A general steady state distribution based stopping criteria for finite length genetic algorithms

DOI10.1016/J.EJOR.2005.10.050zbMath1102.90076OpenAlexW2000167496MaRDI QIDQ853021

Gary J. Koehler, Parag C. Pendharkar

Publication date: 15 November 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.050

zbMATH Keywords

Markov processeserror boundsgenetic algorithmsworst-case analysisheuristic search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A class of multi-objective supply chain networks optimal model under random fuzzy environment and its application to the industry of Chinese liquor ⋮ A non-dominance-based online stopping criterion for multi-objective evolutionary algorithms ⋮ Maximum entropy and least square error minimizing procedures for estimating missing conditional probabilities in Bayesian networks

Cites Work

• Bounds for eigenvalues of certain stochastic matrices
• A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
• Modeling genetic algorithms with Markov chains.
• New directions in genetic algorithm theory
• Convergence Criteria for Genetic Algorithms
• Convergence Rates for Markov Chains
• Stopping Criteria for Finite Length Genetic Algorithms
• New stopping criterion for genetic algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A general steady state distribution based stopping criteria for finite length genetic algorithms