A new minimum transfer-oriented solution approach to route optimization problem on public transport networks

In this study, a new algorithm is developed for trip planning problem on public transport networks. The new algorithm named TUR, addresses the problem focusing on the minimum transfer count and optimize a trip using transfer count and arrival time criterions together. In TUR, network is treated not as a graph but with custom-built data structures that specially designed for the algorithm, as in RAPTOR and CSA. Generated solutions using public transit networks of London, İstanbul, Ankara, İzmir and Bursa are compared with real-world applications. The comparison results show that the algorithm has been generated similar solutions to real-world applications. After the solution comparisons, query performance of TUR algorithm is tested and shown that the algorithm is faster about 4 times then algorithms has no pre-computation and uses same optimization criterions. Key Words: TUR, shortest path algorithms, public transport, trip planning