𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Variable Neighborhood Search based Set Covering ILP Model for the Vehicle Routing Problem with Time Windows

✍ Scribed by Dhahri, Amine; Zidi, Kamel; Ghedira, Khaled


Book ID
124120173
Publisher
Elsevier
Year
2014
Tongue
English
Weight
332 KB
Volume
29
Category
Article
ISSN
1877-0509

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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