Open Access Open Access  Restricted Access Subscription or Fee Access

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

Hongfei Ding, Shuozhi Liu, Xu Gao

Abstract


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.

Keywords


rail transit, Dijkstra algorithm, shortest path optimization, cohesion programmes.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.