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
Parallel Simulated Annealing Algorithms in Global Optimization
Journal of Global Optimization
Facts, Conjectures, and Improvements for Simulated Annealing
Facts, Conjectures, and Improvements for Simulated Annealing
Low Cost Parallel Solutions for the VRPTW Optimization Problem
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Parallel simulated annealing for the vehicle routing problem with time windows
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Theoretical and practical issues of parallel simulated annealing
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Load balanced parallel simulated annealing on a cluster of SMP nodes
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Distributed simulated annealing with mapreduce
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
Hi-index | 0.00 |
Concurrent computing can be applied to heuristic methods for combinatorial optimization to shorten computation time, or equivalently, to improve the solution when time is fixed. This paper presents several communication schemes for parallel simulated annealing, focusing on a combination of OpenMP nested in MPI. Strikingly, even though many publications devoted to either intensive or sparse communication methods in parallel simulated annealing exist, only a few comparisons of methods from these two distinctive families have been published; the present paper aspires to partially fill this gap. Implementation for VRPTW—a generally accepted benchmark problem—is used to illustrate the advantages of the hybrid method over others tested.