基于顺序拣选策略的压缩动态虚拟视窗算法  

Compressible dynamic virtual window algorithm based on sequential picking strategy

作　　者：吴颖颖[1] 吴耀华[1] 沈长鹏[1] 

机构地区：[1]山东大学控制科学与工程学院,山东济南250061

出　　处：《山东大学学报（工学版）》2012年第1期66-71,共6页Journal of Shandong University（Engineering Science）

基　　金：国家自然科学基金资助项目(50175064)

摘　　要：为缩短虚拟容器长度、减少订单拣选总时间,改进了拣选设备,提出了压缩动态虚拟视窗算法。该方法为每台拣选机设置一个重力缓存区及挡板,拣选时先将货物弹射至到重力缓存区,在缓存区内压缩货物间距;再把货物从重力缓存区合并至皮带输送机,实现货物的密集排列和虚拟容器长度的缩短。基于货物的顺序拣选策略,建立了压缩动态虚拟视窗算法的数学模型。以某地市卷烟配送中心的3批订单数据为例进行了仿真,结果表明该方法将拣选时间缩短了87.45%～87.77%,并且拣选时间随着拣选机弹射速度和重力缓存区货物合并速度的增加而减少。To shorten the length of the virtual window and reduce the order picking time,the picking device was improved and a compressible dynamic virtual window algorithm was proposed.A gravity buffer and a flashboard were added to each dispenser.The items were launched to the gravity buffer in which the gap between each other was at fiost compressed,and then merged to the conveyor from the gravity buffer.Therefore the items were close to each other on the conveyor and the length of the virtual window was shortened.A model of the compressible dynamic virtual window algorithm was built based on the sequential picking strategy.The simulation with 3 sets of data collected from a tobacco distribution center showed that the picking time could be reduced by 87.45%~87.77%,and the picking time was decreased when the launching time of the dispenser and the merging time of the gravity buffer increased.

关 键 词：虚拟视窗 压缩动态虚拟视窗算法 顺序拣选 自动拣选 拣选时间 

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]