Defining isochrones in multimodal spatial networks

Authors:
Johann Gamper;Michael Böhlen;Willi Cometti;Markus Innerebner
Affiliations:
Free University of Bolzano-Bozen, Bolzano-Bozen, Italy;University of Zurich, Zurich, Switzerland;Free University of Bolzano-Bozen, Bolzano-Bozen, Italy;Free University of Bolzano-Bozen, Bolzano-Bozen, Italy
Venue:
Proceedings of the 20th ACM international conference on Information and knowledge management
Year:
2011

Citing 14
Cited 2

Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation

IEEE Transactions on Knowledge and Data Engineering
An efficient and scalable approach to CNN queries in a road network

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Finding Fastest Paths on A Road Network with Speed Patterns

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases

Proceedings of the 2006 ACM symposium on Applied computing
A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search

Geoinformatica
Query processing in spatial network databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Finding time-dependent shortest paths over large graphs

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Scalable network distance browsing in spatial databases

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Computing isochrones in multi-modal, schedule-based transport networks

Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Instance optimal query processing in spatial networks

The VLDB Journal — The International Journal on Very Large Data Bases
Fast shortest path distance estimation in large networks

Proceedings of the 18th ACM conference on Information and knowledge management
Efficient and scalable multi-geography route planning

Proceedings of the 13th International Conference on Extending Database Technology
Fast and accurate estimation of shortest paths in large graphs

CIKM '10 Proceedings of the 19th 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
ISOGA: a system for geographical reachability analysis

W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

An isochrone in a spatial network is the minimal, possibly disconnected subgraph that covers all locations from where a query point is reachable within a given time span and by a given arrival time. In this paper we formally define isochrones for multimodal spatial networks with different transportation modes that can be discrete or continuous in, respectively, space and time. For the computation of isochrones we propose the multimodal incremental network expansion (MINE) algorithm, which is independent of the actual network size and depends only on the size of the isochrone. An empirical study using real-world data confirms the analytical results.