Cung, Van-Dat; Martins, Simone L.; Ribeiro, Celso C.; Roucairol, Catherine Strategies for the parallel implementation of metaheuristics. (English) Zbl 1005.90066 Ribeiro, Celso C. et al., Essays and surveys in metaheuristics. Boston: Kluwer Academic Publishers. Oper. Res./Comput. Sci. Interfaces Ser. 15, 263-308 (2002). Summary: Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems. They not only allow solving larger problems or finding improved solutions with respect to their sequential counterparts, but also lead to more robust algorithms. We review some trends in parallel computing and report recent results about linear speedups that can be obtained with parallel implementations using multiple independent processors. Parallel implementations of tabu search, GRASP, genetic algorithms, simulated annealing, and ant colonies are reviewed and discussed to illustrate the main strategies used in the parallelization of different metaheuristics and their hybrids.For the entire collection see [Zbl 0976.00017]. Cited in 9 Documents MSC: 90C59 Approximation methods and heuristics in mathematical programming 68W10 Parallel algorithms in computer science 90C27 Combinatorial optimization Keywords:metaheuristics; combinatorial optimization problems; tabu search Software:GRASP; PVM; OR-Library; MPI; Algorithm 787; Algorithm 797 PDFBibTeX XMLCite \textit{V.-D. Cung} et al., in: Essays and surveys in metaheuristics. Selected papers of the Third Metaheuristics International Conference held in Angra dos Reis, Brazil, July 1999. Boston: Kluwer Academic Publishers. 263--308 (2002; Zbl 1005.90066)