目的 针对B2C电商分散存储策略下的订单拣选问题,研究同一SKU（库存量单位）在多个存储货位下的拣选优化方法,以缩短拣选路径、提高仓库的作业效率。方法 将分散存储策略下的储位选择与路径规划问题拆解为两阶段求解,提出最小增量-局部贪婪算法（MILG）进行储位选择,结合离散粒子群优化算法（PSO）完成路径规划。针对实际拣选的动态需求,引入质心法对储位选择机制进行优化,形成改进的两阶段拣选算法（MILG*-PSO）。结果 改进算法在不同分散存储策略下均提升了拣选效率,路径长度的平均改进率能够达到10.64%,最大的改进率为20.75%。结论 该方法在“人到货”作业场景下优势显著,能够有效缓解电商大促期间包装复核环节的“供货断流”问题,提升了仓储包装作业链的整体履约时效。
Abstract
The work aims to investigate the picking optimization methods of the same stock keep unit (SKU) under multiple storage locations to shorten picking paths and improve warehouse operational efficiency, so as to address the order picking problem under a scattered storage strategy in B2C e-commerce. The storage location selection and path planning problem under a scattered storage strategy were decomposed into a two-stage solution. A minimum increment-local greedy (MILG) algorithm was proposed for storage selection, combined with a discrete particle swarm optimization (PSO) algorithm for path planning. To address the dynamic demands of actual picking, a centroid method was introduced to optimize the storage selection mechanism, forming an improved two-stage picking algorithm (MILG*-PSO). Experimental results showed that the improved algorithm enhanced picking efficiency under various scattered storage strategies, with an average improvement rate in path length of up to 10.64% and a maximum improvement rate of 20.75%. This method demonstrates significant advantages in a "Person-to-Goods" operational scenario, effectively alleviating the "supply interruption" issue in the packaging and checking process during major e-commerce promotions, thereby improving the overall fulfillment timeliness of the warehouse packaging operation chain.
关键词
分散存储 /
储位选择 /
订单拣选 /
最小增量-局部贪婪算法 /
粒子群优化
Key words
scattered storage /
storage location selection /
order picking /
minimum increment-local greedy algorithm /
particle swarm optimization
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}
参考文献
[1] 商务部电子商务和信息化司. 2025年1—11月我国电子商务发展情况[EB/OL]. (2025-12-19)[2025-12-25]. https://ciecc.ec.com.cn/swyj/yjdt/2025/12/63e292ce7193438aa46edf6f324a8aa0204.html.
Department of Electronic Commerce and Information. Development of E-Commerce in China from January to November2025[EB/OL]. (2025-12-19)[2025-12-25]. https://ciecc.ec.com.cn/swyj/yjdt/2025/12/63e292ce7193438aa46edf6f324a8aa0204.html.
[2] 商务部, 国家邮政局. 关于深入推进电子商务与快递物流协同发展工作的通知[EB/OL]. (2020-04-14)[2025-12-25]. https://www.gov.cn/zhengce/zhengceku/2020-04/21/content_5504735.htm.
Ministry of Commerce of the People's Republic of China, People's Republic of China State Post Bureau. Notice on Further Promoting the Coordinated Development of E-Commerce and Express Logistics[EB/OL]. (2020-04-14)[2025-12-25]. https://www.gov.cn/zhengce/zhengceku/2020-04/21/content_5504735.htm.
[3] ZHONG S Y, GIANNIKAS V, MERINO J, et al.Evaluating the Benefits of Picking and Packing Planning Integration in E-Commerce Warehouses[J]. European Journal of Operational Research, 2022, 301(1): 67-81.
[4] CHEN R, YANG J J, YU Y G.Integrated Scattered Storage and Picker Routing in Picker-to-Parts Warehouses[J]. European Journal of Operational Research, 2026, 329(3): 808-824.
[5] LIU M Y, POH K L.E-Commerce Warehousing: An Efficient Scattered Storage Assignment Algorithm with Bulky Locations[J]. Computers & Industrial Engineering, 2023, 181: 109236.
[6] VAN GILS T, RAMAEKERS K, CARIS A, et al.Designing Efficient Order Picking Systems by Combining Planning Problems: State-of-the-Art Classification and Review[J]. European Journal of Operational Research, 2018, 267(1): 1-15.
[7] 徐翔斌, 李秀. 固定路径下多阶段货位调整研究[J]. 工业工程与管理, 2017, 22(5): 24-31.
XU X B, LI X.Research on Route-Based Multi-Staged Storage Location Adjustment[J]. Industrial Engineering and Management, 2017, 22(5): 24-31.
[8] GIALOS A, ZEIMPEKIS V.A State-of-the-Art Classification and Review of Parameters that Affect the Design, Control, and Operating Strategies of Order-Picking Systems[J]. Operational Research, 2024, 24(1): 6.
[9] WEIDINGER F, BOYSEN N.Scattered Storage: How to Distribute Stock Keeping Units all around a Mixed-Shelves Warehouse[J]. Transportation Science, 2018, 52(6): 1412-1427.
[10] 李建斌, 蒙铭友, 戴宾. 电子商务环境下的存储策略优化研究: 固定存储还是分类随机存储[J]. 中国管理科学, 2021, 29(8): 67-80.
LI J B, MENG M Y, DAI B.A Study on Storage Policy Optimization: Dedicated Storage vs Class-Based Random Storage[J]. Chinese Journal of Management Science, 2021, 29(8): 67-80.
[11] DE KOSTER R, LE-DUC T, ROODBERGEN K J.Design and Control of Warehouse Order Picking: A Literature Review[J]. European Journal of Operational Research, 2007, 182(2): 481-501.
[12] BOYSEN N, DE KOSTER R, WEIDINGER F.Warehousing in the E-Commerce Era: A Survey[J]. European Journal of Operational Research, 2019, 277(2): 396-411.
[13] VANHEUSDEN S, VAN GILS T, RAMAEKERS K, et al.Practical Factors in Order Picking Planning: State-of-the-Art Classification and Review[J]. International Journal of Production Research, 2023, 61(6): 2032-2056.
[14] HEßLER K, IRNICH S. Exact Solution of the Single-Picker Routing Problem with Scattered Storage[J]. INFORMS Journal on Computing, 2024, 36(6): 1417-1435.
[15] CHENG C Y, CHEN Y Y, CHEN T L, et al.Using a Hybrid Approach Based on the Particle Swarm Optimization and Ant Colony Optimization to Solve a Joint Order Batching and Picker Routing Problem[J]. International Journal of Production Economics, 2015, 170: 805-814.
[16] BRIANT O, CAMBAZARD H, CATTARUZZA D, et al.An Efficient and General Approach for the Joint Order Batching and Picker Routing Problem[J]. European Journal of Operational Research, 2020, 285(2): 497-512.
[17] YANG P, ZHAO Z J, GUO H J.Order Batch Picking Optimization under Different Storage Scenarios for E-Commerce Warehouses[J]. Transportation Research Part E: Logistics and Transportation Review, 2020, 136: 101897.
[18] BOCK S, BOYSEN N.Routing Replenishment Workers: The Prize Collecting Traveling Salesman Problem in Scattered Storage Warehouses[J]. INFORMS Journal on Computing, 2023, 36(1): 3-20.
[19] HAOUASSI M, KERGOSIEN Y, MENDOZA J E, et al.The Picker Routing Problem in Mixed-Shelves, Multi-Block Warehouses[J]. International Journal of Production Research, 2025, 63(4): 1304-1325.
[20] JIANG W, LIU J Y, DONG Y, et al.Assignment of Duplicate Storage Locations in Distribution Centres to Minimise Walking Distance in Order Picking[J]. International Journal of Production Research, 2021, 59(15): 4457-4471.
[21] 姜伟, 徐贝灵, 王天文. B2C配送中心分散存储优化问题研究[J]. 系统科学与数学, 2021, 41(11): 3170-3180.
JIANG W, XU B L, WANG T W.Study on Scattered Storage Optimization Problems of B2C Distribution Centers[J]. Journal of Systems Science and Mathematical Sciences, 2021, 41(11): 3170-3180.
[22] SHI Y H, EBERHART R C.Parameter Selection in Particle Swarm Optimization[C]//Evolutionary Programming VII. Berlin: Springer, 1998.
[23] CLERC M, KENNEDY J.The Particle Swarm-Explosion, Stability, and Convergence in a Multidimensional Complex Space[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(1): 58-73.
基金
国家自然科学基金（72101234）; 浙江省自然科学基金（LY21G010005）
PDF(2326 KB)
渝公网安备 50010702501716号 渝ICP备15012534号-2
