๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A set-covering based heuristic algorithm for the periodic vehicle routing problem

โœ Scribed by Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.

Book ID
122520129
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
239 KB
Volume
163
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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