Title :
A general purpose distributed implementation of simulated annealing
Author :
Diekmann, R. ; Lüling, R. ; Simon, J.
Author_Institution :
Dept. of Math. & Comput. Sci., Paderborn Univ., Germany
Abstract :
The authors present a problem-independent general-purpose parallel implementation of simulated annealing (SA) on distributed message-passing multiprocessor systems. The sequential algorithm is studied, and a classification of combinatorial optimization problems together with their neighborhood structures is given. Several parallelization approaches are examined, considering their suitability for problems of the various classes. For typical representatives of the different classes, good parallel SA implementations are presented. A novel parallel SA algorithm that works simultaneously on several Markov chains and decreases the number of chains dynamically is presented. This method yields good results with a parallel self-adapting cooling schedule. All algorithms are implemented in OCCAM-2 on a free configurable transputer system. Measurements on various numbers of processors up to 128 transputers are presented
Keywords :
Markov processes; distributed processing; message passing; multiprocessing systems; parallel algorithms; simulated annealing; Markov chains; OCCAM-2; classification; combinatorial optimization; distributed message-passing multiprocessor systems; free configurable transputer system; general purpose distributed implementation; neighborhood structures; parallel SA algorithm; parallel self-adapting cooling schedule; sequential algorithm; simulated annealing; Computational modeling; Computer science; Computer simulation; Cooling; Mathematics; Multiprocessing systems; Processor scheduling; Simulated annealing; Traveling salesman problems; Very large scale integration;
Conference_Titel :
Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
Conference_Location :
Arlington, TX
Print_ISBN :
0-8186-3200-3
DOI :
10.1109/SPDP.1992.242758
