计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (15): 22-24.DOI: 10.3778/j.issn.1002-8331.2010.15.007

• 博士论坛 • 上一篇    下一篇

基于联合熵和C0复杂度的交通流复杂性测度

张 勇,关 伟   

  1. 北京交通大学 交通运输学院,北京100044
  • 收稿日期:2010-02-22 修回日期:2010-03-31 出版日期:2010-05-21 发布日期:2010-05-21
  • 通讯作者: 张 勇

Complexity measure of traffic flow based on union entropy and C0 complexity

ZHANG Yong,GUAN Wei   

  1. School of Traffic and Transportation,Beijing Jiaotong University,Beijing 100044,China
  • Received:2010-02-22 Revised:2010-03-31 Online:2010-05-21 Published:2010-05-21
  • Contact: ZHANG Yong

摘要: 为了定量描述交通流系统的复杂性,将联合熵和C0复杂度应用到交通流序列分析之中,通过计算原始序列和替代序列的联合熵反应系统包含的非线性成分的多少,通过计算序列的C0复杂度反应系统包含的非规则成分的多少。计算周期序列,Logistic序列,Henon序列,随机序列,及5个不同时段的实测交通流速度序列的联合熵和C0复杂度,结果表明不同序列的两种复杂性测度存在明显的差异,且计算需要步长较短,交通流系统是一个介于有序和无序、规则和非规则之间的混沌系统,且不同时段交通流序列的联合熵和C0复杂度存在着明显的差异,可以用来定量刻画交通流系统的复杂性。

关键词: 交通流系统, 复杂性测度, 联合熵, C0复杂度, 快速傅里叶变换

Abstract: In order to quantitatively describe complexity of traffic flow system,adopt union entropy and C0 complexity to analyze traffic flow series.How many non-linear ingredients in system is reflected by calculating union entropy of primitive series and surrogate series,how many non-regular ingredients in system is reflected by calculating C0 complexity.The union entropy and C0 complexity of periodic sequence,Logistic sequence,Henon sequence,random sequence and real traffic flow sequences of five different time intervals have been calculated.The results show that different sequence has different union entropy and C0 complexity and the computation demands sample few,traffic flow system is a chaotic system which situated between order and disorder,rule and non-rule,different traffic flow has different union entropy and the C0 complexity,the union entropy and the C0 complexity are suitable for quantitatively describing the complexity of traffic flow system.

Key words: traffic flow system, complex measure, union entropy, C0 complexity, Fast Fourier Transform

中图分类号: