Application of clustering algorithm for storage location assignment problem in synchronized zone order pciking warehouses (Huynh Huu Duc)

 


Tóm tắt: In this thesis, the author tries to prove that in synchronized zone order-picking warehouses, a proper mechanism of storage location assignment can contribute to the improvement rate of order-picking efficiency. In more detail, the more the picking demand of two items is similar, the less the likelihood that these items should be located in the same zone should be so that the idle time between pickers when they simultaneously fulfill the order can be cut down, leading to improvement in the completion time of an order. Therefore, the author tries to develop a suitable k-means clustering algorithm to release lists of items that should be located in different zones as suggestions for warehouse staff to plan for the storage phase, aiming at improving order-picking efficiency





 


Tóm tắt: In this thesis, the author tries to prove that in synchronized zone order-picking warehouses, a proper mechanism of storage location assignment can contribute to the improvement rate of order-picking efficiency. In more detail, the more the picking demand of two items is similar, the less the likelihood that these items should be located in the same zone should be so that the idle time between pickers when they simultaneously fulfill the order can be cut down, leading to improvement in the completion time of an order. Therefore, the author tries to develop a suitable k-means clustering algorithm to release lists of items that should be located in different zones as suggestions for warehouse staff to plan for the storage phase, aiming at improving order-picking efficiency





M_tả
M_tả

Không có nhận xét nào: