Routing in Geographic Information System

Ivan Fućak (2009) Routing in Geographic Information System. EngD thesis.

PDF Download (4Mb)

Abstract

Searching for the best route through geographical area is a very common matter in computer science. There is a variety of GPS navigators (devices) which have a possibility of routing through certain area and also web applications that offer a construction of route plan. The main goal of this bachelor thesis is to make a routing solution searching the best route from one location to another with certain criteria. However, the result of routing will not be used for navigation through space as used in GPS navigators, but for activities like planning, generating reports, assigning work etc. The reason for this being that GIS (Geographic Information System), which includes this routing solution, is actually a surveillance information system. Typical consumers of this system are companies whose interests are in transporting, because these companies often need calculations considering routes etc. Creating such a solution requires a good knowledge of GIS, with special accent put on the spatial data and the reediting of spatial data in order to make it the most suitable for actual routing. Another important feature is choosing the best search algorithm. The most common criteria for routing is the distance and consequentially, searching for the shortest path through area. Beside this criterion, there are many other like time, path cost (gas cost and road tax), traffic lights etc. In this thesis we will mostly consider the distance criterion. Other criteria will also be considered, but mostly theoretically.

Actions (login required)