Research On Optimization Of Picking Path Considering Path Conflict

With the development of the economy and the Internet,the number of customer orders has increased dramatically and the variety is varied.In order to reduce logistics costs and improve service quality,to deliver goods to customers quickly and efficiently,the distribution center needs to optimize its operation process.The order picking operation is the highest labor cost part of the distribution center.Therefore,formulating a reasonable order picking operation solution can not only improve the order picking efficiency,but also improve the order punctuality.However,most current studies on order picking operations ignore the path conflicts among pickers,and the optimization goals of order picking operations are relatively single.Therefore,this paper focuses on the problem of picking path optimization considering path conflicts,establishes an optimization model which is suitable for the actual situation and solves it,which is of great importance and practical significance for guiding the order picking operation of the distribution center.The main content includes the following aspects:First,for the problem of order picking path optimization considering path conflicts,this paper establishes a picking path optimization model to minimize the order delay time,and proposes a two-stage routing method based on combined routing method.First,the path is planned according to the combined routing method,and then the path conflicts are identified and resolved according to the priority of the picker.Then,for the problem of batch order picking path optimization considering path conflicts,this paper establishes a picking path optimization model to minimize order delay time.For the lack of path conflicts between pickers in existing algorithms,this paper improves the existing algorithm from the three aspects of initial solution,search ability and routing method,and proposes an improved variable neighborhood descent algorithm based on two-stage routing method.Then,for the problem of batch order picking path optimization in which order delivery time is a time window,this paper establishes a picking path optimization model that minimizes the weighted sum of order picking time,delay time,and lead time,and proposes estimation of distribution algorithm based on two-stage routing method.The final experimental results show that the model and algorithm proposed in this paper are better at different warehouse sizes and order sizes,and can effectively solve the problem of picking path optimization considering path conflict.Finally,this paper designs an order picking system that considers path conflicts,and combines the proposed model algorithm with the actual order picking system to show the application of the research results of this paper in the actual production environment.