✦ LIBER ✦

Path inequalities for the vehicle routing problem with time windows

✍ Scribed by Brian Kallehauge; Natashia Boland; Oli B.G. Madsen

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 233 KB
Volume: 49
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20178

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Fixed routes with backup vehicles for st

Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints

✍ Alan L. Erera; Martin Savelsbergh; Emrah Uyar 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

Valid inequalities for the fleet size an

Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs

✍ Roberto Baldacci; Maria Battarra; Daniele Vigo 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 218 KB

## Abstract In the well‐known vehicle routing problem (VRP), a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. An important variant of the VRP arises when a mixed fleet of vehicles, charac

Metaheuristics for the vehicle routing p

Metaheuristics for the vehicle routing problem with loading constraints

✍ Karl F. Doerner; Guenther Fuellerer; Richard F. Hartl; Manfred Gronalt; Manuel I 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB

An exact algorithm for the elementary sh

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

✍ Dominique Feillet; Pierre Dejax; Michel Gendreau; Cyrille Gueguen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

A dynamic programming algorithm for the

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w