Author:

Keywords:

itec

Abstract:

Scalability is a major issue in finding the shortest path in a transportation network graph. Therefore, many contemporary routing web applications make use of hierarchical heuristics. This means that the road class (highway, national road, provincial road ...) of edges is used to crop the search space drastically. However, for wayfinding in network graphs for leisure and tourism, the existing road classes cannot serve as an efficient hierarchical guidance. This demonstration shows the automatic generation of hierarchical levels for this type of networks and its effect on point-to-point routing performance. The generation is realised in a bottom-up manner by distributed agents, representing geographical cells.