✦ LIBER ✦

Benders' cuts guided large neighborhood search for the traveling umpire problem

✍ Scribed by Michael A. Trick; Hakan Yildiz

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 116 KB
Volume: 58
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.20482

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient neighborhood search for the Pr

Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

✍ Patrizia Beraldi; Gianpaolo Ghiani; Gilbert Laporte; Roberto Musmanno 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 90 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