Shortest Path Optimization of the Dijkstra Algorithm on the Rail Transit Cohesion Planning

In this thesis, the relationship between rail transport and the conventional rail is as the starting point, and the shortest path optimization solution of the rail transit cohesion is proposed using the prediction model of the related passage flow. On the basis of the existing shortest path algorithm, the classic Dijkstra shortest path algorithm is appropriately optimized, and the multiple T label and P label are creatively introduced to respectively solve the issue of the K shortest path and the shortest path of the steering sections, which are more adapted to the cohesion optimization of the rail transport and provide the scientific theory basis and the effective solution for the coordinated development of the rail transport and the way track traffic and the traffic transfer of the bus.