✦ LIBER ✦

Heuristic and lower bound for a stochastic location-routing problem

✍ Scribed by Maria Albareda-Sambola; Elena Fernández; Gilbert Laporte

Book ID: 108116993
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 311 KB
Volume: 179
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.04.051

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic and lower bound for a multi-

A heuristic and lower bound for a multi-depot routing problem

✍ Robert T. Sumichras; Ina S. Markham 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 653 KB

A heuristic method for the combined loca

A heuristic method for the combined location routing and inventory problem

✍ S.C. Liu; C.C. Lin 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 717 KB

Lower and upper bounds for the two-echel

Lower and upper bounds for the two-echelon capacitated location-routing problem

✍ Contardo, Claudio; Hemmelmayr, Vera; Crainic, Teodor Gabriel 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 294 KB

A two-phase hybrid heuristic algorithm f

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

✍ Escobar, John Willmer; Linfati, Rodrigo; Toth, Paolo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 256 KB

A branch-and-regret heuristic for stocha

A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems

✍ Lars Magnus Hvattum; Arne Løkketangen; Gilbert Laporte 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

A branch-and-regret heuristic for stocha

A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems

✍ Lars Magnus Hvattum; Arne Løkketangen; Gilbert Laporte 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

## Abstract This paper describes a new Branch‐and‐Regret Heuristic for a class of dynamic and stochastic vehicle routing problems. This work is motivated by a real‐life problem faced by a major transporter in Norway. The heuristic uses stochastic information during the solution process. The new met