Transportation Routing Map Abstraction Approach

The transportation navigation map is increasingly used in various transportation network modeling applications such as navigation or traffic assignment. A typical navigation map contains all detailed facility layers and may not be as computationally efficient for path finding as a lower resolution map. A lower resolution transportation routing map retains only roadway layers related to route-finding roadway layers and is efficient for path finding, but this map may result in only suboptimal routes. With the goal of balancing the quality and computation requirements of a transportation navigation map, the systematic abstraction of the lower resolution transportation routing map from the navigation map is an important and nontrivial task. The challenge is in how the abstracted routing map balances path-finding effectiveness and efficiency. To deal with this challenge, this study proposes an innovative map abstraction method or connectivity enhancement algorithm. The algorithm starts from a low-resolution network and continues updating the routing map by adding new links and nodes when it processes each search set node. The outcome of the proposed algorithm is an abstract map that retains the original detailed map's hierarchical structure with high topological connectivity quality at a significant computation saving.

[1]  Laurence R. Rilett,et al.  Heuristic shortest path algorithms for transportation applications: State of the art , 2006, Comput. Oper. Res..

[2]  Peter C. Nelson,et al.  Improving search efficiency using possible subgoals , 1995 .

[3]  G. Dantzig.  On the Shortest Route Through a Network , 1960 .

[4]  J.L. Bander,et al.  A new route optimization algorithm for rapid decision support , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[5]  Jan Terje Bjørke.  Map Generalization of Road Networks , 2005 .

[6]  Hongbo Gong,et al.  Generalization of road network for an embedded car navigation system , 2011 .

[7]  Andrew U. Frank,et al.  HIERARCHICAL STREET NETWORKS AS A CONCEPTUAL MODEL FOR EFFICIENT WAY FINDING , 1993 .

[8]  Elke A. Rundensteiner,et al.  Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation , 1998, IEEE Trans. Knowl. Data Eng..

[9]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[10]  S. Handy,et al.  Planning For Street Connectivity: Getting from Here to There , 2003 .

[11]  Robert L. Smith,et al.  Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems , 1998, INFORMS J. Comput..

[12]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[13]  R. Cervero,et al.  TRAVEL DEMAND AND THE 3DS: DENSITY, DIVERSITY, AND DESIGN , 1997 .

[14]  Patrick Weber,et al.  OpenStreetMap: User-Generated Street Maps , 2008, IEEE Pervasive Computing.

[15]  T. A. J. Nicholson,et al.  Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..

[16]  Sabine Timpf,et al.  A Conceptual Model of Wayfinding Using Multiple Levels of Abstraction , 1992, Spatio-Temporal Reasoning.

[17]  Angi Voß,et al.  A Comparison of the Street Networks of Navteq and OSM in Germany , 2011, AGILE Conf..

[18]  Jennifer Dill.  Measuring Network Connectivity for Bicycling and Walking , 2004 .

[19]  Yang Gao,et al.  Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems , 2011, 2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[20]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.