Affiliation:
1. Department of Civil Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Abstract
The computational complexity associated with three candidate automated vehicle identification (AVI) tag-matching algorithms that could be used to obtain individual vehicle travel time data in real time is examined. These algorithms are suitable for application to a linear roadway facility using transponder tags that do not have programmable memory. Analytical expressions are derived to estimate the worst-case and average computational load associated with each algorithm. A simulation is conducted to test the validity of the assumptions made in these derivations and to perform a sensitivity analysis on several key system parameters, including the rate of flow of AVI-equipped vehicles, the mean travel time between tag reader stations, the coefficient of variation of travel time, and the proportion of vehicles that pass the upstream tag readers.
Subject
Mechanical Engineering,Civil and Structural Engineering
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献