𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hybrid scatter search and path relinking for the capacitated p-median problem

✍ Scribed by Juan A. Díaz; Elena Fernández

Book ID
108116874
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
346 KB
Volume
169
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallelization of the scatter search fo
Parallelization of the scatter search for the p-median problem
✍ Félix Garcı́a-López; Belén Melián-Batista; José A Moreno-Pérez; J Marcos Moreno- 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 207 KB

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

A branch-and-price algorithm for the cap
A branch-and-price algorithm for the capacitated p-median problem
✍ Alberto Ceselli; Giovanni Righini 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract The capacitated __p__‐median problem is the variation of the well‐known __p__‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We