✦ LIBER ✦

Discrete approximation heuristics for the capacitated continuous location–allocation problem with probabilistic customer locations

✍ Scribed by Engin Durmaz; Necati Aras; İ. Kuban Altınel

Book ID: 108105886
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 225 KB
Volume: 36
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2008.08.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hybrid heuristics for the probabilistic

Hybrid heuristics for the probabilistic maximal covering location-allocation problem

✍ Francisco de Assis Corrêa; Antonio Augusto Chaves; Luiz Antonio Nogueira Lorena 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 200 KB

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

A Lagrangian heuristic for the capacitat

A Lagrangian heuristic for the capacitated plant location problem with single source constraints

✍ R. Sridharan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 547 KB