✦ LIBER ✦

An overview of a heuristic for vehicle routing problem with time windows

✍ Scribed by Fuh-hwa Franklin Liu; Sheng-yuan Shen

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 321 KB
Volume: 37
Category: Article
ISSN: 0360-8352
DOI: 10.1016/s0360-8352(99)00086-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On the worst-case performance of some he

On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints

✍ Marius M. Solomon 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 607 KB

A multi-phase constructive heuristic for

A multi-phase constructive heuristic for the vehicle routing problem with multiple trips

✍ R.J Petch; S Salhi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 918 KB

An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time period is investigated. A multi-phase constructive heuristic, which is enhanced by suitable data structure, is proposed. Results are given comparing to benchmarks from the l

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 reactive tabu search meta-heuristic fo

A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls

✍ Ibrahim H. Osman; Niaz A. Wassan 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 195 KB

The vehicle routing problem with back-hauls involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a set of vehicles to service a set of customers with known quantities to be either delivered or collected. This paper describes two route-construction