Study On Optimization Of Route Assignment Problem In High-railway Station

The high-railway station is a working junction terminal and node with station track. The size of the station carrying capacity will determine the railway network flow. Compare the high-railway station with the existing-line passenger station, the high-railway station have advanced technical facilities, modern mode of railway traffic organization and high quality passenger service. On the premise of confirming train diagram, station layout and multiple unit utilization plans, route assignment problem is an optimization study that will improve the station carrying capacity. The route assignment scheme of automation has important significance that will reduce the interference of artificial factors, improve the safety of the station technical working and the station carrying capacity.According to the actual production status of the high-railway station, the paper constructs station network model and multi-objective programming model and it adopt genetic algorithm to design the solving algorithm. The paper is as mainly as follows:(1) Technical working analysis of the high-railway station. Introduce the classification of the high-railway station and technical facilities. The paper analyzes the technical working flow that include original MU, terminal MU, arrived MU, through MU and retraced MU. The paper combed MU take arrival and departure track time and throat time standards.(2) Construct the high-railway station network model. By describing the anchor and node and join node, the paper constructs the high-railway station network model that can depict the station’s topological structure. The paper constructs the information collection of MU occupation that can depict route occupied situation. In the end, according to the Dijkstra algorithm, the paper realizes detailed route collection.(3) Construct multi-objective programming model. By defining the time slice and throat’s time slice, constraint conditions include technical working temporal and spatial constraint, considering the consistency and uniqueness of receiving route and despatching route, route conflict and arrival and departure track constraint, and through MU should be arranged at main track through station. The optimization objectives are balanced utilization of arrival and departure tracks, balanced distribution of buffer time and the shortest distance of passengers.(4) Genetic algorithm is designed to settle the route assignment problem. Route assignment problem is a NP-Hard problem that is very hard to settle through the polynomial algorithm. The paper adopt genetic algorithm to design the solving algorithm. In the aspect of algorithm design, genetic algorithm employs natural number coding. Sub goals are conducted for nondimensionalize method. Computing function values according to the difference of sub goals’ importance. The paper adopts the roulette strategy and save the best individual through the optimal preservation strategy. By applying the idea of time slice, the paper to ensure the feasibility of offspring and improves the algorithm efficiency.(5) Take Jinan Xi as an example for analysis, calculating by Matlab programming, and route assignment scheme is solved. Through the comparative analysis of optimization scheme and the original scheme, the model and algorithm is proved to be effective and feasible.