Research on the Optimal Sorting Path of Intelligent Logistics Warehouse

With the rapid development of China's economy and the wide application of Internet technology, the trend of intelligent development of logistics warehouses is becoming increasingly obvious, and it is particularly prominent to solve the problem of the shortest path of intelligent logistics warehouse robots. This paper proposes Ant colony algorithm, Dijkstra algorithm and $\mathrm{A}^{\star}$ algorithm to analyze the optimization problem of intelligent warehouse sorting path. According to the actual situation of intelligent warehouse sorting, simulation is carried out in three situations, such as the change of the placement position of inventory logistics spare parts and the transformation of the scale of intelligent warehouse, and the advantages and disadvantages of various algorithms in practical applications are compared and analyzed, so as to provide decision-making reference for the selection of intelligent warehouse sorting path optimization methods in different situations.