Parallel recombinative simulated annealing: A genetic algorithm

Parallel Computing

Volumn 21, Issue 1, 1995, Pages 1-28

  Mahfoud, Samir W ^a   Goldberg, David E ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

CM 5, Implementation features; Genetic algorithm; Parallel recombinative simulated annealing (PRSA); Performance results; Shared memory multiprocessor; Simulated annealing

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; GENETIC ALGORITHMS; ITERATIVE METHODS; OPTIMIZATION; PERFORMANCE; SIMULATED ANNEALING;

BINARY RECOMBINATION OPERATOR; BOLTZMANN DISTRIBUTIONS; DECEPTIVE PROBLEMS; EMPIRICAL DISTRIBUTIONS; IMPLICIT PARALLELISM; PARALLEL RECOMBINATIVE SIMULATED ANNEALING; UNARY NEIGHBORHOOD OPERATOR;

PARALLEL ALGORITHMS;

EID: 0029184315     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(94)00071-H     Document Type: Article

References (43)

1. A parallel statistical cooling algorithm
2. Boltzmann machines as a model for parallel annealing
3. A learning algorithm for Boltzmann machines
4. Parallel genetic algorithms
5. Optimization of NP-complete problems by Boltzmann-Darwin strategies including life cycles
6. Boltzmann-, Darwin- and Haeckel-strategies in optimization problems
7. Boltzmann and Darwin strategies in complex optimization
8. A parallel genetic heuristic for the quadratic assignment problem
9. A simulated annealing like convergence theory for the simple genetic algorithm
10. An analysis of the behavior of a class of genetic adaptive systems
11. Parallel simulated annealing: accuracy vs. speed in placement
12. Global convergence of genetic algorithms: a Markov chain analysis
13. The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination
14. A note on Boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing
15. Simple genetic algorithms and the minimal deceptive problem
16. Genetic algorithms, noise, and the sizing of populations
17. Massive multimodality, deception, and genetic algorithms
18. Messy genetic algorithms: motivation, analysis, and first results
19. Finite Markov chain analysis of genetic algorithms
20. Parallel simulated annealing techniques
21. Optimization of control parameters for genetic algorithms
22. Cooling schedules for optimal annealing
23. Genetic algorithms and very fast simulated re-annealing: a comparison
24. Optimization by simulated annealing
25. Incorporating genetic algorithms into simulated annealing
26. Crowding and preselection revisited
27. Boltzmann weighted selection improves performance of genetic algorithms
28. Equation of state calculations by fast computing machines
29. A theoretical framework for simulated annealing
30. A problem independent parallel implementation of simulated annealing: models and experiments
31. Toward a unified thermodynamic genetic operator
32. Efficient simulated annealing on fractal energy landscapes
33. On the virtues of parameterized uniform crossover
34. Markov chains with rare transitions and simulated annealing
35. GENITOR: a different genetic algorithm