CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION
From MaRDI portal
Publication:4820065
DOI10.1080/10637199508915474zbMath1049.68901OpenAlexW2027499415MaRDI QIDQ4820065
Yongjun Chen, Jun He, Lishan Kang
Publication date: 6 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199508915474
Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)
Related Items (2)
A self-adaptive migration model genetic algorithm for data mining applications ⋮ Massively parallel algorithms from physics and biology
Cites Work
- Unnamed Item
- Nonstationary Markov chains and convergence of the annealing algorithm
- Evolution algorithms in combinatorial optimization
- The parallel genetic algorithm as function optimizer
- Convergence of an annealing algorithm
- Simulated annealing methods with general acceptance probabilities
- Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
- Genetic Algorithms and the Optimal Allocation of Trials
This page was built for publication: CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION
