Parallel implementations of the statistical cooling algorithm
Integration, the VLSI Journal
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and 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
Parallel simulated annealing on a message-passing multi-computer
Parallel simulated annealing on a message-passing multi-computer
Synchronous and Asynchronous Parallel Simulated Annealing with Multiple Markov Chains
IEEE Transactions on Parallel and Distributed Systems
Facts, Conjectures, and Improvements for Simulated Annealing
Facts, Conjectures, and Improvements for Simulated Annealing
Speeding Up Sequential Simulated Annealing by Parallelization
PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
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
A simulated annealing algorithm for GPU clusters
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Hi-index | 0.00 |
Several parallel simulated annealing algorithms with different co-operation schemes are considered. The theoretical analysis of speedups of the algorithms is presented. The outcome of the theoretical analysis was verified by practical experiments whose aim was to investigate the influence of the co-operation of parallel simulated annealing processes on the quality of results. The experiments were performed assuming a constant cost of parallel computations, i.e., searching for solutions was conducted with a given number of processors for a specified period of time. For the experiments a suite of benchmarking tests for the vehicle routing problem with time windows was used.