✦ LIBER ✦

Local search-based metaheuristics for the split delivery vehicle routing problem

✍ Scribed by Derigs, U; Li, B; Vogel, U

Book ID: 125839568
Publisher: Palgrave Publishers Ltd.
Year: 2010
Tongue: English
Weight: 148 KB
Volume: 61
Category: Article
ISSN: 0160-5682
DOI: 10.1057/jors.2009.100

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimization-Based Heuristic for the

An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

✍ Archetti, Claudia; Speranza, M. Grazia; Savelsbergh, Martin W. P. 📂 Article 📅 2008 🏛 INFORMS 🌐 English ⚖ 231 KB

The split delivery vehicle routing probl

The split delivery vehicle routing problem with minimum delivery amounts

✍ Damon Gulczynski; Bruce Golden; Edward Wasil 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Improved lower bounds for the Split Deli

Improved lower bounds for the Split Delivery Vehicle Routing Problem

✍ Lorenza Moreno; Marcus Poggi de Aragão; Eduardo Uchoa 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 273 KB

A Lower Bound for the Split Delivery Veh

A Lower Bound for the Split Delivery Vehicle Routing Problem

✍ J. M. Belenguer, M. C. Martinez and E. Mota 📂 Article 📅 2000 🏛 INFORMS 🌐 English ⚖ 481 KB

A column generation approach for the spl

A column generation approach for the split delivery vehicle routing problem

✍ Mingzhou Jin; Kai Liu; Burak Eksioglu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 252 KB

A column generation approach for the spl

A column generation approach for the split delivery vehicle routing problem

✍ C. Archetti; N. Bianchessi; M. G. Speranza 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract In this article we present a branch‐and‐price‐and‐cut method for the solution of the split delivery vehicle routing problem (SDVRP). The SDVRP is the problem to serve customers with a fleet of capacitated vehicles at minimum traveling cost. With respect to the classical vehicle routing