运筹与管理2024，Vol.33Issue(12)：9-16,8.DOI:10.12005/orms.2024.0380
基于订单拣选规则的配送中心拣选路径优化模型
Picking Rule-based Routing Model for Path Planning in Distribution Center
摘要
Abstract
With the rapid development of the e-commerce and logistics industry,one-stop shopping platforms such as Tmall Supermarket and JD.com have launched delivery services such as the next-day and same-day delivery.In this context,orders from distribution centers exhibit the characteristics of multiple varieties,high frequency,and small batches.However,high frequency and delivery services with deadlines further increase the difficulty of order picking and delivery.In addition,the picker-to-parts system is still the most common application.Most research on order-picking warehouses has focused on picker-to-parts systems.Therefore,it is of great practical significance to study and solve the Single Picker Routing Problem(SPRP)and design an efficient order-picking system. The shortest routing problem of order picking is studied based on the traditional single-block warehouse with parallel aisles.According to the structural layout of the warehouse and the limited access configuration within the aisles,five location-based picking configurations and a"no return picking"feature are proposed.To prevent the calculation of the total distance of the picking path from becoming a major factor affecting the optimization efficiency of the algorithm,the picking distance is divided into two matrices,which respectively represent the horizontal displacement of inter-aisle conversion and the vertical displacement of intra-aisle picking.In addition,to ensure the rationality of the picking route,the picking configuration constraints and the aisles connection mechanism are established according to the problem characteristics.Finally,the classical single-type commodity flow formula is introduced to avoid a subloop.To solve the mixed integer linear programming model,firstly,a pre-processing strategy is presented according to the distribution characteristics of picking configurations in optimal solutions,to reduce the problem size.Furthermore,combining the optimal solution properties of the problem,we add and replace constraints to the problem and propose an improved branch-and-bound method to improve the efficiency of the search. The experimental results show that the Picking Rule-based Routing model(PRR)is feasible and effective,and Improved Picking Rule-based Routing Algorithm(IPRRA)has high efficiency and stability.The further analysis of the research results shows that if there are many aisles and the picking list is small,the distribution of picking locations is relatively dispersed,and the time cost of solving is very high.IPRRA can achieve efficient solutions.Multiple varieties,high frequency,and small batches are the main characteristics of orders in the current e-commerce environment.Therefore,IPRRA has a broad application prospect. It is an inevitable trend for market development to further research order-picking systems by combining planning problems and fully exploiting the interactive potential.In further research,we will combine IPRRA with actual background and data to solve comprehensive problems such as scattered storage,partition picking,and order batching.关键词
订单拣选/路径规划/拣选规则/分支定界法/配送中心Key words
order picking/path planning/picking rule/branch-and-cut algorithms/distribution center分类
管理科学引用本文复制引用
苏艺璇,李铁克,王柏琳..基于订单拣选规则的配送中心拣选路径优化模型[J].运筹与管理,2024,33(12):9-16,8.基金项目
国家自然科学基金资助项目(72301026,71701016) （72301026,71701016）
教育部人文社会科学研究规划基金项目(23YJA630090) （23YJA630090）
