Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP

In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementation of genetic algorithms, simulated annealing, tabu search, and greedy randomized adaptive search procedures (GRASP) are discussed. Key words: Parallel Search, Heuristics, Genetic Algorithms, Simulated Annealing, Tabu Search, GRASP, Parallel Computing.

• Type: Conference
• Year: 1995
• Where: IRREGULAR
• Authors: Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D. Mavridou, Mauricio G. C. Resende
• Keywords: Distributed And Parallel Computing, IRREGULAR 1995, Parallel Search, Parallel Search Techniques, Tabu Search