Research On The Satisfied And Coordinated Strategies For The Dispatch Of Trains Traversed The High-Speed Rail Ways And Existing Rail Ways

With the establishment of the national high-speed railway network, trains operated between high-speed lines and exiting lines satisfies the needs from where they both cover. The differences between their lines and materials bring the different organizations and dispatch manners. For the coordination of trains operations and continuity of trains'connection, the research on the dispatch between high-speed lines and existing ones is followed:1. With the reference of the dispatch manners, the train operation adjustment and the dispatch coordination of high-speed railways and normal lines in China and abroad, the relative research on the passenger flow and its transportation manner is considered to mention the characteristics and the problem of dispatch coordination between the high-speed lines and normal lines.2. Beginning with the relation analyses of the structures, functions and information in the dispatch patterns of high-speed railway and existing railway, a cooperative relationship and its procedures are proposed qualitatively in different cases. Meanwhile, the organization of dispatchers and their technical processes are also analyzed.3. By the concept of Satisfactory Optimization, focused on the dispatch manners of trains traversed the high-speed lines and existing lines, the satisfactory and coordinative optimization theory is proposed. The satisfactory and coordinative optimization problem is determined, as well as the formation of satisfied and coordinative strategies.4. According to the problem, the decision variables, the evaluations and the restraints of satisfaction and coordination of dispatch measures are determined, as well as the objective of the problem. The satisfactory and coordinative optimization model is therefore formed.5. Consulting the operation examples of the Wuhan-Guangzhou high-speed railway, the existing Beijing-Guangzhou railway and their connection, Guangzhou North Station, an example of the problem is proposed. Because of the proposed problem's type, mixed integer programming, an appropriate algorithm, branch and bound algorithm, is determined. Then a satisfied and coordinative strategy is generated by the result, with a discussion of its applicability.