论文信息 - Problem-Independent Parallel Simulated Annealing using Selection and Migration

Problem-Independent Parallel Simulated Annealing using Selection and Migration

Parallelization of the Simulated Annealing algorithm is a difficult task, due to its inherent sequential nature. A popular alternative approach has been to perform a number of independent annealings, often augmented by periodic “coordination”, the generic strategy being to periodically pick the best current solution as the new starting point for all of the continued annealings.

Per S. Laursen

[1] James R. A. Allwright,et al. A distributed implementation of simulated annealing for the travelling salesman problem , 1989, Parallel Comput..

[2] Nigel Dodd,et al. Slow annealing versus multiple fast annealing runs - an empirical investigation , 1990, Parallel Comput..

[3] Per S. Laursen. Simulated annealing for the QAP. Optimal tradeoff between simulation time and solution quality , 1993 .

[4] Reinhard Lüling,et al. Problem Independent Distributed Simulated Annealing and its Applications , 1993 .

[5] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[7] R. Liiling. Problem Independent Distributed Simulated Annealing and its Applications , 1993 .

[8] Alberto L. Sangiovanni-Vincentelli,et al. A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.