交通流时间序列的复杂度测量-交通运输工程学报.pdfVIP

第9 卷　第2 期 交 通 运 输 工 程 学 报 Vol.9　No.2 2009 年4 月 Journal of T raffic and Transportation Engineering Apr.2009 :1671-1637(2009)02-0089-04 张　勇, 关　伟 ( , 　100044) 　:为了定量分析交通流系统的复杂性, 引 算法复杂度和近似熵, 通过速度时间序列的算法 复杂度估计系统周期性成分的比率, 在重构序列时通过取多 个划分区间来提高算法复杂度的估计 能力。计算近似熵时, 先由速度序列得到速度变化率序列以去除趋势, 然后通过速度变化率序列的 近似熵估计系统在结构变化上的复杂性。 对实测交通流数据序列的计算表明:在序列长度超过 600 时可以得到算法复杂度, 序列长超过300 时可以得到近似熵;交通流的算法复杂度和近似熵在 同步状态时较低, 拥挤状态时增大, 在自由状态时最大。 因此, 不同的算法复杂度和近似熵对应不 同状态下的交通流, 算法复杂度能分析较长的交通流序列, 近似熵可以分析较短的交通流序列。 :交通流;时间序列;复杂度测量;算法复杂度;近似熵 :U491.112　　　:A Complexity measure of traffic flow time series ZHANG Yong, GUAN Wei (School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, hina) Abstract:In order to quantitatively analyze traffic flow complexity, the Kolmogorov complexity (Kc)and the approximate entropy (ApEn)were adopted, the system periodic ingredient ratio was estimated by using the Kc of speed time series, and the Kc evaluation ability was improved by dividing reconstructing time series into more sectors.In the ApEn computation, the time series of speed change rate was got to remove the tendency of speed time series, then the complexity of system structure change was estimated by using the ApEn of speed change rate series. alculation result of real traffic flow time series shows that the Kc can be obtained when the time series is longer than 600, and the ApEn can be got when the time series is longer than 300.The Kc and ApEn of traffic flow are lower on synchronization condition, increase onjam condition, and are largest on free condition. So the Kc and ApEn adapt to definite traffic condition, the Kc can be used to analyze longer-term traffic flow series, but the ApEn can be used