Research on Picking Route Optimization Based on Simulated Annealing Algorithm

Abstract

This paper aims to optimize the low efficiency of picking operations in the distribution center at present stage, and to study the problem of outbound picking routes in the same-end in-out automated warehouse. Aiming at the traditional NP difficult-to-solve algorithm, in order to solve the limitations of the accuracy and scale of the existing algorithm, this paper takes a certain outbound task of the Baidie distribution center as an example, which uses the simulated annealing algorithm to optimize the picking path. In addition, the optimization results are compared with the results of the nearest-neighbor heuristic and the nearest-insertion heuristic. The results show that, compared with the nearest-neighbor heuristic and the nearest-insertion heuristic, the path distance of the algorithm designed in this paper is reduced by 25% and 16.67% respectively, which has a significant improvement.