The Vehicle Routing Problems with Transshipment Points
带转运中心的车辆组合运输问题的模型与算法

In this paper,we mainly talk about two kinds of the vehicle routing problems with transportation center.One is VRP of single product with a customer in many days.The other is VRP of many products with single customer in a day.We give the mathematical model and algorithms about these two problems.At the same time we use some numeric examples to certify our conclusion.The algorithm used in this paper is that dynamic programming algorithm and blending algorithm which is made up by two-phase method and the branch delimit law.The solution and the program both are better.