𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem

✍ Scribed by Sörensen, Kenneth; Schittekat, Patrick

Book ID
121406458
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
368 KB
Volume
40
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.,

The Vehicle Routing Problem || 4. Set-Co
The Vehicle Routing Problem || 4. Set-Covering-Based Algorithms for the Capacitated VRP
✍ Toth, Paolo; Vigo, Daniele 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 210 KB

In The Field Of Combinatorial Optimization Problems, The Vehicle Routing Problem (vrp) Is One Of The Most Challenging. Defined More Than 40 Years Ago, The Problem Involves Designing The Optimal Set Of Routes For Fleets Of Vehicles For The Purpose Of Serving A Given Set Of Customers. Interest In Vrp

[Lecture Notes in Computer Science] Appl
[Lecture Notes in Computer Science] Applications of Evolutinary Computing Volume 4448 || GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows
✍ Giacobini, Mario 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 344 KB

This Book Constitutes The Refereed Joint Proceedings Of Seven Workshops On Evolutionary Computing, Evoworkshops 2007, Held In Valencia, Spain In April 2007. It Examines Evolutionary Computation In Communications, Networks, And Connected Systems; Finance And Economics; Image Analysis And Signal Proce