4.7 Article

A methodology for identifying critical links and estimating macroscopic fundamental diagram in large-scale urban networks

Journal

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trc.2020.102743

Keywords

Macroscopic Fundamental Diagram (MFD); Critical links; Principal Component Analysis (PCA); Probe vehicles; Loop detectors

Funding

  1. iMOVE CRC
  2. Cooperative Research Centres program, an Australian Government initiative

Ask authors/readers for more resources

The Macroscopic Fundamental Diagram (MFD), which exhibits the relationship between average flow and average density of an urban network, is a promising framework for monitoring and controlling urban traffic networks. Given that monitoring resources (e.g. loop detectors, probe vehicle data, etc.) are limited in real-world networks, acquiring adequate data to estimate an MFD is of crucial importance. This study presents a novel, network-wide approach to identifying critical links and estimating average traffic flow and density. The proposed model estimates the MFD using flow and density measurements from those critical links, which constitute only a small subset of all the links in the network. To find the critical links, we rely on historical probe vehicle data, and propose a model that builds on Principal Component Analysis (PCA), a dimensionality reduction and a feature selection method. Essentially, using PCA, a large number of possibly interrelated variables in a dataset can be reduced to a set of smaller uncorrelated variables, while maintaining as much information as possible in the dataset. The resulting uncorrelated variables, or the principal components, indicate the major patterns or the dominating features of the original dataset. Additionally, PCA enables the (approximate) reconstruction of the full-scale dataset from the selected features (or principal components). In this work, we apply PCA in order to identify the main traffic features from a probe vehicle dataset; then, we find the links that are associated with these features (i.e., critical links); then, we locate loop detectors on those links to collect flow and density data; and finally, we reconstruct the full-scale data, building on the PCA mechanism. This gives us the flow and density of all links, from which we can effectively estimate the MFD.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Multidisciplinary Sciences

Searching for empirical evidence on traffic equilibrium

Mehmet Yildirimoglu, Osman Kahraman

PLOS ONE (2018)

Editorial Material Engineering, Civil

Emerging Information and Communication Technologies for Traffic Estimation and Control

Anastasios Kouvelas, Andy Chow, Eric Gonzales, Mehmet Yildirimoglu, Rodrigo Castelan Carlson

JOURNAL OF ADVANCED TRANSPORTATION (2018)

Article Economics

Demand management with limited cooperation among travellers: A doubly dynamic approach

Mehmet Yildirimoglu, Mohsen Ramezani

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2020)

Article Transportation Science & Technology

A hazard-based duration model to quantify the impact of connected driving environment on safety during mandatory lane-changing

Yasir Ali, Md Mazharul Haque, Zuduo Zheng, Simon Washington, Mehmet Yildirimoglu

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2019)

Article Transportation

Joint estimation of paths and travel times from Bluetooth observations

Mehmet Yildirimoglu

Summary: This paper presents a joint method for estimating vehicle paths and travel times, and the results demonstrate that this method significantly outperforms a simple model based on direct matching.

TRANSPORTMETRICA B-TRANSPORT DYNAMICS (2021)

Article Transportation Science & Technology

Robust perimeter control with cordon queues and heterogeneous transfer flows

Ye Li, Mehmet Yildirimoglu, Mohsen Ramezani

Summary: This paper investigates the accumulation-based and trip-based Macroscopic Fundamental Diagram (MFD) models, and proposes a robust perimeter control method based on Sliding Mode Control that can effectively alleviate congestion and improve network efficiency during traffic rush hours.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

Article Transportation Science & Technology

CLACD: A complete LAne-Changing decision modeling framework for the connected and traditional environments

Yasir Ali, Zuduo Zheng, Md. Mazharul Haque, Mehmet Yildirimoglu, Simon Washington

Summary: This study developed a Complete Lane-Changing Decision (CLACD) modeling framework that explains both mandatory and discretionary lane-changing behaviors in traditional and connected environments. Through a combination of utility theory and game theory, the CLACD model effectively captured observed lane-changing decisions.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

Article Transportation Science & Technology

Dedicated bus lane network design under demand diversion and dynamic traffic congestion: An aggregated network and continuous approximation model approach

Antoine Petit, Mehmet Yildirimoglu, Nikolas Geroliminis, Yanfeng Ouyang

Summary: This paper proposes an integrated methodological framework for designing a spatially heterogeneous bus route network and time-dependent service intervals to meet travel demand. Numerical experiments are used to demonstrate the applicability of the proposed model and conduct a detailed analysis on the impact of demand patterns on public transit network design, roadway congestion, and system performance.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

Article Operations Research & Management Science

Schedule-Constrained Demand Management in Two-Region Urban Networks

Sakitha Kumarage, Mehmet Yildirimoglu, Mohsen Ramezani, Zuduo Zheng

Summary: This paper introduces a cooperative demand redistribution strategy to optimize urban traffic network performance by minimizing total time spent and minimizing disruption to traveler departure times. The model combines two traffic models based on macroscopic fundamental diagram, and utilizes nonlinear optimization to address observed and unobserved demand, reaching a constrained system optimum while ensuring applicability at full and partial user compliance conditions.

TRANSPORTATION SCIENCE (2021)

Article Transportation Science & Technology

Staggered work schedules for congestion mitigation: A morning commute problem*

