Parallelization of the scatter search for the p-median problem

Authors:
Félix García-López;Belén Melián-Batista;José A. Moreno-Pérez;J. Marcos Moreno-Vega
Affiliations:
Departamento de Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna 38271, Spain;Departamento de Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna 38271, Spain;Departamento de Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna 38271, Spain;Departamento de Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna 38271, Spain
Venue:
Parallel Computing - Special issue: Parallel computing in logistics
Year:
2003

Citing 5
Cited 11

Stabilized column generation

Discrete Mathematics
Anomalies in parallel branch-and-bound algorithms

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Variable Neighborhood Decomposition Search

Journal of Heuristics
Toward Self-Integrating Software Applications for Supply Chain Management

Information Systems Frontiers

A Hybrid Heuristic for the p-Median Problem

Journal of Heuristics
A scatter search-based heuristic to locate capacitated transshipment points

Computers and Operations Research
A hybrid scatter search for the probabilistic traveling salesman problem

Computers and Operations Research
Soft computing and cooperative strategies for optimization

Applied Soft Computing
The OA-based swap method for the p-median problem

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Workforce planning with parallel algorithms

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Studies on the performance of a heuristic algorithm for static and transportation facility location allocation problem

HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
Data mining with scatter search

EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
An empirical investigation on system and statement level parallelism strategies for accelerating scatter search using handel-C and impulse-C

VLSI Design
GPU-based parallel vertex substitution algorithm for the p-median problem

Computers and Industrial Engineering
Parallel Scatter Search Algorithms for Exam Timetabling

International Journal of Applied Metaheuristic Computing

Quantified Score

Hi-index	0.00

Visualization

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.