A optimal method of routing orderpickers in distribution centers using dynamic programming

The orderpicking process is the most laborious of all warehouse processes, so it is important to increase picking efficiency in distribution centers. Optimal routing of orderpickers is one way of increasing picking efficiency. In this paper dynamic programming is used to find the routing of orderpickers. The method is a new approach to find the optimal routing of orderpickers. The distance of travel can be reduced using different rules for selecting the picking bill cards and process.