动态并行分区拣选系统下订单分批问题研究  

Research on Order Batching Problem under Dynamic Synchronized Zone Picking System

作　　者：胡小林 徐菱[1,2] Hu Xiaolin;Xu Ling(School of Transportation & Logistics, Southwest Jiaotong University, Chengdu 610031;National United Engineering Laboratory of Integrated & Intelligent Transportation, Southwest Jiaotong University, Chengdu 610031, China)

机构地区：[1]西南交通大学交通运输与物流学院,四川成都610031 [2]西南交通大学综合交通运输智能化国家地方联合工程实验室,四川成都610031

出　　处：《物流技术》2019年第5期79-87,共9页Logistics Technology

基　　金：铁路总公司科技研究开发计划项目(2013X009-A-1-2);四川省重点科技计划项目(2014GZ0019

摘　　要：针对B2C电商环境下需求不均衡问题,基于并行分区拣选系统特征,以最小化订单总服务时间为目标,建立了动态并行分区拣选系统下订单分批模型。通过拣选时间、等待时间反映订单履行效率,设计包含订单分批、批次分配与批次分拣的启发式算法求解该问题。通过算例分析得出了综合相似度中拣选截止时间相似度和拣选通道相似度最优参数分别取值为0.6和0.4,通过与其他算法进行对比分析证明了提出的批次分配算法和分拣算法可以缩短订单的等待时间和订单的履行时间,可以有效提高订单履行效率,为B2C电子商务企业的订单履行提供决策支持。In view of the imbalance of demand in the B2C e-commerce environment, based on the characteristics of the synchronized zone picking system and aiming at minimizing the total order service time, an order batching model under dynamic synchronized zone picking system was established. With the order fulfillment efficiency reflected as picking time and waiting time, a heuristic algorithm that included order batching, batch allocation and batch sorting was designed to solve the problem. Through a numerical example, the optimal parameters of the sorting cut- off time similarity and the sorting channel similarity in the synthetic similarity were assigned the value of 0.6 and 0.4 respectively. Through a comparison with other algorithms, it is proved that the batch allocation algorithm and sorting algorithm proposed can shorten the waiting and fulfilling time of the order, and effectively improve the efficiency in order fulfillment.

关 键 词：动态并行分区拣选系统 订单分批 批次分配 批次分拣 启发式算法 

分 类 号：F252[经济管理—国民经济]