首页|一种适用于平面智能仓库改造的PBS系统研究

一种适用于平面智能仓库改造的PBS系统研究

扫码查看
针对传统平面库房空间利用率低下、自动立体仓库(AS/RS)改造成本高等问题,研究了适用于平面仓库改造的基于拼图的存储系统(puzzle-based storage system,PBS系统),在保证拣选效率的同时最大限度地提高仓库空间利用率.针对PBS系统检索过程复杂的问题特征,提出一种基于有用点的对角线最优拣货路径算法.该算法根据货物所在位置使用有用点移动策略提高计算效率,以减少系统拣货移动次数、缩短作业时间.研究结果表明,该方法可以在毫秒级别实现单货物、单空位、任意货位的最短时间取货.通过对比其他算法,发现该算法在求解效率的优越性和拣选步数最优的稳定性方面具有明显优势.通过分析实际应用案例,验证了基于PBS系统改造后的平面库房空间利用率上涨100%,具有实际应用价值.
Study on Puzzle-Based Storage System for the Transformation of Plane Smart Warehouses
In response to low space utilization in traditional plane warehouses and the high costs associated with converting them into automated storage and retrieval systems(AS/RS),a study is conducted on a puzzle-based storage system(PBS system)suitable for the transformation of plane warehouses.This system aims to maximize warehouse space utilization while ensuring high picking efficiency.To address the complexity of the retrieval process inherent in a PBS system,an algorithm for diagonal optimal picking paths based on useful points is proposed.This algorithm utilize a useful point movement strategy according to the locations of goods to enhance computational efficiency,thereby reducing the number of picking movements and the operation time.Results indicate that the proposed method can achieve the shortest picking time for single items,single empty slots,and any storage location within milliseconds.Comparative analysis with other algorithms reveals that the proposed algorithm has significant advantages in terms of solution efficiency and stability of the optimal number of picking steps.Analysis of actual application cases confirms that the space utilization of plane warehouses increases by 100%after transformation based on PBS systems,demonstrating its practical value.

puzzle-based storage(PBS)systemdiagonal algorithmretrieval timepicking path planning

于丽娜、蔡卓杰、林洁、于靖

展开 >

深圳技术大学 城市交通与物流学院,广东 深圳 518118

北明软件有限公司,北京 100043

PBS系统 对角线算法 取货时间 拣货路径规划

国家自然科学基金青年基金深圳技术大学自制实验仪器设备资助项目

71901154JSZZ202301016

2024

工业工程
广东工业大学

工业工程

CSTPCDCHSSCD
影响因子:0.691
ISSN:1007-7375
年,卷(期):2024.27(4)