基于2-Opt的小型电商仓库拣选路径优化与物流工程应用
2-Opt-Based Order Picking Route Optimization and Logistics Engineering Applications in Small E-Commerce Warehouses
摘要: 针对小型电商仓库人工拣选中路径依赖经验、重复行走和局部折返的问题,从物流工程作业改善与工业工程方法研究的角度,提出基于最近邻与2-opt局部搜索的单订单路径优化方法。在可沿行列方向连续通行的理想网格假设下,将仓库抽象为带权图,以曼哈顿距离构建旅行商问题模型,并以固定行列顺序为基准、枚举最优解为质量参照开展仿真。以6 × 10储位布局、30种商品和100条加权随机订单为算例,固定行列顺序、最近邻及最近邻-2-opt的总距离分别为2132、2026和1920个网格距离单位,后两者相对基准分别降低4.97%和9.94%;最近邻-2-opt与枚举最优总距离1910相比相差0.52%。不同订单规模与10组随机种子分析支持其在所设情景下的稳定性。进一步给出算法伪代码、Excel VBA与Python原型实现方案,以及数据准备、人员分工、试运行和绩效验收步骤。该方法可为小型仓库的拣选路径标准化与物流系统工程改进提供参考,但实际通道适配、工时收益及部署成本仍需现场验证。
Abstract: To address experience-dependent routing, redundant walking, and local backtracking in small e-commerce warehouses, this study develops a single-order routing method combining the nearest-neighbor heuristic with 2-opt local search from the perspective of logistics engineering and industrial engineering method improvement. Under an ideal grid assumption allowing continuous row-wise and column-wise travel, the warehouse is represented as a weighted graph and formulated as a traveling salesman problem using Manhattan distances. A fixed row-column sequence serves as the baseline, and complete enumeration provides the optimal benchmark. For a 6 × 10 layout with 30 products and 100 weighted random orders, the total distances of the baseline, nearest-neighbor, and nearest-neighbor-2-opt methods are 2132, 2026, and 1920 grid-distance units, respectively. The latter two methods reduce distance by 4.97% and 9.94%, while the nearest-neighbor-2-opt result is 0.52% above the enumerated optimum of 1910. Analyses of different order scales and ten random seeds support stability within the simulated scenarios. Algorithm pseudocode, prototype implementation proposals using Excel VBA and Python, and practical steps for data preparation, staffing, pilot operation, and performance acceptance are also provided. The method offers a reference for standardized picking routes and logistics systems improvement, while adaptation to actual aisles, labor-time benefits, and deployment costs require field validation.
文章引用:穆巴来克·阿不都木里克. 基于2-Opt的小型电商仓库拣选路径优化与物流工程应用[J]. 管理科学与工程, 2026, 15(6): 1114-1128. https://doi.org/10.12677/mse.2026.156108

参考文献

[1] Dantzig, G., Fulkerson, R. and Johnson, S. (1954) Solution of a Large-Scale Traveling-Salesman Problem. Journal of the Operations Research Society of America, 2, 393-410.
https://doi.org/10.1287/opre.2.4.393
[2] Croes, G.A. (1958) A Method for Solving Traveling-Salesman Problems. Operations Research, 6, 791-812.
https://doi.org/10.1287/opre.6.6.791
[3] Lin, S. and Kernighan, B.W. (1973) An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research, 21, 498-516.
https://doi.org/10.1287/opre.21.2.498
[4] Laporte, G. (1992) The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms. European Journal of Operational Research, 59, 231-247.
https://doi.org/10.1016/0377-2217(92)90138-y
[5] Ratliff, H.D. and Rosenthal, A.S. (1983) Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem. Operations Research, 31, 507-521.
https://doi.org/10.1287/opre.31.3.507
[6] Hall, R.W. (1993) Distance Approximations for Routing Manual Pickers in a Warehouse. IIE Transactions, 25, 76-87.
https://doi.org/10.1080/07408179308964306
[7] Petersen, C.G. (1997) An Evaluation of Order Picking Routeing Policies. International Journal of Operations & Production Management, 17, 1098-1111.
https://doi.org/10.1108/01443579710177860
[8] Roodbergen, K.J. and de Koster, R. (2001) Routing Order Pickers in a Warehouse with a Middle Aisle. European Journal of Operational Research, 133, 32-43.
https://doi.org/10.1016/s0377-2217(00)00177-6
[9] de Koster, R., Le-Duc, T. and Roodbergen, K.J. (2007) Design and Control of Warehouse Order Picking: A Literature Review. European Journal of Operational Research, 182, 481-501.
https://doi.org/10.1016/j.ejor.2006.07.009
[10] Theys, C., Bräysy, O., Dullaert, W. and Raa, B. (2010) Using a TSP Heuristic for Routing Order Pickers in Warehouses. European Journal of Operational Research, 200, 755-763.
https://doi.org/10.1016/j.ejor.2009.01.036
[11] 朱杰, 周丽, 郭键. 分类存储人工拣选随机服务系统效率研究[J]. 管理科学学报, 2012, 15(2): 59-71.
[12] 陈方宇, 王红卫, 祁超, 等. 考虑多拣货员堵塞的仓库拣选路径算法[J]. 系统工程学报, 2013, 28(5): 581-591.
[13] 王旭坪, 张珺, 易彩玉. B2C电子商务环境下订单拣选与配送联合调度优化[J]. 中国管理科学, 2016, 24(7): 101-109.
[14] 李昆鹏, 刘腾博, 贺冰倩, 等. “货到人”拣选系统中AGV路径规划与调度研究[J]. 中国管理科学, 2022, 30(4): 240-251.
[15] 徐翔斌, 马中强. 基于移动机器人的拣货系统研究进展[J]. 自动化学报, 2022, 48(1): 1-20.
[16] 赵金龙, 蒋忠中, 万明重, 张春征. 考虑配送截止时间的“货到人”订单拣选优化问题研究[J]. 中国管理科学, 2025, 33(3): 239-255.
[17] Grosse, E.H., Glock, C.H., Jaber, M.Y. and Neumann, W.P. (2015) Incorporating Human Factors in Order Picking Planning Models: Framework and Research Opportunities. International Journal of Production Research, 53, 695-717.
https://doi.org/10.1080/00207543.2014.919424
[18] Grosse, E.H., Glock, C.H. and Neumann, W.P. (2017) Human Factors in Order Picking: A Content Analysis of the Literature. International Journal of Production Research, 55, 1260-1276.
https://doi.org/10.1080/00207543.2016.1186296
[19] Miller, C.E., Tucker, A.W. and Zemlin, R.A. (1960) Integer Programming Formulation of Traveling Salesman Problems. Journal of the ACM, 7, 326-329.
https://doi.org/10.1145/321043.321046