位置:成果数据库 > 期刊 > 期刊详情页
基于Lempel-Ziv算法与TOPSIS的水上交通流复杂性测度
  • ISSN号:1671-1637
  • 期刊名称:《交通运输工程学报》
  • 时间:0
  • 分类:U692.4[交通运输工程—港口、海岸及近海工程;交通运输工程—船舶与海洋工程]
  • 作者机构:[1]武汉理工大学智能交通系统研究中心,湖北武汉430063, [2]武汉理工大学国家水运安全工程技术研究中心,湖北武汉430063, [3]江汉大学数学与计算机科学学院,湖北武汉430056, [4]代尔夫特理工大学技术、政策与管理学院,南荷兰代尔夫特2600AA
  • 相关基金:国家科技支撑计划项目(2015BAG20B00); 国家自然科学基金项目(51579203); 武汉理工大学研究生优秀学位论文培育项目(2016-YS-041)
中文摘要:

为了定量分析并划分水上交通流的复杂性等级,提出了一种基于Lempel-Ziv算法与TOPSIS的水上交通流复杂性测度方法。运用Lempel-Ziv算法求得实测水上交通流时间序列和对比序列(周期序列、Logistic序列、Henon序列、随机序列)的复杂性特征值,采用TOPSIS得到各个序列的贴近度,根据对比序列的贴近度划分复杂性等级区间,按照水上交通流时间序列的贴近度和所在的复杂性等级区间来表征各个序列的复杂程度,并对长江口南槽航道的实测水上交通流进行复杂性测度。计算结果表明:船舶交通事故数量和下行标准船舶数量与船舶交通流时序复杂性贴近度的相关系数分别为0.698 1、0.769 2,变化趋势基本一致,表明贴近度的计算结果可以反映水域船舶交通流的复杂性;周期序列的贴近度为0.000 1,随机序列的贴近度为0.999 9,Logistic序列和Henon序列的贴近度分别为0.449 2、0.537 7,其值大于周期序列的贴近度,小于随机序列的贴近度;2013年7~11月水上交通流序列的贴近度分别为0.828 0、0.852 7、0.856 5、0.823 7、0.810 7,说明序列的复杂性基本一致;5个月的水上交通流序列的贴近度远大于周期序列的贴近度,处于随机序列和Henon序列的贴近度之间,更接近随机序列的贴近度,说明水上交通流系统不是周期与完全随机的动力学系统;5个月水上交通流复杂性的整体等级为1级,表现出高复杂性的特点。

英文摘要:

In order to quantitatively analyze and classify waterborne traffic flow complexity,a method of waterborne traffic flow complexity metric was proposed based on Lempel-Ziv algorithm and TOPSIS(technique for order preference by similarity to an ideal solution).Firstly,LempelZiv algorithm was used to obtain the complexity eigenvalues of measured time sequences ofwaterborne traffic flow and other compared sequences(periodic sequence,logistic sequence,Henon sequence and random sequence).Secondly,the close degree of each sequence was calculated by using TOPSIS.The class of complexity was divided by those close degrees of compared sequences.At last,the complexity degree of each sequence was represented by close degrees of time sequences of waterborne traffic flow and the complexity class.This complexity metric was carried out on the waterborne traffic flow of south channel of the Yangtze River.Calculation result shows that the correlation coefficient of complexity close degree of waterborne ship traffic flow is 0.698 1 with the number of ship traffic accidents,and 0.769 2 with the downside traffic flow of standard ships,respectively.The change trend is basically consistent,so the complexity close degree can reflect the complexity of waterborne ship traffic flow.The close degrees of periodic sequence and random sequence are 0.000 1 and 0.999 9,respectively.Meanwhile,the close degrees of logistic sequence and Henon sequence are 0.449 2and 0.537 7,respectively.The close degrees of logistic sequence and Henon sequence are greater than periodic sequence and and less than random sequence.The close degrees of waterborne traffic flow from July to November in 2013 are 0.828 0,0.852 7,0.856 5,0.823 7and 0.810 7,respectively,the complexity of waterborne traffic flow is basically consistent.The values of waterborne traffic flow are far greater than those of periodic sequence,locate between the values of Henon sequence and random sequence,and are closer to the value of random sequence,which shows that the waterborne traffic s

同期刊论文项目
同项目期刊论文
期刊信息
  • 《交通运输工程学报》
  • 北大核心期刊(2011版)
  • 主管单位:中华人民共和国教育部
  • 主办单位:长安大学
  • 主编:陈荫三
  • 地址:西安市南二环路中段
  • 邮编:710064
  • 邮箱:jygc@chd.edu.cn
  • 电话:029-82334388
  • 国际标准刊号:ISSN:1671-1637
  • 国内统一刊号:ISSN:61-1369/U
  • 邮发代号:52-195
  • 获奖情况:
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,波兰哥白尼索引,荷兰文摘与引文数据库,美国工程索引,美国剑桥科学文摘,英国科学文摘数据库,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版)
  • 被引量:13453