带卸货时间窗的循环取货路径计划问题研究
Research on Automobile Parts Milk-Run Routing with Unload Time Window
DOI: 10.12677/MSE.2016.54022, PDF, HTML, XML,  被引量 下载: 1,681  浏览: 4,129 
作者: 陶业辉, 赵磊, 朱道立:上海交通大学中美物流研究院,上海;上海交通大学安泰经济与管理学院,上海
关键词: 汽车零部件入厂物流循环取货卸货时间窗禁忌搜索算法Automobile Parts Supply Logistics Milk-Run Unload Time Windows Tabu Research Algorithm
摘要: 当今汽车供应链拉动式生产盛行,汽车零部件入厂物流表现出高度的复杂性和专业性,针对该场景下的循环取货问题,引入卸货时间窗的概念,设计供应商集货需求可拆分的数学模型,以降低零部件循环取货过程中的车辆运输成本,同时满足卸货时间窗和车辆容量的限制。根据所设计模型的特点设计禁忌搜索算法,改进初始解及邻域搜索算法,最后通过实验数据证明算法的有效性,并与现有算法进行比对,表明该模式下的循环取货模式可以更有效的节约运输成本,保证生产效率。
Abstract: Nowadays, pulling type production becomes more popular in automobile supply chain. Inbound logistics of auto parts showed a high degree of complexity and professionalism. For the milk-run problem in such scene, this paper designs a model with unload time window and split deliveries, to minimize the transportation cost. According to the characteristics of the model, this paper designed a tabu search algorithm, and the initial solution and the neighborhood search algorithm are improved. Finally, it proved the validity of the algorithm by the experimental data, and compared with the existing algorithms. The result shows that the milk-run mode can effectively save transportation cost and ensure production efficiency.
文章引用:陶业辉, 赵磊, 朱道立. 带卸货时间窗的循环取货路径计划问题研究[J]. 管理科学与工程, 2016, 5(4): 203-213. http://dx.doi.org/10.12677/MSE.2016.54022

参考文献

[1] Bowersox, D.J., Copper, M.B. and Closs, D.J. (2002) Supply Chain Logistics Management (Vol. 2). McGraw-Hill, New York.
[2] Du, T., Wang, F.K. and Lu, P.Y. (2007) A Real-Time Vehicle-Dispatching System for Consolidating Milk Runs. Transportation Research Part E: Logistics and Transportation Review, 43, 565-577.
https://doi.org/10.1016/j.tre.2006.03.001
[3] Nemoto, T., Hayashi, K. and Hashimoto, M. (2010) Milk-Run Logistics by Japanese Automobile Manufacturers in Thailand. Procedia-Social and Behavioral Sciences, 2, 5980-5989.
https://doi.org/10.1016/j.sbspro.2010.04.012
[4] Satoh, I. (2008) A Formal Approach for Milk-Run Transport Logistics. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 91, 3261-3268.
https://doi.org/10.1093/ietfec/e91-a.11.3261
[5] 徐秋华. Milkrun-循环取货方式在上海通用汽车的实践和应用[J]. 汽车与配件, 2003(3): 21-24.
[6] Savelsbergh, M.W. (1985) Local Search in Routing Problems with Time Windows. Annals of Operations Research, 4, 285-305.
https://doi.org/10.1007/BF02022044
[7] Golden, B.L., Wasil, E.A., Kelly, J.P. and Chao, I.M. (1998) The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results. In: Fleet Management and Logistics, Springer US, 33-56.
https://doi.org/10.1007/978-1-4615-5755-5_2
[8] Solomon, M.M. (1987) Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, 35, 254-265.
https://doi.org/10.1287/opre.35.2.254
[9] Banos, R., Ortega, J., Gil, C., Márquez, A.L. and de Toro, F. (2013) A Hy-brid Meta-Heuristic for Multi Objective Vehicle Routing Problems with Time Windows. Computers & Industrial Engineering, 65, 286-296.
https://doi.org/10.1016/j.cie.2013.01.007
[10] Dror, M. and Trudeau, P. (1989) Savings by Split Delivery Routing. Transportation Science, 23, 141-145.
https://doi.org/10.1287/trsc.23.2.141
[11] Archetti, C., Speranza, M.G. and Hertz, A. (2006) A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science, 40, 64-73.
https://doi.org/10.1287/trsc.1040.0103
[12] 孟凡超, 陆志强, 孙小明. 需求可拆分车辆路径问题的禁忌搜索算法[J]. 计算机辅助工程, 2010, 19(1): 78-83.
[13] 熊浩, 鄢慧丽. 需求可拆分车辆路径问题的三阶段禁忌算法[J]. 系统工程理论与实践, 2015(5): 1230-1235.
[14] Ho, S.C. and Haugland, D. (2004) A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows and Split Deliveries. Computers & Operations Research, 31, 1947-1964.
https://doi.org/10.1016/S0305-0548(03)00155-2