Modeling Costs of Turns in Route Planning
Geoinformatica
Computational data modeling for network-constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Finding the k shortest simple paths: A new algorithm and its implementation
ACM Transactions on Algorithms (TALG)
Improved algorithms for the k simple shortest paths and the replacement paths problems
Information Processing Letters
| Hi-index | 0.00 |
This paper describes ongoing PhD research on applications of graph algorithms in Geographical Information Systems. Many GIS problems can be translated into a graph problem, especially in the domain of routing in road networks. Our research aims to evaluate and develop efficient methods for different variants of the routing problem. Standard existing shortest path algorithms are not always suited for use in road networks, e.g. in a realistic situation forbidden turns and turn penalties need to be taken into account. An experimental evaluation of different methods for this purpose is presented. Another interesting problem is the generation of alternative routes. This can be modelled as a k shortest paths problem, where a ranking of k paths is desired rather than only the shortest path itself. A new heuristic approach for generating alternative routes is presented and evaluated.