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