Optimal algorithm of traversing railway yard based on graph searching

Train Location information is important for train control system. As for the train locating using GNSS technology, validation of location data is important. The railway yard has to be traversed several times in data validation process. Computer simulation technology is used to simulate yard-traversing repeatedly for some difficult situations. A new optimal continuous traversal algorithm is proposed in this paper, considering the actual traversing situation and refers to the Depth First Search Algorithm. Simulation results on railway yard shows that the proposed algorithm achieves continuous traversing process with quite high efficiency.