基于C-W算法的汽车零部件循环取货车辆路径优化研究  

Optimization of vehicle routing of automobile parts milk run based on C-W algorithm

作　　者：汪安静[1] 龚本刚[1] 

机构地区：[1]安徽工程大学管理工程学院,安徽芜湖241000

出　　处：《安徽工程科技学院学报（自然科学版）》2010年第2期91-94,共4页Journal of Anhui University of Technology and Science

基　　金：安徽省高校自然科学基金资助项目(kj2010a039)

摘　　要：针对汽车零部件取货具有多频次和时间窗限制的特点,利用先进的循环取货方式对零部件进行取货.并构建数学模型优化取货路径,利用C-W算法,获得符合所有约束条件的满意解.使其在配送总量一定的情况下,运输总里程大大降低,从而节约了运输成本.最后给出一个算例.Based on the characteristics of the automobile parts with multi-frequency and time windows restrictions,the paper uses of advanced Milk Run way to pick up spare parts.And by building the mathematical model and optimizing the pick-up path,and using CW algorithm,the satisfactory solution is obtained to meet all the restrictions.Under the cases of the total distribution being constant,the total mileage of transport greatly decreases,thus saving transportation cost.Finally,the paper gives an example to describe this model.

关 键 词：C-W算法 循环取货 汽车零部件 路径优化 

分 类 号：F253[经济管理—国民经济]