The model and algorithm of using shunting engines for railroad technical service station

The key problem of how to make the plan of using yard engines in the process of making operative plans for the station is studied in this paper. That can become decomposition partially ordered set into totally ordered subset by analyzing the characteristics of partially ordered relation construction on partially ordered set. The directed graph or transitive graph is constructed by transitivity of partially ordered set. Then, the problem of using yard engines becomes the problem of directed paths decomposition for directed graph. This problem becomes the matching of the bipartite graph that is constructed after the directed graph and is called the bipartite graph of the directed graph. Finally, the problem of using yard engines is solved with the matching algorithm.