基于路网可达性的交通控制子区划分方法研究
发布时间：2018-10-10 17:13
【摘要】：为了提高子区划分的效率,保证子区划分结果的合理性,提出了一种基于路网可达性的子区划分方法。以路口为顶点,路段为边,修正的路段阻抗为边权得到路网加权网络,通过权系数开关化转为非加权网络;采用K步可达矩阵来分析网络的可达性,以可达性最好的顶点为核心顶点,求解核心顶点的K步可达顶点群得到子区划分结果;以子区路网路段占有率方差为评价指标,对子区划分结果进行优化。以北京市亦庄林肯公园地区路网为例的仿真结果表明:基于路网可达性的子区划分,可以找到路网中关联最为紧密的顶点群,且以子区内部路段的占有率方差作为评价指标可以保证子区内部路段状态的相似性,为子区划分的优化提供指导。
[Abstract]:In order to improve the efficiency of subdivision and ensure the rationality of the result, a subarea partition method based on road network reachability is proposed. Taking the intersection as the vertex, the section as the edge, and the modified section impedance as the edge weight, the weighted network is obtained, and the weight coefficient is switched to the unweighted network, and the reachability of the network is analyzed by using the K step reachability matrix. Taking the best reachability vertex as the core vertex, the subzone partition result is obtained by solving the K-step reachable vertex group of the core vertex, and the subarea partition result is optimized by the variance of the subarea road network occupation rate as the evaluation index. The simulation results of the road network in Yizhuang Lincoln Park area, Beijing, show that the most closely related vertex group can be found based on the sub-area division of the road network accessibility. Taking the variance of the subzone's internal section as the evaluation index, it can guarantee the similarity of the subarea's interior state, and provide the guidance for the optimization of the subarea's division.
【作者单位】： 北京交通大学交通运输学院;北方工业大学城市道路交通智能控制技术北京市重点实验室;
【基金】：国家自然科学基金专项基金项目(No.61040028)
【分类号】：U491.54
[Abstract]:In order to improve the efficiency of subdivision and ensure the rationality of the result, a subarea partition method based on road network reachability is proposed. Taking the intersection as the vertex, the section as the edge, and the modified section impedance as the edge weight, the weighted network is obtained, and the weight coefficient is switched to the unweighted network, and the reachability of the network is analyzed by using the K step reachability matrix. Taking the best reachability vertex as the core vertex, the subzone partition result is obtained by solving the K-step reachable vertex group of the core vertex, and the subarea partition result is optimized by the variance of the subarea road network occupation rate as the evaluation index. The simulation results of the road network in Yizhuang Lincoln Park area, Beijing, show that the most closely related vertex group can be found based on the sub-area division of the road network accessibility. Taking the variance of the subzone's internal section as the evaluation index, it can guarantee the similarity of the subarea's interior state, and provide the guidance for the optimization of the subarea's division.
【作者单位】： 北京交通大学交通运输学院;北方工业大学城市道路交通智能控制技术北京市重点实验室;
【基金】：国家自然科学基金专项基金项目(No.61040028)
【分类号】：U491.54
【相似文献】
相关期刊论文 前10条
1 黄海琴;;空间可达性与工业增长:来自广东高速公路的证据[J];产经评论;2013年03期
2 刘俊;陆玉麒;;江苏省公路交通网络可达性评价研究[J];南京师大学报(自然科学版);2008年03期
3 蒋晓威;曹卫东;罗健;朱胜清;唐云云;;安徽省公路网络可达性空间格局及其演化[J];地理科学进展;2012年12期
4 刘贤腾;;空间可达性研究综述[J];城市交通;2007年06期
5 刘俊;陆玉麒;孟德友;;基于不同指标的公路交通网络可达性评价——以江苏省为例[J];工业技术经济;2009年02期
6 邓羽;蔡建明;杨振山;王昊;;北京城区交通时间可达性测度及其空间特征分析[J];地理学报;2012年02期
7 吴威;曹有挥;曹卫东;徐建;王s，
本文编号：2262611
本文链接：https://www.wllwen.com/kejilunwen/daoluqiaoliang/2262611.html
