Optimization of Cold Chain Path forS company of C city based on Dijkstra's Algorithm

Abstract

With regard to the existing transportation means and distribution routes of S company of C city, this paper analyzes them in terms of theoretical optimization and practical significance, aiming to reduce the cost of cold chain transportation. To this end, we determined the objective function of cold chain route optimization forS company of C city. Then, Dijkstra's algorithm is used to solve the cold chain routes. Combined with the example analysis results show that the optimization results based on Dijkstra's algorithm are reasonable and reliable. In this paper, based on the location information of S C city's stores and transit centers, as well as various data of distribution, respectively, the path optimization is carried out to ultimately achieve cost reduction and efficiency. Compared with the data of the original distribution method, both the use of transportation tools, distribution distance, and the problem of high empty rate have been improved.