检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:胡继启 彭建[2] 董国华[1,2] 尹波[1,2]
机构地区:[1]长沙理工大学综合交通运输大数据智能处理湖南省重点实验室,长沙410114 [2]长沙理工大学计算机与通信工程学院,长沙410114
出 处:《计算机工程与应用》2016年第23期224-228,共5页Computer Engineering and Applications
基 金:湖南省交通厅科技项目(No.201334;No.201446;No.201146);湖南省重点实验室项目(No.2015TP1005)
摘 要:目前,在高速公路发生拥堵后,如何利用海量收费数据快速准确地得到高速公路交通拥堵初发点,仍然缺少满意的解决方案。经过对湖南省高速公路收费数据检索,提取出车辆出入站时刻、行车时间和车型等相关交通特征参数,依据这些参数特点,提出了一种计算相邻两收费站之间的交通拥堵初发点的计算方法。该方法通过选取同路段上的快、慢2种车型建立方程组,然后根据分析收费数据提取相应的变量代入方程组中,从而计算得出拥堵初发点信息。结果表明,该方法可以有效地计算得出相邻两个收费站之间路段上的拥堵初发点位置和初发时刻。对今后出行服务,运行效率评估和交通组织管理等具有重要的现实意义。Recently, after the highway traffic jams, how to utilize the huge amounts of toll collection data to quickly and accurately retrieve the beginning point of traffic jams is still lack of satisfactory solutions. This article, based on the high-way toll collection data of Hunan province, retrieves the traffic parametric features, such as the car entry time, car departure time, travel time, and motorcycle type, and proposes a method to calculate the beginning point of jams between adjacent two toll collection station. The method chooses the farthest and slowest car types in same stretch of roads, establishes corresponding equation set, and retrieves the equation variable values based on toll collection data, thus getting the information of the beginning point of jams. The evaluation results show that the proposed method can efficiently retrieve the beginning location and the beginning time of the jams between adjacent stations. This study will contribute to the travel services, traffic efficiency evaluation and traffic organization management significantly.
关 键 词:高速公路 拥堵初发点计算 数据检索 收费数据 出行服务
分 类 号:TP399[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30