Client Grouping in Distribution System Optimization

NEWELL G F,DAGANZO C F.Design of multiple-vehicle tours (part Ⅰ)-a ring-radial network[J].Transportation Research-B,1986,20 (5):345-363.[2] HAIMOVICH M,RINNOOY KAN A G H.Bounds and heuristics for capacitated routing problem[J].Mathematics of Operations Research,1985,10:527-542.[3] NOVAES A G N,CURSIJ E S,GRACIOLLI O D.A continuous approach to the design of physical distribution systems[J].Computers Operations Research,2000,27:877-893.[4] 袁庆达.随机库存-运输联合优化问题研究[D].博士学位论文.成都:西南交通大学,2002,27,81-89.[5] DROR M,BALL M,GOLDENB.A computational comparison of algorithms for the inventory routing problem[J].Annals of Operations Research,1985,1:3-23.[6] GILLETTB E,MILLER L R.A heuristic algorithm for the vehicle dispatch problem[J].Operations Research,1974,22:340-349.[7] DAGANZO C F.The distance traveled to visit N points with a maximum of C stops per vehicle:an analytic model and an application[J].Transportation Science,1984,18 (4):331-350.[8] 蒋赛.VMI模式下的IRP研究[D].硕士学位论文.成都:西南交通大学,2005,43-46.JIANG S.Research on IRP under the mode of VMI[D].Master Degree Thesis.Chengdu:Southwest Jiaotong University,2005,43-46.