Research On System Developing For Plotting Diagram Of Railway Wagon Flow Shortest Routes And Dividing Stations On Railway Network Into Groups According To Station’s Train Forming Plan

Wagon flow routing is a very important problem of railway transport organization. It canbe used in many railway transportation fields, and is the foundation of railway transportationmanagement. Only the reasonable wagon flow routes are figured out and carried out, can thecore problems for the railway operations management, such as train formation plan makingand train schedule, be solved properly. In this thesis, the methods to store the structure of therailway network，to calculate and store the railway wagon flow routes are studied. On thesebases, the methods to divide the railway network into destination sets for train formation andto store the sets for its applications are also discussed.Firstly, the methods storing the structure of railway network are analyzed. Because theadjacent list occupies much lower storage space in the same situation, and can be used tobetter describe the railway network’s characteristics, it is selected to store the structure ofrailway network. Secondly, the algorithm routing the wagon flows and the method storing thewagon flow routes are also involved in the thesis. The Dijkstra Algorithm, which is one of themost generic, efficient and classic algorithm, is chosen to calculate the shortest routes fromone node to another nodes at the network. Then the shortest routes are stored in databasetables. Furthermore, the index tables for accessing the routes are created to make them beretrieved more easily. Thirdly, the algorithm dividing the railway network into the destinationsets for train formation and the methods storing the sets are studied. The diagram of shortestwagon routes is transferred to a multi-branch tree structure with their leaves connected, andthen the sets are obtained by searching the tree structure thoroughly. The calculating resultscan be stored in a dictionary of station names for the convenience of wagon routesmanagement, and facilitating the users to retrieve or maintain the database. Finally, a casestudy is carried out by developing a program based on the above studies. The results showthat the algorithm mentioned above is accurate and can be used in practice.