考虑拣选时间最短的多拣货员路径算法研究

Picking path optimization is one of the key issues that need to be resolved during the operation of the picking system. The path planning problem of multiple pickers is also one of the current international research hotspots in this field. Therefore, how to plan the picking path on the basis of avoiding conflicts to improve the picking efficiency is of great significance for practical engineering applications. This paper studies the problem of picking path planning for multiple pickers, and establishes a picking path optimization model with the minimum total order picking time as the goal. A two-stage path planning algorithm is proposed. Firstly, the path is initially selected according to the combined path strategy, and then the conflict path is re-planned. Experimental simulation proves that the proposed routing algorithm can reduce the order picking time while solving the conflict problem.