Global optimization with exploration/selection algorithms and simulated annealing

DOI10.1214/aoap/1015961163zbMath1012.60066OpenAlexW2026126709MaRDI QIDQ1872426

Olivier Francois

Publication date: 6 May 2003

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1015961163

zbMATH Keywords

evolutionary algorithmsgeneralized simulated annealing

Mathematics Subject Classification ID

Problems related to evolution (92D15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Quantitative magnetic resonance image analysis via the EM algorithm with stochastic variation, A Markov Chain Analysis of Genetic Algorithms: Large Deviation Principle Approach, Mean Convergence Time of Inhomogeneous Genetic Algorithm with Elitism, A new genetic algorithm specifically based on mutation and selection, The quasispecies regime for the simple genetic algorithm with ranking selection

Cites Work

• Modeling genetic algorithms with Markov chains.
• Asymptotical behaviour of several interacting annealing processes
• The dynamics of mutation-selection algorithms with large population sizes
• A new genetic algorithm
• Cooling Schedules for Optimal Annealing
• Techniques for bounding the convergence rate of genetic algorithms
• On the Convergence and Applications of Generalized Simulated Annealing
• Cycle Decompositions and Simulated Annealing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item