1. An Approach to Boundary Finding of Intersection Group for Traffic Analysis due to Intersection Improvements
- Author
-
Ying Ying Ma and Ying Zeng
- Subjects
Discrete mathematics ,Traffic analysis ,Traffic congestion ,Basis (linear algebra) ,Degree (graph theory) ,Intersection ,Boundary (topology) ,General Medicine ,Limit (mathematics) ,Laplacian matrix ,Algorithm ,Mathematics - Abstract
Increased traffic congestion makes intersection improvements are necessary to improve the capacity and traffic running conditions. Because of the influence of a certain intersection improvements is not limit to itself, but covers the intersections around it. The approach to find the boundary of signal group for traffic analysis due to a certain intersection improvements is discussed in this paper. Firstly, two kinds of correlation degree are modeled, which are the basis of intersection grouping. Saturation degree and free flow travel time are considered in the model of correlation degree between two adjacent intersections considers, while correlation degree between any two intersections in the network is analyzed using Laplacian matrix algorithm. Secondly, the approach to find intersection group boundary is proposed. Thirdly, two measures are adopted in quantifying the results of intersection grouping: minimum average cut correlation degree and minimum traffic influence on the intersections outside of boundary. At last, the developed method is used on a city road network. The results of case study confirm the validity of the proposed approach.
- Published
- 2015