| dc.description.abstract | Nowadays, warehouses are facing more competition challenges about better responsiveness to customer orders. The order picking problems are becoming one of the main issues in warehouses because it is one of the major operations leading to the increase of warehouse costs and travel time. The problem is related to layout design, storage assignment and routing in warehouse. This project merely focuses on routing methods in a warehouse by analyzing and comparing the performance of S-shape, largest gap and combined heuristic. The objective is to minimize the travel distance to complete an order since there is no particular route of picking currently. In order to solve the considered problem, details of each heuristic were mentioned in the thesis and dynamic programming given for selecting the pick locations from available ones. The study was conducted for milk products under a specific warehouse’s context of multiple cross aisles, picker-to-part and random storage policy. Consequently, the combined route provided the best performance.
Keywords: Order picking; Routing method; Dynamic programming; Multiple cross aisles; Random storage policy. | en_US |
