A computational analysis of shortest path algorithms for integrated transit and automobile trip planning
Bradley Casey, Hao Guo, Ashish Bhaskar · Transport Research Forum · 2013
While there are many journey planners in use around the world, the vast majority of them focus solely on optimising trips for the transit network, which is based on routes and timetables, or on optimising trips on the road network for drivers of personal vehicles. By integrating these two networks together into a single journey, the Multimodal Multiobjective Trip Planner (MMTP) in development at the Smart Transport Research Centre (STRC), Queensland University of Technology, can provide more flexibility to users on how they travel to their destination. The primary goal of this paper is to present an analysis of the computational performance of the shortest path algorithms that have been implemented for the MMTP. The algorithms that are used will be outlined, as well as the graph structures that they search. The method for integrating the two networks into a combined trip plan will be discussed. Results will then be presented from tests performed on the Brisbane transit and road networks. This will be followed by an analysis of these results, by comparing the performance of the algorithms for the different categories of journeys that could be experienced by the trip planner in practical use.