期刊文献+

单区型物流配送中心订单分批与路径优化研究 被引量:2

Research on Order Batching and Route Optimization of Single Zone Logistics Distribution Center
下载PDF
导出
摘要 在物流配送中心中,对于货物进行拣选一直以来都是物流配送作业中的核心环节,对货物拣选的作业量高达60%,且货物拣选作业成本占总作业成本的50%~75%,因此拣选作业是制约配送效率提高的关键环节。文章以单区型的物流配送中心订单拣选作业为研究对象,着重研究货物的拣选路径。通过采用基于订单相似系数的聚类算法对订单进行分批拣选和基于禁忌搜索算法对订单拣选路径进行计算,并将它们的结果与订单不分批结果进行比较,从而得到禁忌搜索算法的优化高于聚类算法,拣选路径的优化提高了64%,同时这两种方法跟不分批订单拣选路径相对比,都能够有效提高拣选货物的效率,分别提高了69%和89%,减少人力劳动,在一定程度上减少了物流作业成本。 In the logistics distribution center,the picking of goods has always been the core link in the logistics distribution operation.The amount of goods picking is as high as 60%,and the cost of goods picking accounts for 50%~75%of the total cost.Therefore,the picking operation is the key link restricting the improvement of distribution efficiency.This paper takes the order picking operation of single area logistics distribution center as the research object,and focuses on the picking path of goods.By using the clustering algorithm based on order similarity coefficient for batch order picking and the tabu search algorithm for order picking path calculation,and comparing their results with the results of no batch order,it is concluded that the optimization of tabu search algorithm is higher than that of clustering algorithm,and the optimization of picking path is improved by 64%,at the same time,these two methods can effectively improve the efficiency of picking goods compared with the non batch order picking path,which increases by 69%and 89%respectively,reduces human labor and reduces logistics operation cost to a certain extent.
作者 张娟 李莉 ZHANG Juan;LI Li(School of Transportation and Logistics Engineering,Xinjiang Agricultural University,Urumqi 830000,China)
出处 《物流科技》 2022年第1期35-37,42,共4页 Logistics Sci-Tech
基金 新疆维吾尔自治区物流学会资助项目“乌鲁木齐市城市共同配送规划研究”(WLXH2018023)。
关键词 订单相似系数 聚类分析 订单分批 禁忌搜索算法 order similarity coefficient cluster analysis order batching tabu search algorithm
  • 相关文献

参考文献5

二级参考文献25

  • 1叶志伟,郑肇葆.蚁群算法中参数α、β、ρ设置的研究——以TSP问题为例[J].武汉大学学报(信息科学版),2004,29(7):597-601. 被引量:155
  • 2M. B. M. de Koster, E. S. van der Poort, M. Wolters. Efficient Order-hatching Methods in Warehouse [J]. INT. J. PROD. RES., 1999, 37(7).
  • 3Gademan, N., Van den Berg, J. and Van der Hoff, H., An order-hatching Algorithm for Wave Picking in a Parallel-aisle Warehouse [J]. IIE Transactions, 2001, (33).
  • 4Rosenwein, M.B., An Application of Cluster Analysis to the Problem of Locating Items within a Warehouse [J]. IIE Transactions, 1994, (26).
  • 5Mu-Chen Chen, Cheng-Lung Huang, Kai-Ying Chen, Hsiao-Pin Wu. Aggregation of Orders in Distribution Centers Using Date Mining [J]. Expert Systems with Applications, 2005, (28).
  • 6H. HWANG and D. G. KIM, Order-batching Heuristics Based on Cluster Analysis in A Low-level Picker-to-part Warehousing System [J]. International Journal of Production Research, 2005,43 (17).
  • 7Hark Hwang, Wonjang Baek, Moon-Kyu Lee. Clustering Algriothm for Order Picking in an Automated Storage and Retrieval System [J]. INT. J. PROD. RES., 1998, 26(2).
  • 8Charles G. Petersen Ⅱ. An Evaluation of order Picking Routing policies [J]. International Journal of Operations & Production Management. 1997, 17(11).
  • 9Slotnick S A, Morton T E. Order Acceptance with Weighted Tardiness[J]. Computers & Operations Research, 2007,34 : 3029-3042.
  • 10Arredondo F, Martinez E. Learning and Adaptation of a Policy for Dynamic Order Acceptance in Make-- to-- order Manufacturing[J]. Computers Industrial Engineering, 2010,58 : 70-83.

共引文献62

同被引文献23

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部