基于容量的城市道路网络关键节点识别

Guimin Gong, Wen-hong Lv, Ge Gao, Qi Wang
{"title":"基于容量的城市道路网络关键节点识别","authors":"Guimin Gong, Wen-hong Lv, Ge Gao, Qi Wang","doi":"10.1109/ICCECE58074.2023.10135287","DOIUrl":null,"url":null,"abstract":"Based on the urban road traffic capacity, the identification of key nodes of urban road network is studied. Firstly, the urban road network model of undirected rights is constructed: the bearing capacity of nodes is measured by the number of lanes and the corresponding road traffic capacity of each lane, and the node importance function is established through three factors: node degree value, road section traffic capacity (edge weight) and distance between nodes. The global efficiency of the network and the maximum network connectivity subgraph were selected as the evaluation indicators to measure the network performance. The simulation analysis of the road network within Xin'an Street, Huangdao District, Qingdao City shows that compared with the degree centrality algorithm and mapping entropy algorithm, the proposed algorithm can identify the key nodes of the road network more accurately.","PeriodicalId":120030,"journal":{"name":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Capacity-based identification of key nodes in urban road networks\",\"authors\":\"Guimin Gong, Wen-hong Lv, Ge Gao, Qi Wang\",\"doi\":\"10.1109/ICCECE58074.2023.10135287\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the urban road traffic capacity, the identification of key nodes of urban road network is studied. Firstly, the urban road network model of undirected rights is constructed: the bearing capacity of nodes is measured by the number of lanes and the corresponding road traffic capacity of each lane, and the node importance function is established through three factors: node degree value, road section traffic capacity (edge weight) and distance between nodes. The global efficiency of the network and the maximum network connectivity subgraph were selected as the evaluation indicators to measure the network performance. The simulation analysis of the road network within Xin'an Street, Huangdao District, Qingdao City shows that compared with the degree centrality algorithm and mapping entropy algorithm, the proposed algorithm can identify the key nodes of the road network more accurately.\",\"PeriodicalId\":120030,\"journal\":{\"name\":\"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCECE58074.2023.10135287\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECE58074.2023.10135287","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于城市道路通行能力,对城市道路网络关键节点的识别进行了研究。首先,构建无向权的城市路网模型:通过车道数和每条车道对应的道路通行能力来衡量节点的承载能力,并通过节点度值、路段通行能力(边权)和节点间距离三个因素建立节点重要性函数。选取网络整体效率和最大网络连通性子图作为评价指标来衡量网络性能。通过对青岛市黄岛区新安街道内道路网络的仿真分析表明,与度中心性算法和映射熵算法相比,本文算法能够更准确地识别出道路网络的关键节点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Capacity-based identification of key nodes in urban road networks
Based on the urban road traffic capacity, the identification of key nodes of urban road network is studied. Firstly, the urban road network model of undirected rights is constructed: the bearing capacity of nodes is measured by the number of lanes and the corresponding road traffic capacity of each lane, and the node importance function is established through three factors: node degree value, road section traffic capacity (edge weight) and distance between nodes. The global efficiency of the network and the maximum network connectivity subgraph were selected as the evaluation indicators to measure the network performance. The simulation analysis of the road network within Xin'an Street, Huangdao District, Qingdao City shows that compared with the degree centrality algorithm and mapping entropy algorithm, the proposed algorithm can identify the key nodes of the road network more accurately.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信