The Storage Location Assignment Problem for a Single-Block Warehouse with Product and BOM Information

• Main Authors: Sheng-Po Wang, 王聖博
• Other Authors: Yat-wah Wan
• Format: Others
• Language: zh-TW
• Published: 2019
• Online Access: http://ndltd.ncl.edu.tw/handle/4225ud

碩士 === 國立東華大學 === 運籌管理研究所 === 107 === The literature in warehouse management in the past few decades often identifies the order picking operation consuming considerable amount of human resources and contributing to much cost. With current global development trend, the importance of warehousing has become more urgent. In order to improve the overall efficiency, warehouses usually start with improving the picking operation. There are many ways to improve order picking, such as on picking strategy, order batching, picker routing strategy, item clustering, etc. Sorting items in warehouses is also an important issue, which also interlocks with all the above improvements. This study focuses on comparing two existing methods on inventory management in literature, with our proposed method. With conventional warehouse layout and known products and product structure (BOM information), the study first compares the picking distances of the class-based storage and randomized storage. Then modified from the storage locations of class-based storage and compares with the previous two methods, the study gets the correlated storage. The numerical experiments use JAVA as the programming tool. Results show that the method proposed in this paper is better than previous strategies in some cases. In addition to the improvement of the storage strategy, the company demand and product characteristics in other industries could be more complicated. The main purpose of this study is to compare the methods widely used in the past, and prove the proposed method can be applied in different industries.