Models and Algorithms for Vehicle Routing Problem with Transshipment Centers

This paper deals with two types of the vehicle routing problems (VRP) with transportation centers: the multi-period single-product 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-stage method and the branch-and-bound technique. Also, a computational study is carried out. Comparing with previous reported results from the literature, the proposed models and algorithms are found superior in terms of the program running efficiency and the satisfactory level of solutions.