Parallel Annealing Algorithm Research Articles

A Flip-count-based Dynamic Temperature Control Method for Constrained Combinatorial Optimization by Parallel Annealing Algorithms

A Flip-count-based Dynamic Temperature Control Method for Constrained Combinatorial Optimization by Parallel Annealing Algorithms

Stepwise-overlapped parallel annealing and its application to floorplan designs

A new parallel annealing scheme, stepwise-overlapped parallel annealing, is proposed. This can provide a massive speedup using a multiprocessor system with a large number of processors. It decomposes the annealing process by means of Markov chains. The annealing scheme of the systolic algorithm proposed by Aart et al. is improved. The improved annealing schedule keeps a good temperature profile even when a large number of processors are used. The communication pattern is also enhanced. The new parallel annealing algorithm is applied to floorplan design problems. Experimental results show that the new parallel annealing algorithm is highly effective for a large number of processors. The experimental results of the proposed algorithm are compared with those of other parallel annealing algorithms and the distributed genetic algorithm.

A stepwise-overlapped parallel simulated annealing algorithm

This paper proposes a parallel annealing algorithm, called stepwise-overlapped annealing, that can be efficiently implemented to a multiprocessor system with a large number of processors such as hypercube computers. It is an improved algorithm of the systolic annealing that was proposed by Aarts et al. [8]. We introduce modifications for correcting the temperature decrement strategy and also enhance the communication pattern. Instead of the temperature decrement at each subchain, it calculates the temperature decrement at the start of each Markov chain with the standard deviation of a complete Markov chain previously processed. It is based on an annealing schedule of polynomial time complexity. Experimental results show high efficiencies even when a large number of processors are used. The merit of this parallel annealing algorithm is a simple communication pattern and thus less communication overhead. This parallel annealing algorithm can also effectively replace the high temperature region of the application-dependent parallel simulated annealing algorithms.

A step‐wise‐overlapped parallel annealing algorithm on a message‐passing multiprocessor system

AbstractThis paper proposes a parallel annealing algorithm, called step‐wise‐overlapped parallel annealing, that can provide a massive speed‐up utilizing a multiprocessor system with a large number of processors. We improve the parallel annealing scheme of the systolic algorithm that was proposed by Aart et al. Instead of the temperature decrement at each subchain, it decides the decrement ratio at the start of each Markov chain using the standard deviation of the cost distribution in the previous Markov chain of the full length. Thus the improved annealing schedule keeps a good temperature profile even with a large number of processors. We also enhance the communication pattern.The new parallel annealing algorithm has a simple communication pattern and thus less communication overheads. The decomposition strategy of this parallel annealing algorithm is independent of application problems. Experimental results of the step‐wise‐overlapped parallel annealing algorthm for the travelling salesman problems show high efficiencies even when a large number of processors are used; it produces near optimal solutions with a speedup of 70.8 by using 128 processors. It can be implemented efficiently on a message‐passing multiprocessor system with a large number of processors, such as a hypercube computer.