Communications of the ACM
Graph Algorithms
A spatiotemporal data model for dynamic transit networks
International Journal of Geographical Information Science
A spatiotemporal data model for dynamic transit networks
International Journal of Geographical Information Science
Computing isochrones in multi-modal, schedule-based transport networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
ROSE: assisting pedestrians to find preferred events and comfortable public transport connections
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
Calculating meeting points for multi user pedestrian navigation systems
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Defining isochrones in multimodal spatial networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
| Hi-index | 0.00 |
The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US.