TRB Pubsindex
Text Size:

Title:

Clustering of Heterogeneous Networks with Directional Flows Based on “Snake” Similarities

Accession Number:

01555703

Record Type:

Component

Availability:

Transportation Research Board Business Office

500 Fifth Street, NW
Washington, DC 20001 United States

Abstract:

In urban networks with high demand, pockets of congestion normally appear in different regions with different shapes and might propagate in particular directions varying from day to day. Therefore, finding a clustering method to capture spatiotemporal growth of congestion not only provides a deeper perception of traffic dynamics in urban networks but also allows us to utilize prevailing control methodologies for signalized intersection specifically hierarchical perimeter control approaches. In order to make the application of perimeter control feasible, clusters have to be homogeneous and have a near compact shape. To obtain connected clusters with low variances and reasonable sizes, the authors propose a three-step algorithm. The advantages of the proposed method compared to existing ones are the ability of finding directional congestion within a cluster, robustness with respect to parameters’ calibration, its good performance for networks with low connectivity and missing data. Firstly, the authors start to find best local components for each link of the network in an iterative way. A sequence of links, defined as snake, is updated in each step with adjacent ones based on their similarity to join previously added links. Secondly, based on the information from the first step, similarities are defined for each pair of the links in the whole network. The similarities are computed in a way that put more weight on adjacent local components and facilitate compact shaped clusters. Finally, to find clusters with high intra similarity and low inter similarity, the objective function of Normalized Cut (NCut) algorithm is optimized for the obtained similarity matrix. By using this approach, the authors avoid having clusters with small size which is the problem of solving Ratio Cut or Min-Max Cut functions. The proposed clustering framework is applied in medium and large-size networks based on micro-simulation and empirical data from probe vehicles.

Supplemental Notes:

This paper was sponsored by TRB committee AHB45 Traffic Flow Theory and Characteristics.

Monograph Accession #:

01550057

Report/Paper Numbers:

15-1354

Language:

English

Corporate Authors:

Transportation Research Board

500 Fifth Street, NW
Washington, DC 20001 United States

Authors:

Saeedmanesh, Mohammadreza
Geroliminis, Nikolas

Pagination:

17p

Publication Date:

2015

Conference:

Transportation Research Board 94th Annual Meeting

Location: Washington DC, United States
Date: 2015-1-11 to 2015-1-15
Sponsors: Transportation Research Board

Media Type:

Digital/other

Features:

Figures; References; Tables

Subject Areas:

Data and Information Technology; Highways; I72: Traffic and Transport Planning

Source Data:

Transportation Research Board Annual Meeting 2015 Paper #15-1354

Files:

TRIS, TRB, ATRI

Created Date:

Dec 30 2014 12:31PM