A Note on Hierarchical Routing Algorithms based on Traverse-oriented Road Networks

摘要

Finding the shortest route has become almost an omnipresent task in our society. This task runs across in the internet, for outdoor activities and of course within in-car navigation systems. Nowadays finding the shortest path gets more popular compared to the past because of rising fuel prices. That is why driving along an optimised route has financial benefits on the one hand and on the other hand it spares energy resources of our environment. In this paper a hierarchical approach of route computation based on traverse elements is discussed. Furthermore an experimental setup consisting of an open source database management system (PostgreSQL/PostGIS) is realised to verify the theoretical part.