Research on Picking Route Optimization of Multi-zone Warehouse Based on Traveling Salesman Problem and Simulated Annealing Algorithm

The improvement of the national economy has led to the rapid development of e-commerce business, which has caused an explosive growth of warehouse orders. Picking is the core operation of the warehouse, which occupies a lot of time and capital costs. Therefore, optimizing the picking path has become an urgent problem for e-commerce companies to solve. This article calculates the distance matrix based on the characteristics of multi-zone warehouses, establishes a Traveling Salesman Problem (TSP) model to process 49 combined orders, and solves the model through the simulated annealing algorithm. In addition, add review stations at different locations to analyze the impact on delivery time. Finally, the optimal picking path, the optimal distribution method of orders, and the time it takes to deliver are obtained. The results indicate that the TSP model combined with the simulated annealing algorithm can optimize the picking path, adding a review station close to the center of the warehouse can reduce the time of delivery, and the model is universal applicability.