基于路網(wǎng)可達性的交通控制子區(qū)劃分方法研究
發(fā)布時間：2018-10-10 17:13
【摘要】：為了提高子區(qū)劃分的效率,保證子區(qū)劃分結果的合理性,提出了一種基于路網(wǎng)可達性的子區(qū)劃分方法。以路口為頂點,路段為邊,修正的路段阻抗為邊權得到路網(wǎng)加權網(wǎng)絡,通過權系數(shù)開關化轉為非加權網(wǎng)絡;采用K步可達矩陣來分析網(wǎng)絡的可達性,以可達性最好的頂點為核心頂點,求解核心頂點的K步可達頂點群得到子區(qū)劃分結果;以子區(qū)路網(wǎng)路段占有率方差為評價指標,對子區(qū)劃分結果進行優(yōu)化。以北京市亦莊林肯公園地區(qū)路網(wǎng)為例的仿真結果表明:基于路網(wǎng)可達性的子區(qū)劃分,可以找到路網(wǎng)中關聯(lián)最為緊密的頂點群,且以子區(qū)內部路段的占有率方差作為評價指標可以保證子區(qū)內部路段狀態(tài)的相似性,為子區(qū)劃分的優(yōu)化提供指導。
[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.
【作者單位】： 北京交通大學交通運輸學院;北方工業(yè)大學城市道路交通智能控制技術北京市重點實驗室;
【基金】：國家自然科學基金專項基金項目(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.
【作者單位】： 北京交通大學交通運輸學院;北方工業(yè)大學城市道路交通智能控制技術北京市重點實驗室;
【基金】：國家自然科學基金專項基金項目(No.61040028)
【分類號】：U491.54
【相似文獻】
相關期刊論文 前10條
1 黃海琴;;空間可達性與工業(yè)增長:來自廣東高速公路的證據(jù)[J];產(chǎn)經(jīng)評論;2013年03期
2 劉俊;陸玉麒;;江蘇省公路交通網(wǎng)絡可達性評價研究[J];南京師大學報(自然科學版);2008年03期
3 蔣曉威;曹衛(wèi)東;羅健;朱勝清;唐云云;;安徽省公路網(wǎng)絡可達性空間格局及其演化[J];地理科學進展;2012年12期
4 劉賢騰;;空間可達性研究綜述[J];城市交通;2007年06期
5 劉俊;陸玉麒;孟德友;;基于不同指標的公路交通網(wǎng)絡可達性評價——以江蘇省為例[J];工業(yè)技術經(jīng)濟;2009年02期
6 鄧羽;蔡建明;楊振山;王昊;;北京城區(qū)交通時間可達性測度及其空間特征分析[J];地理學報;2012年02期
7 吳威;曹有揮;曹衛(wèi)東;徐建;王s，
本文編號：2262611
本文鏈接：http://www.sikaile.net/kejilunwen/daoluqiaoliang/2262611.html
