ISOGA: A System for Geographical Reachability Analysis

Innerebner, Markus; Böhlen, Michael H.; Gamper, Johann

doi:10.1007/978-3-642-37087-8_13

Cited by 8 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…7 http://sasabus.org/opendata Our framework combines street and transportation networks into a single multimodal network and provides query services via a public API. In addition, MoTrIS comes with a web-interface which enables the users to create, modify and test their own customized services.…”

Section: Discussionmentioning

confidence: 99%

“…We collected road network data for the Province of South Tyrol from OSM and bus schedule data from the local bus operator SASA 7 . In our demonstration we will show all the steps required to import the collected data into our PostGIS database.…”

Section: Demonstration Scenariosmentioning

confidence: 99%

“…Another line of work [1,4] includes methods which compute trips that comply with a set of user-defined preferences and constraints, e.g., no transfers, least possible walking, etc. Regarding systems that support query processing on multimodal networks, ISOGA [7] enables the computation of isochrones on multimodal networks for reachability analysis.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

MoTrIS

Chondrogiannis

Gamper

Cavaliere³

et al. 2016

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Self Cite

View full text Add to dashboard Cite

In this paper, we present MoTrIS, a service-oriented framework which enables spatio-temporal query processing on multimodal networks that are composed of a road network and one or more schedule-based transportation networks. MoTrIS provides a remote access API, which allows for the development of applications that require the processing of routing queries on multimodal networks. We discuss the architecture of MoTrIS and we elaborate on each of its individual components. The data input module allows for the import of data from various sources into a spatial-enabled relational database. The network module builds a multimodal network by combining a road network with one or more transportation networks. The timetable module stores and queries the schedule for each transportation mode. The query processing module enables the execution of queries over the multimodal network. The visualization module exports the results into a visualizable format. Finally, we present a web application which allows users to create, modify and test advanced spatio-temporal services, and we demonstrate all the necessary steps for a user to build such a new service.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Demonstration Scenariosmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

MoTrIS

Chondrogiannis

Gamper

Cavaliere³

et al. 2016

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Christopher et al [6] designed a collaborative route planning system for utility vehicles which relies heavily on route calculation based on underlying transportation network stored in relational databases. Innerebner et al [7] created a web-based system named ISOGA that uses isochrones to perform geographical reachability analysis over a transportation network stored in a relational database. Zlatanova et al [5] focused on examining the problem of finding the optimal path for moving objects to avoid moving obstacles using a relational database.…”

Section: Introductionmentioning

confidence: 99%

The shortest path algorithm performance comparison in graph and relational database on a transportation network

Miler

Medak

Odobašić

2014

PROMET

View full text Add to dashboard Cite

show abstract

“…Hence, rather than actual distances, information about the subgraph within range is required. Isolines are relevant in a wide range of applications, such as reachability analyses [3,17,18], geomarketing [13], range visualization for (electric) vehicles [20], and a variety of online applications [22].Related Work. Dijkstra's well-known algorithm [12] computes shortest paths from a given source to all (reachable) vertices in (almost) linear time.…”

mentioning

confidence: 99%

Fast Exact Computation of Isochrones in Road Networks

Baum

Buchhold

Dibbelt

et al. 2016

Experimental Algorithms

View full text Add to dashboard Cite

We study the problem of computing isochrones in road networks, where the objective is to identify the region that is reachable from a given source within a certain amount of time. While there is a wide range of practical applications for this problem (e. g., reachability analyses, geomarketing, visualizing the cruising range of a vehicle), there has been little research on fast computation of isochrones on large, realistic inputs. In this work, we formalize the notion of isochrones in road networks and present a basic approach for the resulting problem based on Dijkstra's algorithm. Moreover, we consider several speedup techniques that are based on previous approaches for one-tomany shortest path computation (or similar scenarios). In contrast to such related problems, the set of targets is not part of the input when computing isochrones. We extend known Multilevel Dijkstra techniques (such as CRP) to the isochrone scenario, adapting a previous technique called isoGRASP to our problem setting (thereby, enabling faster queries). Moreover, we introduce a family of algorithms based on (single-level) graph partitions, following different strategies to exploit the efficient access patterns of PHAST, a well-known approach towards one-to-all queries. Our experimental study reveals that all speedup techniques allow fast isochrone computation on input graphs at continental scale, while providing different tradeoffs between preprocessing effort, space consumption, and query performance. Finally, we demonstrate that all techniques scale well when run in parallel, decreasing query times to a few milliseconds (orders of magnitude faster than the basic approach) and enabling even interactive applications. on practical algorithms for routing in road networks [2]. Most work focused on computing distances (or shortest paths) between pairs (or sets) of vertices. On the other hand, isochrones (more generally, isolines) are defined as curves of constant distance (from a given source). Thereby, isochrones represent the area that is in range for a given time limit (or some other limited resource). Hence, rather than actual distances, information about the subgraph within range is required. Isolines are relevant in a wide range of applications, such as reachability analyses [3,17,18], geomarketing [13], range visualization for (electric) vehicles [20], and a variety of online applications [22].Related Work. Dijkstra's well-known algorithm [12] computes shortest paths from a given source to all (reachable) vertices in (almost) linear time. The MINE algorithm [17] is a Dijkstra-based search to compute isochrones in transportation networks, using a spatial network database. An improved variant, MIMEX [18], has reduced space requirements. Both approaches work on databases, prohibiting interactive applications (with running times beyond the order of minutes).Regarding shortest-path computation, on the other hand, various speedup techniques [2] were developed for faster queries, using an offline preprocessing phase (sometimes including an ad...

show abstract

ISOGA: A System for Geographical Reachability Analysis

Cited by 8 publications

References 8 publications

MoTrIS

MoTrIS

The shortest path algorithm performance comparison in graph and relational database on a transportation network

Fast Exact Computation of Isochrones in Road Networks

Contact Info

Product

Resources

About