Abstract: In order to improve the efficiency of subarea and ensure the reasonableness of the subarea results, a subarea partition method based on road network reachability is proposed. First, the weighted road network is described by nodes（intersections）, links（edges）, and the weight of each edges（amended impedance）, and it is converted into a non-weighted network with the weights switching method. Then the [K] step reachability matrix is proposed to analyze network reachability, choose the best reachability node as the core node, while the [K] step node cluster of the core node is the subarea result. After that, it uses the occupancy variances of links in subzone to optimize the results. A simulation of Beijing Yizhuang Lincoln Park area network results show that the subarea method based on road network reachability can find most closely associated node cluster and select the variance of internal links in the sub-region as an evaluation index can guarantee the sub-region achieve a similarity state, thus provide guidance for the optimize of the subarea.

Key words: traffic engineering, dynamic subarea partition, reachability, road network

摘要： 为了提高子区划分的效率，保证子区划分结果的合理性，提出了一种基于路网可达性的子区划分方法。以路口为顶点，路段为边，修正的路段阻抗为边权得到路网加权网络，通过权系数开关化转为非加权网络；采用[K]步可达矩阵来分析网络的可达性，以可达性最好的顶点为核心顶点，求解核心顶点的[K]步可达顶点群得到子区划分结果；以子区路网路段占有率方差为评价指标，对子区划分结果进行优化。以北京市亦庄林肯公园地区路网为例的仿真结果表明：基于路网可达性的子区划分，可以找到路网中关联最为紧密的顶点群，且以子区内部路段的占有率方差作为评价指标可以保证子区内部路段状态的相似性，为子区划分的优化提供指导。

关键词: 交通工程, 动态子区划分, 可达性, 路网