Massively Parallel Simulated Annealing and Its Relation to Evolutionary Algorithms

作     者：Rudolph, Guenter 

作者机构：Univ Dortmund Fachbereich Informat Lehrstuhl Syst Anal D-44221 Dortmund Germany 

出 版 物：《EVOLUTIONARY COMPUTATION》 (调优计算)

年 卷 期：1993年第1卷第4期

页      面：361-383页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Research Initiative Parallel Computing of the Ministry of Science and Research of North Rhine-Westphalia  Germany [107 004 91] 

主　　题：global optimization parallel simulated annealing parallel evolutionary algorithms neighborhood algorithms 

摘      要：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 intcrrelationships.