A Study On Routing Scheduling Optimization Of Marshalling Yard

Marshalling yard is a critical node in railway transportation network which mainly handling freight train arrived, classification, assembly starting and other train works. It is an important base of recomposition wagon flow in the railway network. Therefore, there operating efficiency will directly influences the stability and service quality of the whole railroad transportation network. The route scheduling optimization of Marshalling yard was mainly to study the problem that how to establish the right route for the train, shunting locomotive and locomotives at the right time and to solve the conflicts which the routes have the same space-time restrict into the conflict issue. Routing Optimization plays an important part in scheduling operation in marshalling yards, The detention time of wagons can be reduced by selecting and use the reasonable routes, consequently, it can make the operation more efficient.This paper introduce the type of marshalling yard at first, then deeply analysis the work organization of marshalling yard, as well as analysis of traffic operation and switching service clashes and an approach to ease the crossing of routs is put forward. It is also briefly analysis the question of the train occupancy the receiving-departure line’s time a nd illustrate the different route management requirements of different posts and analysis a method to searching routes which be used to generate a arrived field routes. The resulting routes match for the interlocking table, retained the effective routes, t hese works to lay the foundation for the subsequent routing optimization problem.In this paper, in order to assign route for each job effectively, a job should decomposed into several processes at first, then study the route scheduling problem which has multi- type operations and complicated constraints at marshalling yard. This problem is mainly to solve the train and shunting locomotive operations assigned routes will not have the space-time conflict. It is also describes the type of operations conflict and at the case of several operations route conflict can’t be avoided, proposed weight factor based on the operations, higher weight should priority assigned route. The job-shop scheduling concept is be used to describe the schedule operations of route in this paper, a task decomposed into several processes,and a operations of route patter and the route’s time window decision variables are defined, the route optimization scheduling problem with complex constraints is transformed into a route assigned by co mputer which the routes are pre-computed. This paper formulates a math model which satisfies the uniqueness, consistency and compatible constrains and the math model has minimizes a total delay and total travel time. For retain constrains complete, we use the heuristic algorithm and design a detail algorithm procedure and achieve it by computer.At the end of this paper, we use a real data of receiving yard, a stage plan work from 8:00 to 12:00 and the heuristic algorithm, through the computer program to so lve, the result of a realistic data compute by computer show that the math model which we formulate can solve route scheduling problem effectively, and it can give several optimized route scheduling options. The result proves that this model’s solution quality is better than dispatcher’s empirical method, dynamic rolling method for real- time adjustment is more closed to field operations at the uncertainty time, more effective to solve practical problem.