Nesting OpenMP in MPI to Implement a Hybrid Communication Method of Parallel Simulated Annealing on a Cluster of SMP Nodes

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.

[1]  Kyung-Geun Lee,et al.  Synchronous and Asynchronous Parallel Simulated Annealing with Multiple Markov Chains , 1996, IEEE Trans. Parallel Distributed Syst..

[2]  Anthony Skjellum,et al.  A High-Performance, Portable Implementation of the MPI Message Passing Interface Standard , 1996, Parallel Comput..

[3]  Zbigniew J. Czech,et al.  Parallel simulated annealing for the vehicle routing problem with time windows , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[4]  SkjellumAnthony,et al.  A high-performance, portable implementation of the MPI message passing interface standard , 1996 .

[5]  Jens Volkert,et al.  Distributed and Parallel Systems , 2000 .

[6]  Peter Salamon,et al.  Facts, Conjectures, and Improvements for Simulated Annealing , 1987 .

[7]  Esin Onbasçioglu,et al.  Parallel Simulated Annealing Algorithms in Global Optimization , 2001, J. Glob. Optim..

[8]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[9]  Daniel R. Greening,et al.  Parallel simulated annealing techniques , 1990 .

[10]  Robert Azencott,et al.  Simulated annealing : parallelization techniques , 1992 .

[11]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[12]  Fu-Hsieng Allisen Lee,et al.  Parallel simulated annealing on a message-passing multi-computer , 1996 .

[13]  Loo Hay Lee,et al.  Heuristic methods for vehicle routing problem with time windows , 2001, Artif. Intell. Eng..

[14]  Emile H. L. Aarts,et al.  Parallel implementations of the statistical cooling algorithm , 1986, Integr..

[15]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[16]  Olatz Arbelaitz,et al.  Low cost parallel solutions for the VRPTW optimization problem , 2001, Proceedings International Conference on Parallel Processing Workshops.

[17]  Zbigniew J. Czech,et al.  A Concurrent Implementation of Simulated Annealing and its Application to the VRPTW Optimization Problem , 2004, DAPSYS.

[18]  Dieter Kranzlmüller,et al.  Distributed and Parallel Systems: Cluster and Grid Computing , 2002 .