Approximative network partitioning for MFDs from stationary sensor data

Monica Menendez, Lukas Ambühl, Allister Loder, Nan Zheng, Kay W. Axhausen

Research output: Contribution to conferencePaper

Abstract

The macroscopic fundamental diagram (MFD) measures network-level traffic performance of urban road networks. Large-scale networks are normally partitioned into homogeneous regions in relation to road network topology and traffic dynamics. Existing partitioning algorithms rely on unbiased data. Unfortunately, widely available stationary traffic sensors introduce a spatial bias and may fail to identify meaningful regions for MFD estimations. Thus, it is crucial to revisit and develop stationary-sensor-based partitioning algorithm. This paper proposes an alternative two-step partitioning algorithm for MFD estimations based on information collected solely from stationary sensors. In a first step, possible partitioning outcomes are generated in the road networks using random walks. In a second step, the regions’ MFDs are estimated under every possible partitioning outcome. Based on previous work, an indicator is proposed to evaluate the traffic heterogeneity in regions. The proposed partitioning approach is tested with an abstract grid network and empirical data from Zurich. In addition, the results are compared with an algorithm that disregards stationary detectors’ biases. The results demonstrate that the proposed approach performs well for obtaining the quasi-optimal network partitions yielding the lowest heterogeneity among all possible partition outcomes. The presented approach not only complements existing literature, but also offers practice-oriented solutions for transport authorities to estimate the MFDs with their available data.

Original languageEnglish (US)
DOIs
StatePublished - Jan 1 2019

Fingerprint

Sensors
Topology
Detectors

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Mechanical Engineering

Cite this

Approximative network partitioning for MFDs from stationary sensor data. / Menendez, Monica; Ambühl, Lukas; Loder, Allister; Zheng, Nan; Axhausen, Kay W.

2019.

Research output: Contribution to conferencePaper

Menendez, Monica ; Ambühl, Lukas ; Loder, Allister ; Zheng, Nan ; Axhausen, Kay W. / Approximative network partitioning for MFDs from stationary sensor data.
@conference{859a19f14fa34cb6bdf52e7efb4c539d,
title = "Approximative network partitioning for MFDs from stationary sensor data",
abstract = "The macroscopic fundamental diagram (MFD) measures network-level traffic performance of urban road networks. Large-scale networks are normally partitioned into homogeneous regions in relation to road network topology and traffic dynamics. Existing partitioning algorithms rely on unbiased data. Unfortunately, widely available stationary traffic sensors introduce a spatial bias and may fail to identify meaningful regions for MFD estimations. Thus, it is crucial to revisit and develop stationary-sensor-based partitioning algorithm. This paper proposes an alternative two-step partitioning algorithm for MFD estimations based on information collected solely from stationary sensors. In a first step, possible partitioning outcomes are generated in the road networks using random walks. In a second step, the regions’ MFDs are estimated under every possible partitioning outcome. Based on previous work, an indicator is proposed to evaluate the traffic heterogeneity in regions. The proposed partitioning approach is tested with an abstract grid network and empirical data from Zurich. In addition, the results are compared with an algorithm that disregards stationary detectors’ biases. The results demonstrate that the proposed approach performs well for obtaining the quasi-optimal network partitions yielding the lowest heterogeneity among all possible partition outcomes. The presented approach not only complements existing literature, but also offers practice-oriented solutions for transport authorities to estimate the MFDs with their available data.",
author = "Monica Menendez and Lukas Amb{\"u}hl and Allister Loder and Nan Zheng and Axhausen, {Kay W.}",
year = "2019",
month = "1",
day = "1",
doi = "10.1177/0361198119843264",
language = "English (US)",

}

TY - CONF

T1 - Approximative network partitioning for MFDs from stationary sensor data

AU - Menendez, Monica

AU - Ambühl, Lukas

AU - Loder, Allister

AU - Zheng, Nan

AU - Axhausen, Kay W.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - The macroscopic fundamental diagram (MFD) measures network-level traffic performance of urban road networks. Large-scale networks are normally partitioned into homogeneous regions in relation to road network topology and traffic dynamics. Existing partitioning algorithms rely on unbiased data. Unfortunately, widely available stationary traffic sensors introduce a spatial bias and may fail to identify meaningful regions for MFD estimations. Thus, it is crucial to revisit and develop stationary-sensor-based partitioning algorithm. This paper proposes an alternative two-step partitioning algorithm for MFD estimations based on information collected solely from stationary sensors. In a first step, possible partitioning outcomes are generated in the road networks using random walks. In a second step, the regions’ MFDs are estimated under every possible partitioning outcome. Based on previous work, an indicator is proposed to evaluate the traffic heterogeneity in regions. The proposed partitioning approach is tested with an abstract grid network and empirical data from Zurich. In addition, the results are compared with an algorithm that disregards stationary detectors’ biases. The results demonstrate that the proposed approach performs well for obtaining the quasi-optimal network partitions yielding the lowest heterogeneity among all possible partition outcomes. The presented approach not only complements existing literature, but also offers practice-oriented solutions for transport authorities to estimate the MFDs with their available data.

AB - The macroscopic fundamental diagram (MFD) measures network-level traffic performance of urban road networks. Large-scale networks are normally partitioned into homogeneous regions in relation to road network topology and traffic dynamics. Existing partitioning algorithms rely on unbiased data. Unfortunately, widely available stationary traffic sensors introduce a spatial bias and may fail to identify meaningful regions for MFD estimations. Thus, it is crucial to revisit and develop stationary-sensor-based partitioning algorithm. This paper proposes an alternative two-step partitioning algorithm for MFD estimations based on information collected solely from stationary sensors. In a first step, possible partitioning outcomes are generated in the road networks using random walks. In a second step, the regions’ MFDs are estimated under every possible partitioning outcome. Based on previous work, an indicator is proposed to evaluate the traffic heterogeneity in regions. The proposed partitioning approach is tested with an abstract grid network and empirical data from Zurich. In addition, the results are compared with an algorithm that disregards stationary detectors’ biases. The results demonstrate that the proposed approach performs well for obtaining the quasi-optimal network partitions yielding the lowest heterogeneity among all possible partition outcomes. The presented approach not only complements existing literature, but also offers practice-oriented solutions for transport authorities to estimate the MFDs with their available data.

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

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

U2 - 10.1177/0361198119843264

DO - 10.1177/0361198119843264

M3 - Paper

ER -