检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李斯雨
机构地区:[1]贵州大学数学与统计学院,贵州 贵阳
出 处:《运筹与模糊学》2023年第1期108-119,共12页Operations Research and Fuzziology
摘 要:为改善城市道路交通路网区域拥堵的管控措施,本文提出一种路网动态划分算法。考虑到空间相邻路段的相似性,引入速度时间序列的相关系数去度量变化趋势并构建交通运行特性指标。通过归一化割方法(Normalized Cut, NCut)构建初步路网分区算法,结合自适应调节算法路网进行逐时段的动态分区。利用贵阳市数据验证算法的有效性并评估早晚高峰的分区演变效果。结果表明,所提出的分区算法能揭示不同时期交通演变规律,早晚高峰较平峰有更优的表现,所提出算法能达到有效并理想的分区结果。In order to improve the control measures of regional congestion of urban road traffic network, this paper proposes a road network dynamic classification algorithm. Considering the similarity of adjacent road sections in space, the correlation coefficient of speed time series is introduced to measure the change trend and construct the traffic operation characteristics index. A preliminary road network partitioning algorithm is constructed by the Normalized Cut (NCut) method, which is combined with an adaptive adjustment algorithm for dynamic partitioning of the road network on a time-by-time basis. The effectiveness of the algorithm is verified using data from the city of Guiyang and the effect of the partitioning evolution in the morning and evening peaks is evaluated. The results show that the proposed partitioning algorithm can reveal the traffic evolution pattern in different periods, and the morning and evening peaks have better performance than the flat peaks, and the proposed algorithm can achieve effective and ideal partitioning results.
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7