1, Regarding the route search in railway station computer interlocking, this paper puts forward an algorithm of route generation and search based on yard data structure.

2, In route search, I make use of the binary tree to simplify the procedure.

3, According as the search strategy, the arithmetic of route search is written in detail.

4, So the whole system is composed of three parts: IP discovery, route search and data exchange.

5, Based on confirming the data structure of object nodes, it presents the procedure of route search.

6, Moreover, some in-depth work on the solution of optimal route search has been done.

7, Thus we improved the WebGPS's reusing function. Meanwhile,(http:///route search.html) the thesis discussed the best route search of the electronic map and realized the best route search of the electronic map.

8, For multi constraints cases, it can process the problem of optimal restoration route search for different purpose in the cases of various failure conditions.

9, Using a three-dimensional Path planning method based on vector data, and combing the moving of the target with the process of route search, the novel algorithm can react to the move of the target.

10, Propose three main functional requirements of the system:finished route planning function, self-help planning function and finished route search function.