Graph Traversal-based Solutions for Trip Planning in Public Transportation Graph

The public transportation graph facilitates efficient trip planning considering various passenger requests such as distance, waiting time, travel time, self-transportation, and number of transfers. This paper proposes an approach to normalize the edge weight in the public transportation graph and presents examples of graph traversal-based solutions to solve trip planning problems in public transportation. The proposed solutions are implemented and tested on the synthetic data to show the improvements and apply the algorithms.