High Performance Computing Simulation of Intelligent Logistics Management Based on Shortest Path Algorithm

Abstract

At present, e-commerce drives the logistics industry to develop greatly, but at the same time, there is a huge demand in this field, such as lower cost and higher efficiency. Facing the needs of logistics management development, it needs the blessing of intelligent technology, which involves countless fields at present. Intelligent logistics management has become a hot spot at present. What needs to be solved in this respect is how to shorten the transportation distance and save costs. To solve this problem, this paper proposes to introduce the shortest path algorithm. This paper compares the Dijkstra algorithm with the A ∗ algorithm under the background of logistics management and finds that the latter is more suitable for this field with huge amount of information. In order to improve the performance of the A ∗ algorithm, this paper introduces ant colony algorithm, which can better avoid obstacles. Combining these two algorithms, a ∗ -ant colony algorithm is obtained. The algorithm absorbs the advantages of the two algorithms, while maintaining high efficiency and good stability. These characteristics are very satisfying in the field of logistics management. Through the performance test and simulation experiment, it is concluded that the algorithm has excellent optimization ability and can reduce the cost for this field.