Best-routing algorithm for public transportation systems

This paper presents a best-routing algorithm for public transportation systems on the basis of analyzing the shortest path algorithm in urban traffic network and the character of transit network. T matrix and Q matrix are introduced to discuss the path-planning problem and the least transfer algorithm is obtained. By using Q matrix the least transfer between two nodes can be determined and the performance of the transit network is evaluated. By integrating the algorithm into shortest path algorithm, a best path in consideration of path length and transfer can be found. Finally, a simple numerical example is given which shows that this algorithm is applied to general transit network especially to a high transfer-cost network.