Optimization of Multi-Supplier Collaborative Transportation Based on K-Shortest Path Algorithm

Abstract

With the wide application of big data and artificial intelligence technology in road traffic, road planning makes logistics and transportation services more efficient. For the supplier's transportation service problem, a multi-supplier collaborative transportation strategy is designed in this paper. First, we establish a model to minimize the transportation cost, then we simulate a path diagram and calculate the optimal transportation paths of suppliers based on Dijkstra's algorithm. In addition, we obtain multiple alternative paths with K-shortest path algorithm. Finally, simulations of collaborative transportation for suppliers are performed in three scenarios and the results are used to prove the effectiveness of the proposed collaborative transportation strategy. This strategy not only can strengthen the synergistic cooperation among suppliers, but also cultivate the potential customer. Furthermore, it also could improve the flexibility of the supply chain, maximize the overall efficiency and provide a new solution for the development of logistics and transportation services.

Fast assessment method of power outage risks caused by extreme cold disasters based on probabilistic graph model

“…Ref. [13] used the Dijkstra algorithm to find K shortest paths for each node and then calculated the path failure probability to approximately evaluate the outage probability of each node instead of using MC sampling. There are two main problems in load risk inference.…”