SLOW ANNEALING VERSUS MULTIPLE FAST ANNEALING RUNS - AN EMPIRICAL-INVESTIGATION

被引：11

作者：

DODD, N

机构：

[1] Royal Signals and Radar, Establishment, Malvern, United Kingdom

来源：

PARALLEL COMPUTING | 1990年 / 16卷 / 2-3期

关键词：

SIMULATED ANNEALING; OPTIMIZATION; PARALLEL COMPUTING;

D O I：

10.1016/0167-8191(90)90063-F

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The effects of splitting a single annealing run into several parallel shorter annealing runs is detailed for one specific application of combinatorial optimisation by simulated annealing. This form of parallelisation of the algorithm is extremely easy to implement since it requires no communication between the processors. It is shown that, for a considerable range of parallelisation, the probability of finding the global minimum is largely unchanged.

引用

页码：269 / 272

页数：4

共 5 条

[1]

AARTS EHL, 1985, PHILIPS J RES, V40, P193

[2] PARALLEL IMPLEMENTATIONS OF THE STATISTICAL COOLING ALGORITHM [J].