Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
The annealing algorithm
Synchronous and Asynchronous Parallel Simulated Annealing with Multiple Markov Chains
IEEE Transactions on Parallel and Distributed Systems
Parallel simulated annealing algorithms
Journal of Parallel and Distributed Computing
Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm
IEEE Transactions on Parallel and Distributed Systems
Simulated Annealing: A Proof of Convergence
IEEE Transactions on Pattern Analysis and Machine Intelligence
A methodological approach to parallel simulated annealing on an SMP System
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In this paper we propose a new parallelization scheme for Simulated Annealing | Hierarchical Parallel SA (HPSA). This new scheme features coarse-granularity in parallelization, directed at message-passing systems such as clusters. It combines heuristics such as adaptive clustering with SA to achieve more efficiency in local search. Through experiments with various optimization problems and comparison with some available schemes, we show that HPSA is a powerful general-purposed optimization method. It can also serve as a framework for meta-heuristics to gain broader application.