An Optimal Routing Model of High-level Picker-to-part System

摘要

Planning a reasonable order-picking route has been one of the keys to im prove the efficiency of distribution center. Currently research on the optimal path in low-level picker-to-part system has been mature, but don't fit for the high-level sys tem, due to ignore the stacker's vertical running time. The paper builds a new three dimensional TSP programming model to overcome the problem, and design the cor responding genetic algorithm to solve the model. In addition, the paper compares the new model and algorithm with the two traditional methods named transversal strat egy and s-shape strategy, by a same numeric example. The comparison result shows that the new method is efficient either in the picking time saved or in the picking path shortened.