Optimization of picking in the warehouse

This paper studies the shortest path that the pickers should follow to complete the picking task in the actual e-commerce warehouse. Firstly, the concept of relay point is introduced and the distance model of the pickers in the warehouse is established through multiple Manhattan distances, and the computer simulation method is used to obtain the precise distance of the pickers from the review station to the review station, from the stock keeping unit to the stock keeping unit and from the stock keeping unit to the review station. Then the picking problem of the picker is analogous to the TSP problem, and the shortest path that the picker walks is obtained by improving the results of the genetic algorithm. The sensitivity analysis results show that the model has good stability and prove the reliability of the model.