| 期刊詳細資料 Journal detailed information |
| 作者(Author) | YF Chuang, HT Lee*, YC Lai; * correspoding author |
| 篇名(Article title) | Item-associated cluster assignment model on storage allocation problems |
| 期刊名(Journal name) | Computers & Industrial Engineering |
| 國際期刊(International Journal) | SCI |
| 中文摘要(Abstrct) | |
| ABSTRCT | Warehouse management is currently facing fierce competition. By integrating information systems,
retailers order more frequently with multiple items, but each order has smaller quantities. The situation
becomes more stressful in a disintermediation supply–demand system. A good example is in the Busi-
ness-to-Customer (B2C) online retailing business in which warehouses have to fulfill divergence orders
directly. This study proposes a two-stage Clustering-Assignment Problem Model (CAPM) for the custom-
ized-orders picking problem. For multi-item-small-quantity orders, the CAPM targets a between-item
association rather than the traditional group clustering to reduce the picking distance.
The first stage of CAPM draws item association indices, based on between-item support, from custom-
ers’ orders. It then develops a mathematical programming model to search for the maximum total item
support. The second stage applies assignment techniques to locate the clustered group in the storage
place so as to minimize picking distance. We use Lingo commercial software to help the solution-finding
procedures. By emphasizing the item association, CAPM is suitable for orders with multiple items and
smaller quantities in the modern retailing sector. It also more effectively shortens the picking distance
compared with popular frequency-based and random assignment storage methods. In the example of
the drug distribution center studied herein, CAPM proves more effective as it reduces over 45% of the
picking distances versus the current set-up. |
| 中文關鍵字(Keyword) | |
| KEYWORD | |
| 卷期(Volume No) | 第63卷 |
| 頁數(Page number) | 第1171~1177頁 |
| 年份(Year) | 2012 |
| 語言(Language) | 中文 Chinese |