𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallelization of the scatter search for the p-median problem

✍ Scribed by Félix Garcı́a-López; Belén Melián-Batista; José A Moreno-Pérez; J Marcos Moreno-Vega

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
207 KB
Volume
29
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

An efficient tabu search procedure for t
An efficient tabu search procedure for the p-Median Problem
✍ Erik Rolland; David A. Schilling; John R. Current 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 944 KB

In this paper we present a new solution heuristic for the p-Median Problem. The algorithm is based on tabu search principles, and uses short term and long term memory, as well as strategic oscillation and random tabu list sizes. Our proposed procedure is compared with two other move heuristics: a we