Fine-grained parallel genetic algorithm:a global convergence criterion

DOI10.1080/00207169908804885zbMath0949.65064OpenAlexW2095663226MaRDI QIDQ4944670

No author found.

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

global convergencesimulated annealingparallel computationstochastic processgenetic algorithmMarkov chain model

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Convergence of an annealing algorithm
• Genetic algorithms for fuzzy control.1. Offline system development and application

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