摘要
为了降低汽车零部件入厂物流的总成本,针对汽车零部件入厂物流的循环取货路径规划问题,提出将供应商集货需求拆分配送的改进数学模型,以最小化运输和库存总成本为目标函数,并且满足时间窗和车辆容量的限制。通过设计禁忌搜索算法求解,并根据模型的特点对初始解及邻域搜索方法进行改进。最后应用实验数据验证算法有效性,并与其他算法对比,结果表明通过需求拆分可以节约运输成本并提高车辆装载率。
The milk-run mode has been widely used in the automobile parts supply.The key to the milk-run is to seek the optimal paths for the vehicles.This paper developed a milk-run model with time windows and split deliveries.The objective function was to minimize the transportation and inventory cost.In order to solve this model,this paper proposed a tabu search algorithm.According to the specificity of the model,it designed the tabu search algorithm with special treatments on initial solution and neighborhood search.In the end,it used some computational experiments to testify the validity and efficiency of the model and the algorithm.The results indicate that the transportation cost can be saved and the vehicle loading rate can be improved by this model and algorithm.
出处
《计算机应用研究》
CSCD
北大核心
2013年第6期1647-1651,共5页
Application Research of Computers
基金
国家自然科学基金重大项目(71132006)
