ACM Transactions on Mathematical Software (TOMS)
On the convergence of stationary distributions in simulated annealing algorithms
Information Processing Letters
Cooling schedules for optimal annealing
Mathematics of Operations Research
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
A distributed implementation of simulated annealing
Journal of Parallel and Distributed Computing - Neural Computing
Parallel simulated annealing techniques
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Parallel Simulated Annealing using Speculative Computation
IEEE Transactions on Parallel and Distributed Systems
Parallel Coarse Grain Computing of Boltzmann Machines
Neural Processing Letters
Parallel Simulated Annealing Algorithms in Global Optimization
Journal of Global Optimization
A methodological approach to parallel simulated annealing on an SMP System
Journal of Parallel and Distributed Computing
Hardware Support for Simulated Annealing and Tabu Search
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Using PVM for Distributed Logic Minimization in a Network of Computers
Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
CompSysTech '08 Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing
A Parallel Simulated Annealing Approach for Floorplanning in VLSI
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Theoretical and practical issues of parallel simulated annealing
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Parallel simulated annealing algorithm for graph coloring problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Parallelization and performance characterization of protein 3D structure prediction of Rosetta
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Co-operative, parallel simulated annealing for the VRPTW
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
Hierarchical parallel simulated annealing and its applications
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Load balanced parallel simulated annealing on a cluster of SMP nodes
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
| Hi-index | 0.01 |
Simulated annealing is a general-purpose optimization technique capable of finding an optimal or near-optimal solution in various applications. However, the long execution time required for a good quality solution has been a major drawback in practice. Extensive studies have been carried out to develop parallel algorithms for simulated annealing. Most of them were not very successful, mainly because multiple processing elements (PEs) were required to follow a single Markov chain and, therefore, only a limited parallelism was exploited. In this paper, we propose new parallel simulated annealing algorithms which allow multiple Markov chains to be traced simultaneously by PEs which may communicate with each other. We have considered both synchronous and asynchronous implementations of the algorithms. Their performance has been analyzed in detail and also verified by extensive experimental results. It has been shown that for graph partitioning the proposed parallel simulated annealing schemes can find a solution of equivalent (or even better) quality up to an order of magnitude faster than the conventional parallel schemes. Among the proposed schemes, the one where PEs exchange information dynamically (not with a fixed period) performs best.