Journal Article10.1007/S10707-006-0011-Y
A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search
34
TL;DR: 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 and indicates that the P FS is efficient in computation and database query.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Personalized Mobile City Transport Advisory System
Gytis Tumas,Francesco Ricci +1 more
- 01 Jan 2009
TL;DR: PECITAS has been evaluated with respect to its suitability and efficiency in solving the routing problem showing that it can become a useful tool for city visitors and citizens.
Dynamic Modeling of Transit Operations and Passenger Decisions
Oded Cats
- 01 Jan 2011
TL;DR: In this article, the analysis and evaluation of transit operations and control, in particular in the context of Advanced Public Transport System (APTS), requires the dynamic modeling of the transit system.
Computing isochrones in multi-modal, schedule-based transport networks
Veronika Bauer,Johann Gamper,Roberto Loperfido,Sylvia Profanter,Stefan Putzer,Igor Timko +5 more
- 05 Nov 2008
TL;DR: A solution to compute isochrones in multi-modal, schedule-based transport networks and is implemented in Java on top of the Oracle Spatial Network Model and is deployed at the Municipality of Bolzano-Bozen as a planning instrument.
37
Recommendation of Personalized Routes with Public Transport Connections
Bernd Ludwig,Björn Zenker,Jan Schrader +2 more
- 09 Nov 2009
TL;DR: This paper will propose a h e u-optimal algorithm for incorporating non-monotone multi dimensional user preferences in an A*-like algorithm for route planning in this context and present an assignment of theoretical foundations to real world route planning problems.
32
Scalable computation of isochrones with network expiration
Johann Gamper,Michael H. Böhlen,Markus Innerebner +2 more
- 25 Jun 2012
TL;DR: It is shown that an isochrone does not contain sufficient information to identify expired vertices, and an efficient solution is proposed that counts for each vertex the outgoing edges that have not yet been traversed, which makes the algorithm scalable for large networks and isochrones.
26
References
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Algorithm 97: Shortest path
TL;DR: The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.
4.3K
On a routing problem
TL;DR: Given a set of N cities, with every two linked by a road, and the times required to traverse these roads, the functional equation technique of dynamic programming and approximation in policy space yield an iterative algorithm which converges after at most (N-1) iterations.
A probabilistic multipath traffic assignment model which obviates path enumeration
TL;DR: A probabilistic assignment model that attempts to circumvent path enumeration, in such a way that the resulting effect is identical to what would have been obtained if each path had been assigned trips separately under certain choice probability assumptions.
913
Optimal strategies: A new assignment model for transit networks
Heinz Spiess,Michael Florian +1 more
TL;DR: A model for the transit assignment problem with a fixed set of transit lines is described, formulated as a linear programming problem of a size that increases linearly with the network size that solves the latter problem in polynomial time.
821
Related Papers (5)
Gytis Tumas,Francesco Ricci +1 more
- 01 Jan 2009
Bolin Ding,Jeffrey Xu Yu,Lu Qin +2 more
- 25 Mar 2008