Convergence Criteria for Genetic Algorithms
From MaRDI portal
Publication:4507348
DOI10.1137/S009753979732565XzbMath0959.68103MaRDI QIDQ4507348
David Greenhalgh, Stephen Marshall
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Signal detection and filtering (aspects of stochastic processes) (60G35)
Related Items (15)
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 ⋮ Imperialist competitive algorithm with dynamic parameter adaptation using fuzzy logic applied to the optimization of mathematical functions ⋮ Study of multiscale global optimization based on parameter space partition ⋮ SWAP test for an arbitrary number of quantum states ⋮ Modified genetic algorithm-based clustering for probability density functions ⋮ EFFECT OF TRAFFIC DEMAND VARIATION ON ROAD NETWORK RESILIENCE ⋮ A new genetic algorithm for solving nonconvex nonlinear programming problems ⋮ Weight optimization for case-based reasoning using membrane computing ⋮ A numerical algorithm for constructing an individual mathematical model of HIV dynamics at cellular level ⋮ New stopping criterion for genetic algorithms ⋮ Designing data warehouses for equipment management system with genetic algorithms ⋮ Model-based clustering with sparse covariance matrices ⋮ The quasispecies regime for the simple genetic algorithm with ranking selection ⋮ Genetic algorithm for constrained global optimization in continuous variables
This page was built for publication: Convergence Criteria for Genetic Algorithms
