Title :
A parallel simulated annealing algorithm with low communication overhead
Author :
Nabhan, Tarek M. ; Zomaya, Albert Y.
Author_Institution :
Dept. of Electr. & Electron. Eng., Western Australia Univ., Nedlands, WA, Australia
fDate :
12/1/1995 12:00:00 AM
Abstract :
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
Keywords :
computational complexity; message passing; parallel algorithms; simulated annealing; travelling salesman problems; evaluation time; low communication overhead; message passing systems; optimization problems; parallel algorithms; parallel simulated annealing algorithm; speculative computation; task scheduling; Australia; Computational modeling; Convergence; Cost function; Message passing; Optimization methods; Processor scheduling; Scheduling algorithm; Simulated annealing; Traveling salesman problems;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
