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
β¦ LIBER β¦
New models and algorithms for the cyclic inventory routing problem
β Scribed by Birger Raa
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 80 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1619-4500
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Models and Algorithms for Vehicle Routin
β
Feng-mei YANG; Hui-jun XIAO
π
Article
π
2007
π
Elsevier
β 144 KB
A heuristic method for the combined loca
β
S.C. Liu; C.C. Lin
π
Article
π
2004
π
Springer
π
English
β 717 KB
A heuristic method for the vehicle routi
β
Shu-Chu Liu; Chich-Hung Chung
π
Article
π
2008
π
Springer US
π
English
β 369 KB
Heuristic and exact algorithms for the m
β
Fabien Tricoire; Karl F. Doerner; Richard F. Hartl; Manuel Iori
π
Article
π
2009
π
Springer
π
German
β 348 KB
Two exact algorithms for the vehicle rou
β
Pontien Mbaraga; AndrΓ© Langevin; Gilbert Laporte
π
Article
π
1999
π
John Wiley and Sons
π
English
β 80 KB
π 2 views
This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe
Two exact algorithms for the distance-co
β
Gilbert Laporte; Martin Desrochers; Yves Nobert
π
Article
π
1984
π
John Wiley and Sons
π
English
β 530 KB