The Application of the Items Associated in the Dedicated Location of Storage Assignment

• Main Authors: Shih-Wei Tan, 譚仕偉
• Other Authors: Yi-Fei Chuang
• Format: Others
• Language: zh-TW
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/50002075950925469946

碩士 === 銘傳大學 === 企業管理學系碩士班 === 99 === Recently, some researches (Liu, 1999, 2004; Rosenwein, 1994; Lai, 2010) applied relationship of items associated in storage location assignment problem (SLAP) to improve travel time. These studies emphasize that clustering-assignment problem model (CAPM) can effectively improve picking process if there is correlation between items. Compared with entry-item-quantity (EIQ) analysis, usually using in practice, items associated storage location assignment is more efficient in picking efficiency. However, there were few researches discussing how degree of items associated would influence storage location assignment. This study based on CAPM (Lai, 2010) explores the relationship between degree of items associated and storage location assignment, and compared items associated storage location assignment with EIQ in an attempt to find the order type of CAPM. Following the rule of CAPM, present research developed the program and used exhaustive attack method and simulation to examine the availability and suitability of CAPM. The results list as follows. (1)EIQ is one of the solutions; it means that CAPM is better than or at least equal to the EIQ. (2)Compare with Exhaustive Attack Method, though CAPM is not Global Optimum, it is close to or equal to the global optimum. The difference is only 2% and the result of CAPM is stable. (3)In unobvious clustering, the efficiency improvement is better when lower associate. Compared with EIQ, CAPM improves approximately 5%. Such order format is common for larger total number of items, but fewer and scattered items per order. For example, large retail business. (4)The result of CAPM is better than EIQ in obvious clustering. The highest benefit is increased nearly 20%. Such order format is common for large total number of items, and fewer but centralized items per order. For example, online shopping business. (5)No matter what number of items is, the result of CAPM is better than EIQ or Random Location, and the outcome is also approximate to global optimum. In general, spending time on calculation of CAPM is almost equal with the time of EIQ, but it is far efficient than exhaustive attack method, which makes CAPM more acceptable. Therefore, we could find out that CAPM is the best method of storage location assignment, benefiting from time efficiency and solution quality.