A road network simplification algorithm that preserves topological properties

Abstract

A road network can be represented as a weighted directed graph with the nodes being the traffic intersections, the edges being the road segments, and the weights being some attribute of a road segment. Such a representation enables researchers to analyze road networks in consistent and automatable ways from the perspectives of graph theory. For example, analysis of the graph along with the traffic demand pattern can identify critical road segments based on centrality measures. However, due to the complexity of real-world road networks and the computationally expensive algorithms, it is challenging to extend the such methods to a large-scale road network. In this paper, we present a simple yet efficient network simplification framework based on graph theory that sub-samples and simplifies the graph while preserving key topological characteristics in the original network. Our method iteratively identifies and removes network elements that do not contribute to transportation functionality, such as self-loops, dead-ends, and interstitial nodes that lies on the same road line. We applied this method to three small cities with distinct street patterns and one large city, and showed that topological characteristics in the original networks are preserved by comparing two distinct kinds of centrality distributions in the original and simplified networks.

Linked Links. A Research Project: The Multiple Superimposed Soft Networks as Network Profiles

“…As a first example, we consider road networks. It is possible to represent a road network as a weighted directed graph where the nodes are the traffic intersections, the links are the road segments, and the weights are some attributes of the road segments [17,18].…”