𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hybrid heuristics for the probabilistic maximal covering location-allocation problem

✍ Scribed by Francisco de Assis Corrêa; Antonio Augusto Chaves; Luiz Antonio Nogueira Lorena

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
200 KB
Volume
7
Category
Article
ISSN
1109-2858

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid heuristic for the uncapacitated
A hybrid heuristic for the uncapacitated hub location problem
✍ Sue Abdinnour-Helm 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 991 KB

Given n interacting nodes in a network, the Uncapacitated Hub Location Problem (UHP) determines the number of hubs, the location for the hubs, and the assignment of the spokes to hubs that minimizes the overall transportation cost. The hubs are interconnected and each spoke is assigned to a single h

A parallel hybrid heuristic for the mult
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements
✍ Bernard Gendron; Jean-Yves Potvin; Patrick Soriano 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 156 KB

In this paper, a parallel hybrid heuristic is developed for the multicommodity capacitated location problem with balancing requirements. The hybrid involves variable neighborhood descent (VND) and slope scaling (SS). Both methods evolve in parallel within a master-slave architecture where the slave