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

ABSTRACT

Isochrones are defined as the set of all points from which a specific point of interest is reachable within a given time span. This demo paper presents a solution to compute isochrones in multi-modal, schedule-based transport networks. The system 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.

REFERENCES

• 1: Victor Teixeira de Almeida , Ralf Hartmut Güting, Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases, Proceedings of the 2006 ACM symposium on Applied computing, April 23-27, 2006, Dijon, France [doi>10.1145/1141277.1141291]
• 2: E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1: 269--271, 1959.
• 3: Bolin Ding , Jeffrey Xu Yu , Lu Qin, Finding time-dependent shortest paths over large graphs, Proceedings of the 11th international conference on Extending database technology: Advances in database technology, March 25-29, 2008, Nantes, France [doi>10.1145/1353343.1353371]
• 4: Ruihong Huang, A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search, Geoinformatica, v.11 n.2, p.269-285, June 2007 [doi>10.1007/s10707-006-0011-y]
• 5: Christian S. Jensen , Jan Kolářvr , Torben Bach Pedersen , Igor Timko, Nearest neighbor queries in road networks, Proceedings of the 11th ACM international symposium on Advances in geographic information systems, p.1-8, November 07-08, 2003, New Orleans, Louisiana, USA [doi>10.1145/956676.956677]
• 6: Evangelos Kanoulas , Yang Du , Tian Xia , Donghui Zhang, Finding Fastest Paths on A Road Network with Speed Patterns, Proceedings of the 22nd International Conference on Data Engineering, p.10, April 03-07, 2006 [doi>10.1109/ICDE.2006.71]
• 7: S. Putzer and G. Lavoriero. Complete eGovernment solution at City of Bozen-Bolzano. 2008 Oracle Spatial User Conference.
• 8: Nigel H. M. Wilson , Agostino Nuzzolo, Schedule-Based Dynamic Transit Modeling: Theory and Applications ("Operations Research/Computer Science Interfaces, 28), Kluwer Academic Publishers, Norwell, MA, 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.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.8 Database applications
          Subjects: Spatial databases and GIS

General Terms:
Algorithms