Parallelization of the scatter search for the p-median problem

Parallelization of the scatter search for the p-median problem

0.00 Avg rating0 Votes
Article ID: iaor20062889
Country: Netherlands
Volume: 29
Issue: 5
Start Page Number: 575
End Page Number: 589
Publication Date: May 2003
Journal: Parallel Computing
Authors: , , ,
Keywords: computational analysis: parallel computers
Abstract:

This article develops several strategies for the parallelization of the metaheuristic called scatter search, which is a population-based method that constructs solutions by combining others. Three types of parallelization have been proposed to achieve either an increase of efficiency or an increase of exploration. The procedures have been coded in C using OpenMP and compared in a shared memory machine with large instances. The obtained algorithms are tested on the p-median problem.

Reviews

Required fields are marked *. Your email address will not be published.