Research On The Method Of Compilation And Real-time Adjustment Of Train Technical Operation Plan Of Railway Station

This article mainly studies the optimization of the technical operation plan of the railway passenger station and the real-time adjustment when there are delays or failures of station equipment and facilities due to various factors.The optimization of technical operation plan is mainly aimed at the operation conflict of different trains.Without adding or deleting trains and changing station equipment and facilities,the solution to the operation conflict of trains can be mainly solved in both time and space.Therefore,this paper proposes different models and algorithms from the two aspects of time sparsity and space sparsity,but the simple time sparsity and space sparsity cannot solve all problems,and the two must be combined to carry out space-time sparsity on the train in order to truly solve the feasible Technical work plan.The problem of real-time adjustment of the technical operation plan of the train is to re-program the delay and equipment failure of the train on the existing operation plan to meet the needs of the current actual situation.For the preparation of train technical operation plan,this article mainly starts from the time and space resolution of train operation conflict.To solve the time conflict of train conflicts,this paper establishes an alternative graph model,which takes the shortest train operation time and the largest choice of train routing and arrival and departure as the objective function,and takes the time continuity relationship of train operations,arrival and departure and arrival at the same time as the objective function The unique occupancy of roads and departure routes,the consistency of the selection of arrival and departure routes,the operating time constraints of trains,the uniqueness of the occupancy of arrival and departure routes of trains,etc.,establish alternative graph models for constraints.,Generally use branch and bound algorithm to solve.Aiming at the spatial unraveling of the train conflict problem,a search tree for spatial unraveling is established by graph theory,and the search algorithm is established based on the idea of depth-first search algorithm to solve the search tree.Finally,the time-spatial solution and the spatial sparing solution are combined to establish a complete spatiotemporal sparing solution model.The search algorithm based on the depth-first thought is used to solve the problem of train technical operation plan compilation.Regarding the real-time adjustment of the train technical operation plan,this article focuses on the adjustment of the operation plan when the train is late and the equipment fails.There is no need to completely recalculate the operation plan of all trains.This is obviously unreasonable and the solution speed cannot meet the real-time performance.Therefore,in this case,this paper reconstructs the solution space,optimizes the solution steps,and then only solves the train operation plan for a period of time or a certain number of trains after the current time.This paper generally uses the last half hour or 15 trains at the current time as the interval.Then determine whether to use the initial feasible solution to reduce the solution time,and finally obtain the technical operation plan after the train is adjusted in real time.Finally,this paper uses C # programming to implement the train technical operation plan preparation and adjustment algorithm,and verifies the feasibility,correctness and timeliness of the algorithm through an example.