✦ LIBER ✦

A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows

✍ Scribed by Bard, Jonathan F.; Kontoravdis, George; Yu, Gang

Book ID: 118021231
Publisher: INFORMS
Year: 2002
Tongue: English
Weight: 248 KB
Volume: 36
Category: Article
ISSN: 0041-1655
DOI: 10.1287/trsc.36.2.250.565

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Heuristic for the Vehicle Routing Prob

A Heuristic for the Vehicle Routing Problem with Time Windows

✍ Roberto Cordone; Roberto Wolfler Calvo 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 99 KB

The robust vehicle routing problem with

The robust vehicle routing problem with time windows

✍ Agra, Agostinho; Christiansen, Marielle; Figueiredo, Rosa; Hvattum, Lars Magnus; 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 303 KB

A hybrid algorithm for vehicle routing p

A hybrid algorithm for vehicle routing problem with time windows

✍ B. Yu; Z.Z. Yang; B.Z. Yao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 646 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 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

A new branch-and-cut algorithm for the c

A new branch-and-cut algorithm for the capacitated vehicle routing problem

✍ Jens Lysgaard; Adam N. Letchford; Richard W. Eglese 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 203 KB