Dynamic HighwayNode Routing KIT（动态HighwayNode路由设备）.pdfVIP

Dynamic Highway-Node Routing Dominik Schultes and Peter Sanders Universit¨at Karlsruhe (TH), 76128 Karlsruhe, Germany {schultes,sanders}@ira.uka.de Abstract. We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the prac- tically relevant scenarios that arise in present-day navigation systems: When an edge weight changes (e.g., due to a traffic jam), we can update the preprocessed information in 2–40 ms allowing subsequent fast queries in about one millisecond on average. When we want to perform only a single query, we can skip the comparatively expensive update step and directly perform a prudent query that automatically takes the changed situation into account. If the overall cost function changes (e.g., due to a different vehicle type), recomputing the preprocessed information takes typically less than two minutes. The foundation of our dynamic method is a new static approach that generalises and combines several previous speedup techniques. It has outstandingly low memory requirements of only a few bytes per node. 1 Introduction Computing fastest routes in road networks is one of the showpieces of real-world applications of algorithmics. In principle we could use Dijkstra’s algorithm. But for large road networks this would be far too slow. Therefore, in recent years, there has been considerable interest in speed-up techniques for route planning. For an overview, we refer to [1]. The most successful methods are static, i.e., they assume that the network—including its edge weights—does not change. This makes it possible to preprocess some information once and for all that can