On finding minimum routes in a network with turn penalties
Communications of the ACM
Modeling Costs of Turns in Route Planning
Geoinformatica
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Real-time routing with OpenStreetMap data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Routing directions: keeping it fast and simple
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Flexible route guidance through turn instruction graphs
Proceedings of the 1st ACM SIGSPATIAL International Workshop on MapInteraction
| Hi-index | 0.00 |
We present an efficient algorithm for shortest path computation in road networks with turn costs. Each junction is modeled as a node, and each road segment as an edge in a weighted graph. Turn costs are stored in tables that are assigned to nodes. By reusing turn cost tables for identical junctions, we improve the space efficiency. Preprocessing based on an augmented node contraction allows fast shortest path queries. Compared to an edge-based graph, we reduce preprocessing time by a factor of 3.4 and space by a factor of 2.4 without change in query time.