Optimization on Route Computation Algorithm Based on Train-Route Restriction

Because there is the inconsistency between the pass ticket routes provided by the current ticketing and reservation system and the real traveling routes being got by passengers,this paper,firstly according to the background of rail pass and combining the analysis about current route-computation model,presents a new method which is based on train-route restriction to design pass route algorithm.This new method takes hierarchical storage structure as its storage strategy,which fulfills the distributed storage about the share routes and the private routes to effectively compress the storage space and improve route selection efficiency.The method takes station-train adjacency list as its basic data structure and rebuilds the rail-net with the restriction of train routes,to make the got-route data validity and rationality.The route algorithm is designed as two steps computation: the special-route computation step and the common-route computation step,which is instead of the wholly K-shortest-path route computation,in order to improve the algorithm.So it radically solves the conflict between pass-ticket route and train route,and implements the optimization on route computation.