This paper deals with two types of the vehicle routing problems (VRP) with transportation centers: the multi-period singleproduct VRP and the single-period multi-product VRP. Mathematical models and the corresponding algorithms are developed on a basis of dynamic programming while combining two-stag
Applications of the vehicle routing problem with trailers and transshipments
โ Scribed by Drexl, Michael
- Book ID
- 120675751
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 391 KB
- Volume
- 227
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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