Research On The Transfer Plan Of K Optimal Path Based On A* Algorithm Of Multi Object And Constrained Conditions

With the development of the national passenger dedicated line and high-speed railway engineering, Beijing-Guangzhou, Beijing-Shangha, Harbin-Dalian high-speed railway line built and put into operation in succession, China’s high-speed rail network has taken shape. How to more fully utilize the railway passenger capacity, improve attendance and train operating income has become an important issue to be solved for railway passenger transport sector. It is imperative to develop a transfer subsystem for ticketing system, which can solve the existing problems between the two stations which can’t be reached or no ticket to reach, and maximize passenger revenue, improve rail service quality. It helps railway gain more and to improve service quality.Railway passenger transfer model is the shortest path algorithm problems which based on passenger transport network topology, it has a complex background of practical application. Firstly, this paper compared the principle and performance of classical shortest path algorithm. Secondly it combined the characteristics of railway passenger transport network to establish a hierarchical road-network model. Research the key technologies of transfer calculated model, the shortest path algor ithm data structure and storage architecture of passenger transport network. A * algorithm is proposed to optimize the size of the network in three areas, heuristic function, data structure processing.This paper presents three methods to optimize the A * algorithm by reduce the size of the network, constructed heuristic function and optimized data structures, model has practical value.