Optimization Method Of Picking Routing Problem In The 2-block Warehouse

With the contradiction of professional production and diversiform demand increasingly deeper, distribution and distribution center are more and more the focus of enterprise's attention. Many commercial enterprises, manufacturers and logistics corporations all set themselves distribution center and distribution system so as to reduce logistics cost and improve service level. How to improve distribution's management and operation level has become a urgent problem to solve, while in distribution center, picking being the core operation, it's cost accounts for 40% in all logistics cost. and it's efficiency immediately influence that of the distribution center. It is important to shorten the path length of Picking for improving the operation's efficiency. So we choose the optimization method of picking routing problem in the 2-block warehouse for our study in this paper.Firstly, according to the different characteristic of the picking routing problem in the 2-block warehouse, we divide it into one order one trolleys and one order more trolleys, and optimize for the Picking routing problem in one order one trolleys separately by Heuristic Algorithm, Dynamic Programming, Genetic Algorithm, and comprehensive evaluate of the merits of the three methods in dealing with the issue through examples; the picking routing problem in one order more trolleys is more complex than that in one order one trolleys, and the genetic algorithm have a wide range of features, such as simple, robust, suitable for parallel processing, and applications cover a wide range , so we design the corresponding genetic algorithm to optimize the picking routing problems in one order more trolleys, and achieve it in the platform of Visual C++6.0.