Study On The Distribution Center Picking Design And Optimization Based On Dynamic Programming

With the development of economic globalization, China has gradually become the centerof the world economy, multinational companies have entered the Chinese market, on the onehand, China needs to change the mode of economic growth structural adjustment, on the otherhand, in order to better communicate with foreign docking industry industrial upgrading,"thethird profit source" of the logistics industry has gradually become the focus of thedevelopment of industry, the development and operation of distribution center play animportant role at the supply chain implementation and management. The order picking designand optimization in the distribution center as the research direction.With personalized customer demand, customer orders render "many variety, small batch"trend, distribution centers are usually divide the storage area and the forward area (fastpicking area), and the use of orders batch picking strategy, so the high frequency of items arestored the fast picking area in order to improve picking efficiency. In this paper, based on thedynamic programming method to determine whether the items stored and assign storagelocations in the fast picking area. And a new algorithm named DSM(Dynamic programmingSaving Method) is submitted which is an improved Saving Method solving orders batchpicking problem.The second chapter analyzes the domestic and foreign relevant research on the contentsof storage strategy and order picking; The third chapter mainly summary the mode ofdistribution center from the picking strategies, picking route etc aspects; The fourth chapterwhether the items stored in the fast picking area, the objective is minimize the total materialhanding costs of order picking and replenishing, and use dynamic programming method tosolve. In the cost analysis of the fast picking area and establish storage quantity optimizationmodel. Based on the fast moving consumer goods to nearest store entrance principle, viatransport model minimizing the storage location assignment model, and give a numericalexample to verify the feasibility of model; The fifth chapter in the study on the basis ofprevious to the order batch picking and vehicle routing problem, a dynamic programmingalgorithm was put forward based on the saving algorithm, solves order batchproblem,combines the saving method standing in for heuristic approach and dynamicprogramming standing in for precise algorithmic, settles the inexactitude problem, also avoidsexpanding of calculation.