Let Trajectories Speak Out the Traffic Bottlenecks

@article{Luo2021LetTS,
  title={Let Trajectories Speak Out the Traffic Bottlenecks},
  author={Hui Luo and Zhifeng Bao and G. Cong and J. Shane Culpepper and Nguyen Lu Dang Khoa},
  journal={ACM Transactions on Intelligent Systems and Technology (TIST)},
  year={2021},
  volume={13},
  pages={1 - 21}
}
  • Hui LuoZ. Bao N. Khoa
  • Published 28 July 2021
  • Computer Science
  • ACM Transactions on Intelligent Systems and Technology (TIST)
Traffic bottlenecks are a set of road segments that have an unacceptable level of traffic caused by a poor balance between road capacity and traffic volume. A huge volume of trajectory data which captures realtime traffic conditions in road networks provides promising new opportunities to identify the traffic bottlenecks. In this paper, we define this problem as trajectory-driven traffic bottleneck identification: Given a road network R, a trajectory database T, find a representative set ofโ€ฆย 

References

SHOWING 1-10 OF 42 REFERENCES

A data-driven congestion diffusion model for characterizing traffic in metrocity scales

A TCD model is designed to characterize not only the traffic flow evolving process in time domain but also the propagation process of TFI through road networks in space domain and experimental results show that the TCD approach performs best in comparison with its competitors.

Urban traffic congestion propagation and bottleneck identification

A congestion propagation model of urban network traffic is proposed based on the cell transmission model (CTM) and a new method of estimating average journey velocity (AJV) of both link and network is developed to identify network congestion bottlenecks.

Influence ranking of road segments in urban road traffic networks

This paper proposes an algorithm called RoadRank to compute the global influence scores of each road segment from their traffic measures, and rank them based on their overall influence, and proposes an extension called distributed RoadRank, based on road network partitions.

Urban Traffic Bottleneck Identification Based on Congestion Propagation

A novel definition of bottlenecks in urban area is proposed based on the congestion propagation costs and the congestion weights of road segments and an urban bottleneck identification method using causal congestion trees and causal congestion graphs is presented.

Discovery of Critical Nodes in Road Networks Through Mining From Vehicle Trajectories

A novel data-driven framework to rank node importance through mining from comprehensive vehicle trajectory data, instead of analysis solely on the topology of the road network, is proposed and two algorithms are presented, integrating the origin-destination entropy with flow (ODEF) algorithm and the crossroad-rank (CRRank) algorithm.

Empirical Observations of Congestion Propagation and Dynamic Partitioning with Probe Data for Large-Scale Systems

Empirical data from large-scale urban networks are explored to identify hidden information in the process of congestion formation and show that the proposed methodology can effectively distinguish congestion pockets from the rest of the network and efficiently track congestion evolution in linear time 0(n).

A simple contagion process describes spreading of traffic jams in urban networks

A contagion model describing epidemic spread in population to model traffic jams is applied, and its validity is verified using large-scale data from six different cities around the world.

Traffic Flow Prediction With Big Data: A Deep Learning Approach

A novel deep-learning-based traffic flow prediction method is proposed, which considers the spatial and temporal correlations inherently and is applied for the first time that a deep architecture model is applied using autoencoders as building blocks to represent traffic flow features for prediction.

Torch: A Search Engine for Trajectory Data

A new trajectory search engine called Torch is presented for querying road network trajectory data, able to efficiently process two types of typical queries (similarity search and Boolean search), and support a wide variety of trajectory similarity functions.