Research On Order Picking Model Of Book Industry

Picking operation is the most consumed manpower and resources in the process of book industry distribution.At the same time,the demand of the book orders tend to be small batches and diversification,which makes the order picking problem become more and more complicated.Therefore,The research of order picking mode for the book industry is imperative.It is shown by researches and practices that layout design,storage assignment,zoning picking,order batching and routing,in a certain extent,affect the work efficiency of order picking.The purpose of this paper is to study the order picking mode by order batching and path planning,in order to shorten the time of order picking,and to improve the efficiency of order picking operation.Order batching is the partial processing of orders through a certain strategy;path planning is the choice of the appropriate picking path,to minimize the walking distance and cost of picking.On the basis of reasonable assumptions,we set up an order batching model with vehicle capacity as the limit and the minimum distance as the objective function and give the calculation formula of the improved S path strategy,through the traditional first com first serviced,saving algorithm and the design of genetic algorithm to solve the order batching model.The shortest path of the order batching problem is obtained under the crossing strategy,and to a certain extent,affect the result of the shortest path.In this paper,we establish a path planning model based on minimizing the walking distance of the order by using the order batching data as input.The path planning model is a NP-hard problem,the paper continues to use genetic algorithm to solve the problem.Through a case study,the order batching is always better than not partial order,even using the most simple first com first served strategy,the overall picking path is also shorter than the single picking;comparing three strategies:first com first serviced,saving algorithm and improved genetic algorithm,genetic algorithm is always better than the other two algorithms;Path planning after batching order has a positive impact to shorten walking distance and improve the picking efficiency.The use of genetic algorithm in batches,and on this basis using tabu search algorithm to carry out regulatory planning,walking distance is the shortest.