A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
type: Item
instance of: scholarly article
title: A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
zbMATH Open document ID: 0924.90117
DOI: 10.1016/S0377-2217(96)00121-X
author: Haldun Aytug
author: Gary J. Koehler
author: Siddhartha Bhattacharyya
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 60G40
zbMATH DE Number: 1252996
zbMATH Keywords: genetic algorithm
zbMATH Keywords: stopping criteria
zbMATH Keywords: run time behavior
zbMATH Keywords: higher cardinality
zbMATH Keywords: Markov chain
zbMATH Keywords: transition probabilities
zbMATH Keywords: convergence rate
MaRDI profile type: Publication
cites work: Stopping Criteria for Finite Length Genetic Algorithms
cites work: Q3979601
cites work: Q4692508
cites work: Q4277609
cites work: Modeling genetic algorithms with Markov chains.
cites work: Q3980262
full work available at URL: s0377-2217(96)00121-x
OpenAlex ID: W1987074714
Recommended article: A Markov Chain Analysis of Genetic Algorithms: Large Deviation Principle Approach
Recommended article: Q4848812
Recommended article: Q4662933
Recommended article: Multistage Markov Chain Modeling of the Genetic Algorithm and Convergence Results
Recommended article: Modeling the Genetic Algorithm by a Nonhomogeneous Markov Chain: Weak and Strong Ergodicity
Recommended article: Q4319822
Recommended article: Modeling genetic algorithms with Markov chains.
Recommended article: A Markov chain that models genetic algorithms in noisy environments
Recommended article: Accelerated Genetic Algorithms with Markov Chains
description: scientific article; zbMATH DE number 1252996