基于狄利克雷问题的路网控制子区动态划分  

Dynamic Partition of Control Sub-Regions in Road Network Based on Dirichlet Problem

作　　者：张曼 闫飞 阎高伟 李浦 ZHANG Man;YAN Fei;YAN Gaowei;LI Pu(School of Electrical and Power Engineering,Taiyuan University of Technology,Taiyuan 030024,China)

机构地区：[1]太原理工大学电气与动力工程学院,太原030024

出　　处：《计算机工程》2020年第12期21-26,35,共7页Computer Engineering

基　　金：国家自然科学基金(61703300);中国博士后科学基金面上项目(2019M651082);山西省应用基础研究项目(201801D221191);山西省研究生教育创新计划(2019SY157)。

摘　　要：传统静态的路网控制子区划分算法难以适应复杂路网中交通流动态变化的特性。为此,基于狄利克雷问题提出一种动态划分算法。根据密度峰值理论重新定义局部密度概念,用以识别控制子区的稳定块。在此基础上,将狄利克雷问题求解模型融入动态划分过程,迭代地对匀质性低的路段进行重新分配,实现控制子区的动态划分,模拟交通流动态变化时的子区演化过程。基于美国法默布兰奇市真实路网数据集的实验结果表明,该算法子区内部匀质性均值与归一化总方差指标较静态密度峰值划分算法分别降低22%和11%,其控制子区的匀质性较两层动态划分算法也得到有效提升。In view of the fact that the traditional static partition algorithms of control sub-regions in road network cannot adapt to the dynamic changes of traffic flow in complex road networks,this paper proposes a dynamic partition algorithm based on Dirichlet problem.According to the density peak theory,the concept of local density is redefined to identify and recognize the stable blocks in the control sub-regions.On this basis,the Dirichlet problem solving model is integrated into the dynamic partition process,and the roads with low homogeneity are iteratively re-partitioned to realize the dynamic partition of the control sub-regions.It reveals the evolution process of the sub-regions when the traffic flow changes dynamically.Experimental results on the dataset of real road network in Farmer Branch,USA show that,compared with the static density peak partition algorithm,the proposed algorithm reduces the mean homogeneity of sub-regions and normalized total variance index by 22%and 11%respectively,and improves the homogeneity of the control sub-region compared with the two-layer dynamic partitioning algorithm.

关 键 词：城市交通 控制子区 密度峰值 狄利克雷问题 动态划分 

分 类 号：U491.2[交通运输工程—交通运输规划与管理]