A Study On Optimization Theories And Methods About The Per Iodic Train Work Di Agram Of The Passenger Dedicated Line

The problem of periodic train running map is one of the focus problems. On the basic of referring to the present theories and methods about periodic and non-periodic train timetable home and abroad, the dissertation discusses programming conditions, the characteristics, and models and algorithms on passenger dedicated lines in our country. It mainly researches on the basic optimization theories and methods of passenger dedicated lines in our country from the point of view of mathematic programming and algorithms implementation by computer. The theories and methods mainly have:1In the studies of periodic train timetable, on the basic of sufficiently discussing the present research fruits about periodic and non-periodic train timetable, the dissertation, firstly, researches the kinds of periodic constraint conditions and programming objective functions in the periodic train timetable problem, according to these conditions and objectives, secondly, constructs multi-objective mix integer programming model of periodic train timetable problem, discusses the taking value scopes of periodic changing integers, thirdly, transforms the model into feasible difference problem model whose making decision variables are differences between two any events and cyclic periodic programming whose making decision variables are periodic tension. The transforming uncovers the inherence relatives between three kinds of models from the point of the mathematics views. For the sake of conveniently designing algorithms, the multi-objective model is transformed into single objective model with multi-priorities structure.2In the developing algorithms of periodic train timetable problem, the dissertation proposes the natural procedure of the time-space assigning running lines, namely the procedure of train-section dynamically assigning running lines. By the base of the procedure, aiming at the multi-objective model of periodic train timetable problem, the dissertation designs a heuristic algorithm based on dynamically precedence orders of train-sections. On the other hand, by the same assigning running lines procedure, because of the similarity between job-shop problem and the periodic train timetable problem the dissertation develops a genetic algorithm based on job-shop problem. On the platform of Jingjin passenger train running map system by C++and Access2003, the above two algorithms can both give out satisfying solutions of periodic train timetable problem under the conditions of different train-speeds modes.3In the study of the train-set routing problem, on the basic of the present fruits, the dissertation proposes the multi-objective model about non-periodic train-set routing problem, and transforms it into the single one with multi-priorities structure. Aiming at the model, the dissertation develops a genetic algorithm with checking backtracking procedure. For the case of train periodically running, the dissertation rebuilds the multi-objective model about non-periodic train-set routing problem into the periodic model. Then the checking backtracking based on periodic connecting network is designed, which can simplify the train-set routing problem under the conditions of train periodically running.4The dissertation simply discusses the methods of applying the evaluation methods of the non-periodic train running map for the evaluation methods of periodic one.Since periodic train timetable problem is very complicated, the dissertation applies combination of analogy and analysis methods, uses the modern mathematics building model theories and methods, such as mathematics programming, periodic event scheduling programming, computing theories and algorithm analysis, to deal with the relative researches. Firstly, by the comparing and analyzing the building ideas of periodic and non-periodic train timetable home and abroad, the dissertation constructs the three kinds of models which have different making decision variables about periodic train timetable problem. On the algorithms of periodic train timetable models, by giving out the real time-space assigning running lines procedure about train timetable problem, the heuristic algorithm based on dynamic precedence orders of train-sections is developed. By the analogy method, the genetic algorithm based on job-shop problem is designed. In the process of building the model about train-set routing problem, the dissertation refers to the present qualitative analysis fruits, constructs the two models of periodic and non-periodic train-set routing problem. Considering the characteristics of the two kinds of models themselves, the dissertation targetedly develops the genetic algorithm with checking backtracking procedure and checking backtracking algorithm based on the periodic connecting network. Finally, by the contrast method, the evaluation methods of non-periodic train timetable problem are applied into the periodic one.