Mehmet Yildirimoglu, Mohsen Ramezani, Mahyar Amirgholy

Summary: This paper proposes an optimal staggered work schedules problem to minimize network total travel time and prevent delays in commuter trips during morning peaks in a bicentric network. By using a multi-objective optimization program and macroscopic fundamental diagrams, the method's accuracy and effectiveness are analyzed through solving the optimization problem for a test network. Results demonstrate that implementing this strategy can significantly reduce traffic congestion in urban networks.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

Article Transportation Science & Technology

Data fusion for estimating Macroscopic Fundamental Diagram in large-scale urban networks

Elham Saffari, Mehmet Yildirimoglu, Mark Hickman

Summary: This study aims to estimate the MFD for a large-scale urban network by combining probe vehicle data with an unknown penetration rate and full-scale approximate traffic data based on loop detector data. The Bayesian fusion method outperforms the baseline method in average flow and density estimations, especially showing significant improvement in average density estimations.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2022)

Article Transportation

Incorporating congestion patterns into spatio-temporal deep learning algorithms

Neil Leiser, Mehmet Yildirimoglu

Summary: This research enhances deep learning algorithms for traffic prediction by exploiting spatial dependencies in road networks. It identifies traffic patterns through graph theory and traffic flow fundamentals, integrates them with deep learning algorithms, and enables better predictions in congested areas of road networks. The proposed enhanced models significantly outperform the original deep learning models that consider the whole network as the prediction domain, as demonstrated by case studies in New York and Amsterdam networks.

TRANSPORTMETRICA B-TRANSPORT DYNAMICS (2021)

Article Public, Environmental & Occupational Health

Detecting, analysing, and modelling failed lane-changing attempts in traditional and connected environments

Yasir Ali, Zuduo Zheng, Md Mazharul Haque, Mehmet Yildirimoglu, Simon Washington

ANALYTIC METHODS IN ACCIDENT RESEARCH (2020)

Article Ergonomics

Understanding the discretionary lane-changing behaviour in the connected environment

Yasir Ali, Zuduo Zheng, Md Mazharul Haque, Mehmet Yildirimoglu, Simon Washington

ACCIDENT ANALYSIS AND PREVENTION (2020)

Article Transportation Science & Technology

3-Strategy evolutionary game model for operation extensions of subway networks

Yue Zhao, Liujiang Kang, Huijun Sun, Jianjun Wu, Nsabimana Buhigiro

Summary: This study proposes a 2-population 3-strategy evolutionary game model to address the issue of subway network operation extension. The analysis reveals that the rule of maximum total fitness ensures the priority of evolutionary equilibrium strategies, and proper adjustment minutes can enhance the effectiveness of operation extension.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Integrated optimization of container allocation and yard cranes dispatched under delayed transshipment

Hongtao Hu, Jiao Mob, Lu Zhen

Summary: This study investigates the challenges of daily storage yard management in marine container terminals considering delayed transshipment of containers. A mixed-integer linear programming model is proposed to minimize various costs associated with transportation and yard management. The improved Benders decomposition algorithm is applied to solve the problem effectively and efficiently.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Range-constrained traffic assignment for electric vehicles under heterogeneous range anxiety

Zhandong Xu, Yiyang Peng, Guoyuan Li, Anthony Chen, Xiaobo Liu

Summary: This paper studied the impact of range anxiety among electric vehicle drivers on traffic assignment. Two types of range-constrained traffic assignment problems were defined based on discrete or continuous distributed range anxiety. Models and algorithms were proposed to solve the two types of problems. Experimental results showed the superiority of the proposed algorithm and revealed that drivers with heightened range anxiety may cause severe congestion.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Demand forecasting and predictability identification of ride-sourcing via bidirectional spatial-temporal transformer neural processes

Chuanjia Li, Maosi Geng, Yong Chen, Zeen Cai, Zheng Zhu, Xiqun (Michael) Chen

Summary: Understanding spatial-temporal stochasticity in shared mobility is crucial, and this study introduces the Bi-STTNP prediction model that provides probabilistic predictions and uncertainty estimations for ride-sourcing demand, outperforming conventional deep learning methods. The model captures the multivariate spatial-temporal Gaussian distribution of demand and offers comprehensive uncertainty representations.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Partial trajectory method to align and validate successive video cameras for vehicle tracking

Benjamin Coifman, Lizhe Li

Summary: This paper develops a partial trajectory method for aligning views from successive fixed cameras in order to ensure high fidelity with the actual vehicle movements. The method operates on the output of vehicle tracking to provide direct feedback and improve alignment quality. Experimental results show that this method can enhance accuracy and increase the number of vehicles in the dataset.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Dynamic routing for the Electric Vehicle Shortest Path Problem with charging station occupancy information

Mohsen Dastpak, Fausto Errico, Ola Jabali, Federico Malucelli

Summary: This article discusses the problem of an Electric Vehicle (EV) finding the shortest route from an origin to a destination and proposes a problem model that considers the occupancy indicator information of charging stations. A Markov Decision Process formulation is presented to optimize the EV routing and charging policy. A reoptimization algorithm is developed to establish the sequence of charging station visits and charging amounts based on system updates. Results from a comprehensive computational study show that the proposed method significantly reduces waiting times and total trip duration.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)