Applying iterated greedy algorithm for order batching in a multiple-level warehouse

• Main Authors: Bo-jia Su, 蘇柏嘉
• Other Authors: 應國卿
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/v4ms62

碩士 === 國立臺北科技大學 === 工業工程與管理系碩士班 === 100 === The past research pointed out that manual picking system is a type of intensive labor work in storage center. The cost of manual picking is about 35-40% of the total operating cost in the storage center. Therefore, to enhance artificial picking efficiency will be the primary issue for the enterprise. According to the research of order picking, the object of the warehousing system is for a single floor order picking problem, but few researches explore the multi-floor of warehouse order picking. In multi-floor of warehouse order picking, it has not been found that scholars use the order batching to shorten the overall procedure of order picking. This research provided two kinds of Iterated Greedy Algorithm (IG) to solve the problem, and verify the solution of efficiency from the proposed IG. This research applied to Genetic Algorithms (GA) which was proposed by the scholars in the past, and expended to multi-floor storage problems. And the experimental results are compared, which shows that Iterative Greedy Algorithm can obtain the better solution performance in multi-floor warehouse order picking, and it provides enterprise’s order batching of practical use as a reference for subsequent academic research.