A parallel simulated annealing algorithm with low communication overhead

In this paper, we propose a parallel simulated annealing algorithm based on the technique presented by Witte et al. (1991) but with low communication overhead. The performance of our proposed algorithm is significantly better than the method presented by Witte et al., particularly for optimization p...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 6; no. 12; pp. 1226 - 1233
Main Authors:	Nabhan, T.M., Zomaya, A.Y.
Format:	Journal Article
Language:	English
Published:	Los Alamitos, CA IEEE 01-12-1995 IEEE Computer Society
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Australia Computational modeling Computer science; control theory; systems Computer systems and distributed systems. User interface Convergence Cost function Exact sciences and technology Message passing Optimization methods Processor scheduling Scheduling algorithm Simulated annealing Software Theoretical computing Traveling salesman problems Parallel algorithm Algorithm performance Simulated annealing Travelling salesman problem Scheduling Optimization Message transmission Communication
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In this paper, we propose a parallel simulated annealing algorithm based on the technique presented by Witte et al. (1991) but with low communication overhead. The performance of our proposed algorithm is significantly better than the method presented by Witte et al., 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.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	1045-9219 1558-2183
DOI:	10.1109/71.476165