๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The robust vehicle routing problem with
โœ Agra, Agostinho; Christiansen, Marielle; Figueiredo, Rosa; Hvattum, Lars Magnus; ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 303 KB
A branch-and-price-based large neighborh
โœ 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