✦ LIBER ✦

A two-phase hybrid heuristic algorithm for the capacitated location-routing problem

✍ Scribed by Escobar, John Willmer; Linfati, Rodrigo; Toth, Paolo

Book ID: 119221965
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 256 KB
Volume: 40
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2012.05.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic lagrangean algorithm for the

A heuristic lagrangean algorithm for the capacitated plant location problem

✍ J. Barceló; J. Casanovas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 709 KB

A hybrid algorithm for capacitated plant

A hybrid algorithm for capacitated plant location problem

✍ Ming-Che Lai; Han-suk Sohn; Tzu-Liang (Bill) Tseng; Chunkuan Chiang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 485 KB

An exact algorithm for solving a capacit

An exact algorithm for solving a capacitated location-routing problem

✍ G. Laporte; Y. Nobert; D. Arpin 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 830 KB

A heuristic Lagrangean algorithm for the

A heuristic Lagrangean algorithm for the capacitated plant location problem — A comment

✍ R. Sridharan 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 81 KB

EVE-OPT: a hybrid algorithm for the capa

EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem

✍ Guido Perboli; Ferdinando Pezzella; Roberto Tadei 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 420 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