Shortest Path Searching for Logistics Based on Simulated Annealing Algorithm

With the rapid development of economy, the logistics industry is growing and the distribution network is becoming more and more complex. The traditional random transportation mode is prone to reverse flow and detour transportation, which leads to low transportation efficiency. In order to solve this problem, this paper proposes a logistics shortest path search algorithm based on simulated annealing. Through the simulation of the experiment, the optimal route can be found in a short time. As a result, the driving distance can be reduced and the distribution speed can be accelerated. Most importantly, the distribution efficiency of SF logistics in Fuzhou can be improved.