Fine-grained parallel genetic algorithm:a global convergence criterion

DOI10.1080/00207169908804885MaRDI QIDQ4944670zbMATH OpenOpenAlexFDO

Authors

Publication date 5 December 2000

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169908804885

zbMATH Keywords

genetic algorithmglobal convergenceMarkov chain modelparallel computationsimulated annealingstochastic process

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Stochastic programming (90C15)

Recommendations

• On the convergence rates of genetic algorithms
• Experience with fine-grained parallel genetic algorithms
• scientific article; zbMATH DE number 2076155
• scientific article; zbMATH DE number 759412
• scientific article; zbMATH DE number 5159419

Cites work

• Convergence of an annealing algorithm
• Genetic algorithms for fuzzy control.1. Offline system development and application
• scientific article; zbMATH DE number 3145626 (Why is no real title available?)

Cited in

(2)

• Experience with fine-grained parallel genetic algorithms
• Adjustment of parameters and parallel reality of a genetic algorithm based on avoiding premature convergence

This page was built for publication: Fine-grained parallel genetic algorithm:a global convergence criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944670)