B2C电子商务仓库拣货路径优化策略应用研究

运筹与管理 ›› 2014, Vol. 23 ›› Issue (1): 7-14.

B2C电子商务仓库拣货路径优化策略应用研究

李建斌¹, 周玮¹, 陈峰²

1.华中科技大学管理学院,湖北武汉 430074;
2.上海交通大学工业工程与物流工程系,上海 200242

收稿日期:2012-11-27 出版日期:2014-01-25
作者简介:李建斌(1980- ),男,博士,研究方向:物流与供应链管理、电子商务。
基金资助:
国家自然科学基金资助项目(71171088,70901029,71131004);教育部新世纪人才支持计划(NCET-13-0228)

Applied Optimal Strategies for Warehouse Picking Routing in B2C

LI Jian-bin¹, ZHOU Wei¹, CHEN Feng²

1. School of Management, Huazhong University of Science and Technology, Wuhan 430074, China;
2. Department of Industrial Engineering and Logistics Engineering, Shanghai Jiao Tong University, Shanghai 200240, China

Received:2012-11-27 Online:2014-01-25

摘要/Abstract

摘要： 当前国内B2C电子商务仓库多为人至物的拣货模式,拣货作业成为其核心作业之一,占据仓库大量时间成本和资金成本,拣货路径优化成为企业亟需解决的问题。本文基于TSP对拣货路径进行建模,利用蚁群算法、模拟退火算法和禁忌搜索对该NP-hard问题进行求解,并同当前企业普遍采用的S型启发式策略进行对比,拣货时间节约13.35%。进一步得出当拣货品数量较少时应采用模拟退火算法求解,而当拣货品数量较大时采用蚁群算法仅进行一次迭代,则可以实现短时间得到相对较优的解。所得结果已应用于某大型电子商务企业,效果明显。

关键词: 拣货路径问题, 电子商务, 蚁群算法, S型启发式策略

Abstract: Men-to-thing picking method is widely used in existing B2C warehouse in China, in which picking is one of the core workloads and it takes a lot of time and capital. Warehouse picking routing is an important problem in e-commerce. Based on TSP, we build a picking routing model which is NP-hard and solved by ant colony algorithm, simulated annealing algorithm, tabu search algorithm and S-shape heuristic algorithms, respectively. The results show that the picking time by ant colony algorithm saves time by 13.35% compared with that by S-shape heuristic algorithms. Furthermore, we obtain a relative optimal solution in shorter time with simulated annealing algorithm when the number of picking goods is small, while the ant colony algorithm can achieve the relative optimal results with only one iteration. These results have been applied to one e-commerce business and have been effective.

Key words: picking route problem, E-commerce, ant colony algorithm, S-shape heuristic algorithms

中图分类号:

F224

李建斌, 周玮, 陈峰. B2C电子商务仓库拣货路径优化策略应用研究[J]. 运筹与管理, 2014, 23(1): 7-14.

LI Jian-bin, ZHOU Wei, CHEN Feng. Applied Optimal Strategies for Warehouse Picking Routing in B2C[J]. Operations Research and Management Science, 2014, 23(1): 7-14.

参考文献

