Estimation of sparse O-D matrix accounting for demand volatility

被引:3
|
作者
Wen, Tao [1 ]
Cai, Chen [1 ]
Gardner, Lauren [2 ]
Waller, Steven Travis [2 ]
Dixit, Vinayak [2 ]
Chen, Fang [1 ]
机构
[1] CSIRO, Data61, Sydney, NSW, Australia
[2] Univ New South Wales, Sch Civil & Environm Engn, RCITI, Sydney, NSW, Australia
关键词
behavioural sciences; vehicle routing; matrix algebra; least squares approximations; convex programming; sparse O-D matrix estimation; demand volatility; origin-destination demand estimation; O-D demand estimation; intro-zonal travel; O-D pairs; day-to-day loop detector count data; sparsity regularisation; link flow correlation; O-D estimation process; estimation quality; strategic user equilibrium model; route choice; convex generalised least squares problem-with-regularisation; numerical analysis; ORIGIN-DESTINATION MATRICES; NETWORK TOMOGRAPHY; BAYESIAN-INFERENCE; TRAFFIC COUNTS; TRIP MATRICES; LINK; DECOMPOSITION; ALGORITHM; SELECTION; TABLES;
D O I
10.1049/iet-its.2018.0069
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1020 / 1026
页数:7
相关论文
共 50 条
  • [1] Penalization and augmented Lagrangian for O-D demand matrix estimation from transit segment counts
    Chavez Hernandez, Maria Victoria
    Juarez Valencia, Lorenzo Hector
    Rios Solis, Yasmin Agueda
    TRANSPORTMETRICA A-TRANSPORT SCIENCE, 2019, 15 (02) : 915 - 943
  • [2] A network sensor location procedure accounting for o-d matrix estimate variability
    Simonelli, Fulvio
    Marzano, Vittorio
    Papola, Andrea
    Vitiello, Iolanda
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2012, 46 (10) : 1624 - 1638
  • [3] Mixed evolutionary algorithm to solve the O-D matrix estimation problem
    Du, XY
    Li, P
    Ma, GY
    Wen, Y
    PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON NEURAL NETWORKS AND BRAIN, VOLS 1-3, 2005, : 79 - 83
  • [4] O-D matrix estimation based on data-driven network assignment
    Tsanakas, Nikolaos
    Gundlegard, David
    Rydergren, Clas
    TRANSPORTMETRICA B-TRANSPORT DYNAMICS, 2023, 11 (01) : 376 - 407
  • [5] Effectiveness of link and path information on simultaneous adjustment of dynamic O-D demand matrix
    Ernesto Cipriani
    Marialisa Nigro
    Gaetano Fusco
    Chiara Colombaroni
    European Transport Research Review, 2014, 6 : 139 - 148
  • [6] Effectiveness of link and path information on simultaneous adjustment of dynamic O-D demand matrix
    Cipriani, Ernesto
    Nigro, Marialisa
    Fusco, Gaetano
    Colombaroni, Chiara
    EUROPEAN TRANSPORT RESEARCH REVIEW, 2014, 6 (02) : 139 - 148
  • [7] Estimation of freight O-D matrix using waybill data and traffic counts in Iran roads
    Zargari, S. Afandizadeh
    Hamedani, S. M. Yadi
    IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B-ENGINEERING, 2006, 30 (B1): : 129 - 144
  • [8] Neural Network-based O-D Matrix Estimation from Link Traffic Counts
    Kim, Daehyon
    Chang, Yohan
    INTERNATIONAL JOURNAL OF URBAN SCIENCES, 2008, 12 (02) : 146 - 157
  • [9] Hybrid meta-heuristic algorithm for the simultaneous optimization of the O-D trip matrix estimation
    Stathopoulos, A
    Tsekeris, T
    COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2004, 19 (06) : 421 - 435
  • [10] A metaheuristic dynamic traffic assignment model for O-D matrix estimation using aggregate data
    Caggiani, Leonardo
    Dell'Orco, Mauro
    Marinelli, Mario
    Ottomanelli, Michele
    PROCEEDINGS OF EWGT 2012 - 15TH MEETING OF THE EURO WORKING GROUP ON TRANSPORTATION, 2012, 54 : 685 - 695