Heuristic Solution of a Location Problem in Order Picking: A case Study
Abstract
In this case study, the Item Assignment Problem in a real-world picker-to-product order picking system is considered. It is shown that the poor order picking efficiency is due to an inappropriate assignment of the items to storage locations. Available solution approaches are difficult to apply because of the special constraints of the system. We solve this computationally difficult problem with Local Search Heuristics, and the results show that order picking efficiency may be significantly improved.
Contents
1. Introduction
2. Order Picking System
3. Problem Statement
4. Solution Approach
5. Computational Results
6. Summary and Outlook
Information: Prof.dr. M.B.M. de Koster, e-mail: rkoster@rsm.nl, Tel. 010-4081719