Parallel annealing by periodically interacting multiple searches: An experimental study. (English) Zbl 0779.90069

Graffigne, Christine

Simulated annealing. Parallelization techniques, 47-79 (1992).

[For the entire collection see Zbl 0746.00020.]
In this extensive chapter a simplification of the parallelization algorithms proposed by E. H. L. Aarts and P. J. M. van Laarhoven [see the paper of E. H. L. Aarts, F. M. J. de Bont, J. H. A. Habers and P. J. M. van Laarhoven, in: Theoretical Aspects of Computer Science, Lect. Notes Comput. Sci. 210, 87-97 (1986; Zbl 0601.65051)] is considered. After a summary of the theoretical framework of the general simulated annealing algorithm the parallelized algorithm on Markov chains is defined and some experimental results are given. In the following sections further parallel algorithms are given. The performances of the different algorithms are compared with those of the sequential algorithm for a given number of iterations.

Reviewer: G.Schulz (Magdeburg)

MSC:

90C27	Combinatorial optimization
68Q25	Analysis of algorithms and problem complexity
65Y05	Parallel numerical computation
68W15	Distributed algorithms
90-08	Computational methods for problems pertaining to operations research and mathematical programming

Keywords:

parallelization algorithms; simulated annealing

Citations:

Zbl 0746.00020; Zbl 0601.65051