A Network Partitioning Algorithmic Approach for Macroscopic Fundamental Diagram-Based Hierarchical Traffic Network Management

Kang An, Yi Chang Chiu, Xianbiao Hu, Xiaohong Chen

Research output: Research - peer-reviewArticle

  • 1 Citations

Abstract

The existence of a macroscopic fundamental diagram (MFD) in a network/subnetwork allows one to formulate hierarchical traffic management strategies. In order to achieve this, a robust and efficient network partitioning algorithm is needed. This research aims to create such an algorithm, where distinct MFD properties exist for each respective partition. The proposed four-step network partition approach utilizes the concept of lambda-connectedness and the technique of region growing and, unlike prior studies, can work with partial traffic data. This research brings forth the following contributions: 1) an algorithmic approach that allows for incomplete traffic datasets as an input and 2) an approach that does not require the user to arbitrarily pre-determine the number of necessary subnetworks. The proposed algorithmic approach can intuitively decide on the number of partitions based on the network connectivity and traffic congestion patterns. The proposed approach was implemented and tested on the regional planning network of Tucson/Pima County Arizona, USA. The MFD related statistics for each subnetwork are presented and discussed. Numerical analysis on lambda choice and algorithm sensitivity regarding different data missing ratios were also performed and elaborated.

LanguageEnglish (US)
JournalIEEE Transactions on Intelligent Transportation Systems
DOIs
StateAccepted/In press - Jul 1 2017

Fingerprint

Network management
Regional planning
Traffic congestion
Numerical analysis
Statistics

Keywords

  • Algorithm design and analysis
  • Computational modeling
  • hierarchical management strategy
  • lambda-connectedness
  • macroscopic fundamental diagram
  • Network partitioning
  • Partitioning algorithms
  • region growing.
  • Roads
  • Shape

ASJC Scopus subject areas

  • Automotive Engineering
  • Mechanical Engineering
  • Computer Science Applications

Cite this

@article{b439052a81ba4fd087b80caaf9d662df,
title = "A Network Partitioning Algorithmic Approach for Macroscopic Fundamental Diagram-Based Hierarchical Traffic Network Management",
abstract = "The existence of a macroscopic fundamental diagram (MFD) in a network/subnetwork allows one to formulate hierarchical traffic management strategies. In order to achieve this, a robust and efficient network partitioning algorithm is needed. This research aims to create such an algorithm, where distinct MFD properties exist for each respective partition. The proposed four-step network partition approach utilizes the concept of lambda-connectedness and the technique of region growing and, unlike prior studies, can work with partial traffic data. This research brings forth the following contributions: 1) an algorithmic approach that allows for incomplete traffic datasets as an input and 2) an approach that does not require the user to arbitrarily pre-determine the number of necessary subnetworks. The proposed algorithmic approach can intuitively decide on the number of partitions based on the network connectivity and traffic congestion patterns. The proposed approach was implemented and tested on the regional planning network of Tucson/Pima County Arizona, USA. The MFD related statistics for each subnetwork are presented and discussed. Numerical analysis on lambda choice and algorithm sensitivity regarding different data missing ratios were also performed and elaborated.",
keywords = "Algorithm design and analysis, Computational modeling, hierarchical management strategy, lambda-connectedness, macroscopic fundamental diagram, Network partitioning, Partitioning algorithms, region growing., Roads, Shape",
author = "Kang An and Chiu, {Yi Chang} and Xianbiao Hu and Xiaohong Chen",
year = "2017",
month = "7",
doi = "10.1109/TITS.2017.2713808",
journal = "IEEE Transactions on Intelligent Transportation Systems",
issn = "1524-9050",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A Network Partitioning Algorithmic Approach for Macroscopic Fundamental Diagram-Based Hierarchical Traffic Network Management

AU - An,Kang

AU - Chiu,Yi Chang

AU - Hu,Xianbiao

AU - Chen,Xiaohong

PY - 2017/7/1

Y1 - 2017/7/1

N2 - The existence of a macroscopic fundamental diagram (MFD) in a network/subnetwork allows one to formulate hierarchical traffic management strategies. In order to achieve this, a robust and efficient network partitioning algorithm is needed. This research aims to create such an algorithm, where distinct MFD properties exist for each respective partition. The proposed four-step network partition approach utilizes the concept of lambda-connectedness and the technique of region growing and, unlike prior studies, can work with partial traffic data. This research brings forth the following contributions: 1) an algorithmic approach that allows for incomplete traffic datasets as an input and 2) an approach that does not require the user to arbitrarily pre-determine the number of necessary subnetworks. The proposed algorithmic approach can intuitively decide on the number of partitions based on the network connectivity and traffic congestion patterns. The proposed approach was implemented and tested on the regional planning network of Tucson/Pima County Arizona, USA. The MFD related statistics for each subnetwork are presented and discussed. Numerical analysis on lambda choice and algorithm sensitivity regarding different data missing ratios were also performed and elaborated.

AB - The existence of a macroscopic fundamental diagram (MFD) in a network/subnetwork allows one to formulate hierarchical traffic management strategies. In order to achieve this, a robust and efficient network partitioning algorithm is needed. This research aims to create such an algorithm, where distinct MFD properties exist for each respective partition. The proposed four-step network partition approach utilizes the concept of lambda-connectedness and the technique of region growing and, unlike prior studies, can work with partial traffic data. This research brings forth the following contributions: 1) an algorithmic approach that allows for incomplete traffic datasets as an input and 2) an approach that does not require the user to arbitrarily pre-determine the number of necessary subnetworks. The proposed algorithmic approach can intuitively decide on the number of partitions based on the network connectivity and traffic congestion patterns. The proposed approach was implemented and tested on the regional planning network of Tucson/Pima County Arizona, USA. The MFD related statistics for each subnetwork are presented and discussed. Numerical analysis on lambda choice and algorithm sensitivity regarding different data missing ratios were also performed and elaborated.

KW - Algorithm design and analysis

KW - Computational modeling

KW - hierarchical management strategy

KW - lambda-connectedness

KW - macroscopic fundamental diagram

KW - Network partitioning

KW - Partitioning algorithms

KW - region growing.

KW - Roads

KW - Shape

UR - http://www.scopus.com/inward/record.url?scp=85023171194&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85023171194&partnerID=8YFLogxK

U2 - 10.1109/TITS.2017.2713808

DO - 10.1109/TITS.2017.2713808

M3 - Article

JO - IEEE Transactions on Intelligent Transportation Systems

T2 - IEEE Transactions on Intelligent Transportation Systems

JF - IEEE Transactions on Intelligent Transportation Systems

SN - 1524-9050

ER -