A parallel simulated annealing algorithm with low communication overhead

被引：21
作者：
Nabhan, TM
Zomaya, AY
机构：
[1] Parallel Computing Research Laboratory, Deparment of Electrical and Electronic Engineering, the University of Western Australia, Nedlands
来源：
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1995年 / 6卷 / 12期
基金：
澳大利亚研究理事会;
关键词：
parallel algorithms; simulated annealing; speculative computation; message passing systems; task scheduling; traveling salesman problem;
D O I：
10.1109/71.476165
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we propose a parallel simulated annealing algorithm based on the technique presented by Witte et al, [13] but with low communication overhead. The performance of our proposed algorithm is significantly better than the method presented in [13], particularly for optimization problems where the time required to communicate the solution is comparable to the evaluation time. The efficiency of the technique is demonstrated using two case studies with good results.
引用
收藏
页码：1226 / 1233
页数：8
相关论文
共 15 条
12