The macroscopic measure of traffic stream density is crucial in advanced traffic management systems. However, measuring the traffic stream density in the field is difficult since it is a spatial measurement. In this dissertation, several estimation approaches are developed to estimate the traffic stream density on signalized approaches using connected vehicle (CV) data. First, the dissertation introduces a novel variable estimation interval that allows for higher estimation precision, as the updating time interval always contains a fixed number of CVs. After that, the dissertation develops model-driven approaches, such as a linear Kalman filter (KF), a linear adaptive KF (AKF), and a nonlinear Particle filter (PF), to estimate the traffic stream density using CV data only. The proposed model-driven approaches are evaluated using empirical and simulated data, the former of which were collected along a signalized approach in downtown Blacksburg, VA. Results indicate that density estimates produced by the linear KF approach are the most accurate. A sensitivity of the estimation approaches to various factors including the level of market penetration (LMP) of CVs, the initial conditions, the number of particles in the PF approach, traffic demand levels, traffic signal control methods, and vehicle length is presented. Results show that the accuracy of the density estimate increases as the LMP increases. The KF is the least sensitive to the initial traffic density estimate, while the PF is the most sensitive to the initial traffic density estimate. The results also demonstrate that the proposed estimation approaches work better at higher demand levels given that more CVs exist for the same LMP scenario. For traffic signal control methods, the results demonstrate a higher estimation accuracy for fixed traffic signal timings at low traffic demand levels, while the estimation accuracy is better when the adaptive phase split optimizer is activated for high traffic demand levels. The dissertation also investigates the sensitivity of the KF estimation approach to vehicle length, demonstrating that the presence of longer vehicles (e.g. trucks) in the traffic link reduces the estimation accuracy. Data-driven approaches are also developed to estimate the traffic stream density, such as an artificial neural network (ANN), a k-nearest neighbor (k-NN), and a random forest (RF). The data-driven approaches also utilize solely CV data. Results demonstrate that the ANN approach outperforms the k-NN and RF approaches. Lastly, the dissertation compares the performance of the model-driven and the data-driven approaches, showing that the ANN approach produces the most accurate estimates. However, taking into consideration the computational time needed to train the ANN approach, the large amount of data needed, and the uncertainty in the performance when new traffic behaviors are observed (e.g., incidents), the use of the linear KF approach is highly recommended in the application of traffic density estimation due to its simplicity and applicability in the field. / Doctor of Philosophy / Estimating the number of vehicles (vehicle counts) on a road segment is crucial in advanced traffic management systems. However, measuring the number of vehicles on a road segment in the field is difficult because of the need for installing multiple detection sensors in that road segment. In this dissertation, several estimation approaches are developed to estimate the number of vehicles on signalized roadways using connected vehicle (CV) data. The CV is defined as the vehicle that can share its instantaneous location every time t. The dissertation develops model-driven approaches, such as a linear Kalman filter (KF), a linear adaptive KF (AKF), and a nonlinear Particle filter (PF), to estimate the number of vehicles using CV data only. The proposed model-driven approaches are evaluated using real and simulated data, the former of which were collected along a signalized roadway in downtown Blacksburg, VA. Results indicate that the number of vehicles produced by the linear KF approach is the most accurate. The results also show that the KF approach is the least sensitive approach to the initial conditions. Machine learning approaches are also developed to estimate the number of vehicles, such as an artificial neural network (ANN), a k-nearest neighbor (k-NN), and a random forest (RF). The machine learning approaches also use CV data only. Results demonstrate that the ANN approach outperforms the k-NN and RF approaches. Finally, the dissertation compares the performance of the model-driven and the machine learning approaches, showing that the ANN approach produces the most accurate estimates. However, taking into consideration the computational time needed to train the ANN approach, the huge amount of data needed, and the uncertainty in the performance when new traffic behaviors are observed (e.g., incidents), the use of the KF approach is highly recommended in the application of vehicle count estimation due to its simplicity and applicability in the field.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/100149 |
| Date | 02 October 2020 |
| Creators | Aljamal, Mohammad Abdulraheem |
| Contributors | Civil and Environmental Engineering, Rakha, Hesham A., Heaslip, Kevin Patrick, Hotle, Susan, Du, Jianhe |
| Publisher | Virginia Tech |
| Source Sets | Virginia Tech Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Dissertation |
| Format | ETD, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0025 seconds