A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
From MaRDI portal
Publication:1278478
DOI10.1016/S0377-2217(96)00121-XzbMath0924.90117MaRDI QIDQ1278478
Haldun Aytug, Gary J. Koehler, Siddhartha Bhattacharyya
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
stopping criteria; Markov chain; convergence rate; genetic algorithm; transition probabilities; higher cardinality; run time behavior
68T05: Learning and adaptive systems in artificial intelligence
90C27: Combinatorial optimization
60G40: Stopping times; optimal stopping problems; gambling theory
Related Items
New stopping criterion for genetic algorithms, Markov chain analysis of self-organizing mobile nodes self-organizing mobile nodes, 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
Cites Work