Designing Storage Assignment for Distribution Center with Considerations of Congestion and Multi-Exit
|關鍵字:||揀貨作業;儲位配置;多出口;壅塞;資料探勘;關聯法則;Order picking;Storage assignment;Multi-exit;Congestion;Data mining;Association rule|
In recent years, because enterprises launch a series of new products to satisfy the variety of demand of customers, reducing both costs and time-to-market becomes an important role in supply chain management. Due to the rapidly changing preferences of customers, customer orders increasingly exhibit characteristics of higher product variety, smaller order size and reliably shorter response time. Such changes to order patterns challenge the efficiency of distribution center order fulfilment processes in today’s highly competitive market. Although among distribution center’s activities, order picking is the most labour-intensive and time-consuming operation with manual systems, order picking becomes the first thing to increase the effectiveness of distribution center. Although there are many approaches to increase the effectiveness of order picking, storage assignment approach is more influential than any of the other approaches. According to past reference, most studies of correlated storage assignment approaches are considering that products are frequently ordered together should be assigned locations that are close to each, but these approaches ignore the property relations between the products and some real problems which may encounter in order picking. In view of this, this thesis will study the property relations between the products and some problems in real order picking activities. This thesis analyze the property relations between the products by means of association rule of data mining, and construct the “optimal association index of storage assignment”. The “optimal association index of storage assignment” will include weighted support between products, the average distance between location and multi-exit and turnover rate of products. Then this thesis will construct the “optimal model of decision for storage assignment”, based on Binary Integer Programming (BIP), and consider congestion problem which may encounter in order picking. Then this thesis will use the real order data to test simulated samples. The conclusion of the analysis has shown that the objective value in considering congestion constraints is lower than non-considering congestion constraints, which means considering congestion constraints will make product choose farer locations to avoid the frequency of congestion.