.png){kind=icon}
.png){kind=icon}
Return
Data-driven network loading
.png){kind=icon}
OA
AI
DOI：10.1080/21680566.2020.1847213.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic Network Loading (DNL) models are typically formulated as a system of differential equations where travel times, densities or any other variable that indicates congestion is endogenous. However, such endogeneities increase the complexity of the Dynamic Traffic Assignment (DTA) problem due to the interdependence of DNL, route choice and demand. In this paper, attempting to exploit the growing accessibility of traffic-related data, we suggest that congestion can be instead captured by exogenous variables, such as travel time observations. We propagate the traffic flow based on an exogenous travel time function, which has a piece-wise linear form. Given piece-wise stationary route flows, the piece-wise linear form of the travel time function allows us to use an efficient event-based modelling structure. Our Data-Driven Network Loading (DDNL) approach is developed in accordance with the theoretical DNL framework ensuring vehicle conservation and FIFO. The first simulation experiment-based results are encouraging, indicating that the DDNL can contribute to improving the efficiency of applications where the monitoring of historical network-wide flows is required. Abbreviations: DDNL - Data Driven Network Loading; DNL - Dynamic Network Loading; DTA - Dynamic Traffic Assignment; ITS - Intelligent Transportation Systems; OD - Origin Destination; TTF - Travel Time Function; LTT - Linear Travel Time; DL - Demand level
Keywords:
Data-driven assignment
network loading
network-wide flows
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
558
Citations:
1.2K