[1] Goetschalckx M, Ratliff H D. Order picking in an aisle[J]. IIE Transactions, 1988, 20(1): 53-62.
[2] Hall R W. Distance approximations for routing manual pickers in a warehouse[J]. IEE Transactions, 1993, 25(4): 76-87.
[3] Petersen C G. An evaluation of order picking routing policies[J]. International Journal of Operation & Production Management, 1997, 17: 1098-1111.
[4] Hwang H, Oh Y H, Lee Y K. An evaluation of routing policies for order-picking operations in low-level picker-to-part system[J]. International Journal of Operation & Production Research, 2004, 42(18): 3873-3889.
[5] Petersen C G, Schmenner R W. An evaluation of routing and volume-based storage policies in an order picking operation[J]. Decision Sciences, 1999, 30(2): 481-501.
[6] Jeroen V B, Gademann A. Optimal routing in an automated storage/retrieval system with dedicated storage[J]. IIE Transactions, 1999, 31(5): 407-415.
[7] Roodbergen K J, Koster R D. Routing order pickers in a warehouse with a middle aisle[J]. European Journal of Operational Research, 2001, 122: 32-43.
[8] Vsughan T S, Petersen C G. The effect of cross aisles on order picking efficiency[J]. International Journal of Production Research, 1997, 37(4). 881-897.
[9] Roodbergen K J, Koster R D. Routing method for warehouse with multiple aisles[J]. International Journal of Production Research, 2001 39(9): 1865-1883.
[10] 李诗珍,王转.订单拣取路径优化研究—S形启发式方法在配送中心拣货中的应用[J].物流技术与应用,2002,7(5):67-70.
[11] Tho L D, Rene M B M. De Koster R. Travel time estimation and order batching in a 2-block warehouse[J]. European Journal of Operational Research,2007,176(1):374-388.
[12] 林雨秦,吴佩如.物流中心传统存储拣货路径之研究[D].台湾:台湾明新科技大学,2005.12.

[1]	刘晓丽, 杨红. 基于关系契约视角的农户与农产品电子商务企业合作机制演化博弈分析[J]. 运筹与管理, 2021, 30(6): 96-102.
[2]	唐颖峰, 陈世平. 分布式数据流处理系统管理中负载均衡问题建模与求解[J]. 运筹与管理, 2021, 30(4): 155-162.
[3]	刘长石, 王松, 罗亮, 邓胜前. 时变路网条件下联合配送的开放式车辆路径问题[J]. 运筹与管理, 2021, 30(11): 26-33.
[4]	姜明, 李洪心, 刘德海. 基于电子商务B2B平台的个性化定制产品供应链治理结构重复博弈分析[J]. 运筹与管理, 2020, 29(8): 45-51.
[5]	任剑锋, 叶春明, 杨枫. 带时间窗的车间搬运机器人路径优化建模及算法研究[J]. 运筹与管理, 2020, 29(5): 52-60.
[6]	张丽, 王向向, 李佳鑫. 电商生态系统中核心种群间信用机制的动态演化博弈[J]. 运筹与管理, 2020, 29(4): 93-101.
[7]	王洪利. 基于元胞自动机的电子商务平台知识产权监管的演化分析[J]. 运筹与管理, 2020, 29(3): 209-216.
[8]	陈萍, 董文哲, 于信尧. 新能源移动充电车路径优化问题研究[J]. 运筹与管理, 2020, 29(2): 12-18.
[9]	李森彪, 邢文杰. 双边市场下商家和电子商务平台的演化博弈分析[J]. 运筹与管理, 2019, 28(9): 75-84.
[10]	张鹤冰,袭希,白世贞. 基于贝叶斯网络的中国电子商务信用风险因素研究[J]. 运筹与管理, 2019, 28(5): 99-107.
[11]	郭皓月, 樊重俊, 李君昌, 王来, 吴海春, 杨云鹏. 考虑内外因素的电子商务产业与大数据产业协同演化研究[J]. 运筹与管理, 2019, 28(3): 191-199.
[12]	薛星群, 王旭坪, 詹林敏. 电子商务物流最后一公里配送的碳排放研究[J]. 运筹与管理, 2019, 28(12): 118-123.
[13]	张栋, 胡祥培, 黄敏芳. 蔬果类商品网上直销包装作业工序优化模型研究[J]. 运筹与管理, 2019, 28(10): 68-76.
[14]	刘艳秋,徐世达,蔡超. 部分联合运输策略下的物流车辆路径优化问题研究[J]. 运筹与管理, 2018, 27(8): 10-19.
[15]	牟立峰, 王方媛. 基于电子商务平台的服务模式选择研究[J]. 运筹与管理, 2018, 27(7): 184-192.