More Hierarchy in Route Planning Using Edge Hierarchies

07/08/2019
by   Demian Hespe, et al.
0

A highly successful approach to route planning in networks (particularly road networks) is to identify a hierarchy in the network that allows faster queries after some preprocessing that basically inserts additional "shortcut"-edges into a graph. In the past there has been a succession of techniques that infer a more and more fine grained hierarchy enabling increasingly more efficient queries. This appeared to culminate in contraction hierarchies that assign one hierarchy level to each vertex. In this paper we show how to identify an even more fine grained hierarchy that assigns one level to each edge of the network. Our findings indicate that this can lead to considerably smaller search spaces in terms of visited edges. Currently, this does not result in improved query times so that it remains an open question whether these edge hierarchies can lead to overall improved performance. However, we believe that the technique as such is a noteworthy enrichment of the portfolio of available techniques that might prove useful in the future.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2019

A Fine-Grained Variant of the Hierarchy of Lasserre

There has been much recent interest in hierarchies of progressively stro...
research
09/08/2020

Sequenced Route Query with Semantic Hierarchy

The trip planning query searches for preferred routes starting from a gi...
research
11/15/2017

Finer Grained Entity Typing with TypeNet

We consider the challenging problem of entity typing over an extremely f...
research
09/12/2020

Exploring the Hierarchy in Relation Labels for Scene Graph Generation

By assigning each relationship a single label, current approaches formul...
research
08/18/2022

Customizable Hub Labeling: Properties and Algorithms

Hub Labeling (HL) is one of the state-of-the-art preprocessing-based tec...
research
06/27/2019

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies

Graph partitioning has many applications. We consider the acceleration o...
research
11/26/2020

Outcome Indistinguishability

Prediction algorithms assign numbers to individuals that are popularly u...

Please sign up or login with your details

Forgot password? Click here to reset