%0 Journal Article
%T The Vehicle Routing Problems with Transshipment Points<br>带转运中心的车辆组合运输问题的模型与算法
%A YANG Feng-mei
%A XIAO Hui-jun
%A <br>杨丰梅
%A 肖辉君
%J 系统工程理论与实践
%D 2007
%I 
%X 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.
%K transshipment points
%K VRP
%K dynamic programming algorithm
%K multiple method<br>转运中心
%K 车辆运输问题(VRP)
%K 动态规划算法
%K 混合算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=73071D9187CD12DF&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=38B194292C032A66&sid=D3E34374A0D77D7F&eid=6209D9E8050195F5&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=8