启发式
计算机科学
产品(数学)
拣选订单
班级(哲学)
仓库
订单(交换)
供应链
星团(航天器)
运筹学
数据挖掘
人工智能
工程类
数学
营销
计算机网络
业务
几何学
财务
作者
Masoud Mirzaei,Nima Zaerpour,René de Koster
标识
DOI:10.1016/j.tre.2020.102207
摘要
Order picking is one of the most demanding activities in many warehouses in terms of capital and labor. In parts-to-picker systems, automated vehicles or cranes bring the parts to a human picker. The storage assignment policy, the assignment of products to the storage locations, influences order picking efficiency. Commonly used storage assignment policies, such as full turnover-based and class-based storage, only consider the frequency at which each product has been requested but ignore information on the frequency at which products are ordered jointly, known as product affinity. Warehouses can use product affinity to make informed decisions and assign multiple correlated products to the same inventory “pod” to reduce retrieval time. Existing affinity-based assignments sequentially cluster products with high affinity and assign the clusters to storage locations. We propose an integrated cluster allocation (ICA) policy to minimize the retrieval time of parts-to-picker systems based on both product turnover and affinity obtained from historical customer orders. We formulate a mathematical model that can solve small instances and develop a greedy construction heuristic for solving large instances. The ICA storage policy can reduce total retrieval time by up to 40% compared to full turnover-based storage and class-based policies. The model is validated using a real warehouse dataset and tested against uncertainties in customer demand and for different travel time models.
科研通智能强力驱动
Strongly Powered by AbleSci AI