On the estimation of arterial route travel time distribution with Markov chains

被引:151
|
作者
Ramezani, Mohsen [1 ]
Geroliminis, Nikolas [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Sch Architecture Civil & Environm Engn, CH-1015 Lausanne, Switzerland
基金
瑞士国家科学基金会;
关键词
Grid clustering; Markov chain; Probe vehicle; Travel time distribution; Travel time variability; VARIABILITY; MODEL;
D O I
10.1016/j.trb.2012.08.004
中图分类号
F [经济];
学科分类号
02 ;
摘要
Recent advances in the probe vehicle deployment offer an innovative prospect for research in arterial travel time estimation. Specifically, we focus on the estimation of probability distribution of arterial route travel time, which contains more information regarding arterial performance measurements and travel time reliability. One of the fundamental contributions of this work is the integration of travel time correlation of route's successive links within the methodology. In the proposed technique, given probe vehicles travel times of the traversing links, a two-dimensional (2D) diagram is established with data points representing travel times of a probe vehicle crossing two consecutive links. A heuristic grid clustering method is developed to cluster each 2D diagram to rectangular sub spaces (states) with regard to travel time homogeneity. By applying a Markov chain procedure, we integrate the correlation between states of 2D diagrams for successive links. We then compute the transition probabilities and link partial travel time distributions to obtain the arterial route travel time distribution. The procedure with various probe vehicle sample sizes is tested on two study sites with time dependent conditions, with field measurements and simulated data. The results are very close to the Markov chain procedure and more accurate once compared to the convolution of links travel time distributions for different levels of congestion, even for small penetration rates of probe vehicles. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1576 / 1590
页数:15
相关论文
共 50 条
  • [21] Estimation of Route Travel Time Distribution with Information Fusion from Automatic Number Plate Recognition Data
    Fu, Fengjie
    Qian, Wei
    Dong, Hongzhao
    [J]. JOURNAL OF TRANSPORTATION ENGINEERING PART A-SYSTEMS, 2019, 145 (07)
  • [22] On the estimation of partially observed continuous-time Markov chains
    Alan Riva-Palacio
    Ramsés H. Mena
    Stephen G. Walker
    [J]. Computational Statistics, 2023, 38 : 1357 - 1389
  • [23] On the estimation of partially observed continuous-time Markov chains
    Riva-Palacio, Alan
    Mena, Ramses H.
    Walker, Stephen G.
    [J]. COMPUTATIONAL STATISTICS, 2023, 38 (03) : 1357 - 1389
  • [24] Maximum spacing estimation for continuous time Markov chains and semi-Markov processes
    Kuljus, Kristi
    Ranneby, Bo
    [J]. STATISTICAL INFERENCE FOR STOCHASTIC PROCESSES, 2021, 24 (02) : 421 - 443
  • [25] Maximum spacing estimation for continuous time Markov chains and semi-Markov processes
    Kristi Kuljus
    Bo Ranneby
    [J]. Statistical Inference for Stochastic Processes, 2021, 24 : 421 - 443
  • [26] On Approximating the Stationary Distribution of Time-reversible Markov Chains
    Bressan, Marco
    Peserico, Enoch
    Pretto, Luca
    [J]. 35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
  • [27] On Approximating the Stationary Distribution of Time-Reversible Markov Chains
    Bressan, Marco
    Peserico, Enoch
    Pretto, Luca
    [J]. THEORY OF COMPUTING SYSTEMS, 2020, 64 (03) : 444 - 466
  • [28] On Approximating the Stationary Distribution of Time-Reversible Markov Chains
    Marco Bressan
    Enoch Peserico
    Luca Pretto
    [J]. Theory of Computing Systems, 2020, 64 : 444 - 466
  • [29] The Binomial and Negative Binomial Distribution in Discrete Time Markov Chains
    Frank, L.
    [J]. MARKOV PROCESSES AND RELATED FIELDS, 2017, 23 (03) : 377 - 400
  • [30] Estimation in Reversible Markov Chains
    Annis, David H.
    Kiessler, Peter C.
    Lund, Robert
    Steuber, Tara L.
    [J]. AMERICAN STATISTICIAN, 2010, 64 (02): : 116 - 120