✦ LIBER ✦

A hybrid search method for the vehicle routing problem with time windows

✍ Scribed by Humberto César Brandão de Oliveira; Germano Crispim Vasconcelos

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 773 KB
Volume: 180
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-008-0487-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Indirect search for the vehicle routing

Indirect search for the vehicle routing problem with pickup and delivery and time windows

✍ Ulrich Derigs; Thomas Döhmer 📂 Article 📅 2006 🏛 Springer 🌐 German ⚖ 280 KB

Scatter search for the fleet size and mi

Scatter search for the fleet size and mix vehicle routing problem with time windows

✍ Patrícia Prado Belfiore; Luiz Paulo Lopes Fávero 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 223 KB

Path inequalities for the vehicle routin

Path inequalities for the vehicle routing problem with time windows

✍ Brian Kallehauge; Natashia Boland; Oli B.G. Madsen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

A bi-criteria heuristic for the vehicle

A bi-criteria heuristic for the vehicle routing problem with time windows

✍ H.R.G. Van Landeghem 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 606 KB

The vehicle routing problem with time wi

The vehicle routing problem with time windows and temporal dependencies

✍ Anders Dohn; Matias Sevel Rasmussen; Jesper Larsen 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 516 KB

A branch-and-price-based large neighborh

A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

✍ Eric Prescott-Gagnon; Guy Desaulniers; Louis-Martin Rousseau 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance tr