Trip Timing Algorithm for GTFS Data with Redis Model to Improve the Performance

Accessing public transport plays an essential role in the daily life productivity of people in urban regions. therefore, it is necessary to represent the spatiotemporal diversity of transit services to evaluate public transit accessibility appropriately. that can be accomplished by determining the shortest path or shortest travel time trip plan. many applications like arcgis provide tools to estimate the trip time using gtfs data. they can perform well in finding travel time. still, they can be computationally inefficient and impractical with increasing the data dimensions like searching all day time or in case of huge data. some research proposed recently provides more computationally efficient algorithms to solve the problem. this paper presents a new algorithm to find the timing information for a trip plan between two start and destination points. also, we introduce rmh (range mapping hash) as a new approach using redis nosql to find and calculate the accessibility of a trip plan with fixed time complexity of o(2) regardless of the city size (gtfs size). we experimented with the performance of this approach and compared it with the traditional run-time algorithm using gtfs data of debrecen and budapest. this redis model can be applied to similar problems where input can be divided into ranges with the same output.