z-logo
open-access-imgOpen Access
Estimation of sparse O–D matrix accounting for demand volatility
Author(s) -
Wen Tao,
Cai Chen,
Gardner Lauren,
Waller Steven Travis,
Dixit Vinayak,
Chen Fang
Publication year - 2018
Publication title -
iet intelligent transport systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.579
H-Index - 45
eISSN - 1751-9578
pISSN - 1751-956X
DOI - 10.1049/iet-its.2018.0069
Subject(s) - volatility (finance) , matrix (chemical analysis) , mathematics , computer science , mathematical optimization , econometrics , composite material , materials science
A critical issue in origin–destination (O–D) demand estimation is under‐determination: the number of O–D pairs to be estimated is often much greater than the number of monitored links. In real world, some centroids tend to be more popular than others, and only few trips are made for intro‐zonal travel. Consequently, a large portion of trips will be made for a small portion of O–D pairs, meaning many O–D pairs have only a few or even zero trips. Mathematically, this implies that the O–D matrix is sparse. Also, the correlation between link flows is often neglected in the O–D estimation problem, which can be obtained from day‐to‐day loop detector count data. Thus, sparsity regularisation is combined with link flow correlation to provide additional inputs for the O–D estimation process to mitigate the issue of under‐determination and thereby improve estimation quality. In addition, a novel strategic user equilibrium model is implemented to provide route choice of users for the O–D estimation problem, which explicitly accounts for demand and link flow volatility. The model is formulated as a convex generalised least squares problem with regularisation, the usefulness of sparsity assumption, and link flow correlation is presented in the numerical analysis.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here