Parallel metaheuristics for combinatorial optimization

S. Duni Eksioglu, P. M. Pardalos, and M. G. C. Resende

To appear in  Advanced Algorithmic Techniques for Parallel Computation with Applications, R. Correa et al., eds., Kluwer Academic Publishers, 2002

ABSTRACT

In this paper, we review parallel metaheuristics for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementation of genetic algorithms, simulated annealing, tabu search, variable neighborhood 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: 28 June 2002

Copyright Notice