𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

✍ Scribed by Yuichi Nagata; Olli Bräysy; Wout Dullaert

Book ID
108105953
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
763 KB
Volume
37
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge assembly-based memetic algorithm fo
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
✍ Yuichi Nagata; Olli Bräysy 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract Vehicle routing problems are at the heart of most decision support systems for real‐life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e., fleet of vehicles) located at one or several points (e.g.,

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