关键词: 拣货作业, 双区型仓库, 路径规划, 启发式算法

Abstract:

Aiming at the problems of low efficiency and high cost of warehouse picking operations, the scheduling theory and heuristic algorithms are adapted. Firstly, it analyzes the problems existing in JD’s typical two-block warehouse, and considers the order distribution under the two picking methods. Then the triple method α/β/γ is used to describe the problem of picking path planning, to establish the picking path planning model to minimize the total path, and to design the S-type heuristic algorithm and genetic algorithm suitable for model matching. Finally, the simulation of the example is carried out, and the simulation results of the two picking methods are compared and analyzed. The results show that the combination of the order batching strategy with the path planning under the genetic algorithm can obtain a more reasonable picking operation plan.

Key words: warehouse picking operations, two-block warehouse, picking path planning, heuristic algorithm