Monte Carlo simulation and population-based optimization

Proceedings of the IEEE Conference on Evolutionary Computation, ICEC

Volumn 1, Issue , 2001, Pages 191-198

  Cercueil, A ^a   Francois O ^a  

^a Institut IMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EVOLUTIONARY ALGORITHMS; MARKOV PROCESSES; MONTE CARLO METHODS; PERTURBATION TECHNIQUES; SIMULATED ANNEALING;

POPULATION-BASED OPTIMIZATION;

PROBABILITY DISTRIBUTIONS;

EID: 0034878668     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. GAVaPS- A genetic algorithm with varying population size
2. The dynamics of mutation-selection algorithms with large population sizes
3. A new genetic algorithm
4. A simulated annealing like convergence theory for the simple genetic algorithm
5. Parameter control in evolutionary algorithms
6. An empirical study on GA's without parameters
7. Design of evolutionary algorithms: A statistical perspective
8. An evolutionary strategy for global minimization and its Markov chain analysis
9. Global optimization with exploration/selection algorithms and simulated annealing
10. Convergence rates of the Gibbs sampler, the Metropolis algorithm, and other single-site updating dynamics
11. Time dependent statistics of the Ising model
12. Optimization by simulated annealing
13. Equation of state calculation by fast computing machines
14. Parallel recombinative simulated annealing: A genetic algorithm
15. Statistical dynamics of the royal road genetic algorithm
16. Massively parallel simulated annealing and its relation to evolutionary algorithms
17. Adaptively resizing populations: An algorithm and analysis
18. Monte Carlo methods in statistical mechanics: Foundations and new algorithms
19. Random field models for fitness landscapes
20. A Markov chain analysis on a genetic algorithm
21. A further result on the Markov chain model of genetic algorithm and its application to a simulated annealing-like theory
22. Building better test functions