Simulated annealing and single-trial versions of evolution strategies possess a close relationship when they are designed for optimization over continuous variables. Analytical investigations of their differences and similarities lead to a cross-fertilization of both approaches, resulting in new theoretical results, new parallel population-based algorithms, and a better understanding of the interrelationships.

global optimization, parallel simulated annealing, parallel evolutionary algorithms, neighborhood algorithms
This content is only available as a PDF.
© 1993 by the Massachusetts Institute of Technology
1993
You do not currently have access to this content.