Computing isochrones in multi-modal, schedule-based transport networks

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2008, Pages 515-516

  Bauer, Veronika ^a   Gamper, Johann ^a   Loperfido, Roberto ^b   Profanter, Sylvia ^b   Putzer, Stefan ^b   Timko, Igor ^a  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b Municipality of Bolzano ^*  (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ISOCHRONES; MULTI-MODAL; POINT OF INTEREST; SPATIAL NETWORK; TIME SPAN; TRANSPORT NETWORKS;

INFORMATION SYSTEMS;

GEOGRAPHIC INFORMATION SYSTEMS;

EID: 70449702081     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1463434.1463524     Document Type: Conference Paper

References (10)

1. V. T. de Almeida and R.H. Güting. Using Dijkstra's Algorithm to Incrementally Find the K-Nearest Neighbors in Spatial Network Databases. In Proc. SAC, 2006.
2. E.W.Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1: 269-271, 1959.
3. B. Ding et al. Finding Time-Dependent Shortest Paths over Large Graphs. In Proc. EDBT, pp. 205-215, 2008.
4. R. Huang. A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search. Geoinformatica 11:269-285, 2007.
5. C. S. Jensen et al. Nearest Neighbor Queries in Road Networks. In Proc. ACM GIS, pp.1-8, 2003.
6. E. Kaboulas et al. Finding Fastest Paths on a Road Network with Speed Patterns. In Proc. ICDE, 2006.
7. S. Putzer and G. Lavoriero. Complete eGovernment solution at City of Bozen-Bolzano. 2008 Oracle Spatial User Conference.
8. N. H. M. Wilson and A. Nuzzolo (ed.). Schedule-Based Dynamic Transit Modeling. Kluwer Academic Publishers, 2004.
9. Creaform, Italy. http://www.creaform.com.
10. Oracle Spatial Network Data Model. An Oracle Technical White Paper. http://www.oracle.com/technology/products/spatial/pdf/10gr2- collateral/ spatial-twp-ntwrkdatamod-10gr2-0512.pdf. May 2005.