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

T. Mavridou, P.M. Pardalos, L. Pitsoulis, and M.G.C. Resende

In Parallel Algorithms for Irregularly Structured Problems, Proceedings of the Second International Workshop - Irregular'95, A. Ferreira and J. Rolim, eds., Lecture Notes in Computer Science, Springer-Verlag, vol. 980, pp. 317-331, 1995


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.

PDF file of full paper

Go back

Mauricio G.C. Resende's Home Page

Last modified: 07 April 2005

Copyright Notice