Optimization Of Transfer Route In Railway Passenger Transportation Based On Dijkstra Shortest Path Algorithm

The unceasingly developing information technology promotes widespread applications in more fields. In railway passenger traffic, the path optimizing in railway passenger transferring is not only the problem being well concerned the passenger with the rational choice of scheme for traveling, but also the effective approach to improve the railway traffic department's efficiency and quality. The path optimizing in railway passenger transferring is the problem basing on the optimal path algorithm of topology structure in railway transport network. The concerning factors and restrictive conditions of optimal path algorithm whose core thought originates from the classical shortest path algorithm are more complex than the classical shortest path algorithm's, because of having actual application background.To ameliorate Dijkstra algorithm from the two sides of network dimensions and searching technology is brought forward on the base of aggregate analysis of shortest path algorithm. Hierarchical model of railway network , calculation model of passenger transferring, storage data structure of passenger transport network and operating data structure of the shortest path algorithm have been studied linked with the characteristics of railway passenger transport's space distribution, to make the improved calculation algorithm of path of railway passenger transferring come true.The main job is included:①The storage data structure of the algorithm of the shortest path, data structure used in searching node and classified system of the algorithm of the shortest path are introduced, the main thoughts of Dijkstra algorithm is analysed, and the optimizing approach to Dijkstra algorithm is in research.②Study the topology relation of railway network, suggest adopting hierarchical model of two-stage to express a railway network, reduce the quantity of nodes in the searching process, and getting to the target as soon as possible. Resolvent of dynamic base point is brought forward in allusion to the participant path of non-base point.③Analyse and study calculation model of the path of passenger transferring. Submit the expandable calculation model including the information of stations and trains.④Study the storage structure of rail passenger network containing train information, submit the network storage structure adopting adjacency lists of train-station, using the searching result is train-based but not only line-based, and adopting prirority queue to optimize algorithm operating structure, which improves the operation efficiency of algorithm.⑤The 3-tiers architecture is adopted in system framework design, adopting object-oriented technique is proposed to express railway passenger network by using station, train, line, schedule etc., analysis of data-base and calculating flow of path are designed.In this thesis, it has actual and applicable value applying Dijkstra algorithm to the research on path optimizing in railway passenger transferring, suggesting that hierarchical model of railway network and new calculation model of the path of passenger transferring. According to the reality of topology structure in railway transport network, improvement has been carried out on data structure and operating structure in Dijkstra algorithm, which has some referenced value in correlative research, analysis and design of actual system.