临界性
公制(单位)
排名(信息检索)
网络拓扑
计算机科学
韵律学
骨料(复合)
流量网络
拓扑(电路)
链接(几何体)
数据挖掘
计算机网络
数学
数学优化
人工智能
路由协议
工程类
布线(电子设计自动化)
复合材料
物理
核物理学
组合数学
材料科学
静态路由
运营管理
作者
Amirmasoud Almotahari,Anil Yazici
标识
DOI:10.1016/j.trd.2020.102529
摘要
Abstract Due to the lack of ground truth on the link criticality rankings of transportation networks, it is not possible to identify the most accurate metric. While several studies provide reviews of the existing criticality metrics, the consistencies of calculated rankings by these metrics are yet to be explored. In this paper, link criticality rankings with five different metrics are compared under 150 test networks of different network topologies and congestion levels. Accordingly, the consensus metric that provides a ranking that is closest to the aggregate ranking is identified for each test network. The results show transportation network efficiency metric is the most frequent consensus metric and link flow can serve as proxy for criticality analysis under certain network characteristics. The level of congestion and network transitivity are the most important features to determine the consensus metric. The proposed framework is then tested on Sioux Falls, Eastern Massachusetts, and Anaheim networks.
科研通智能强力驱动
Strongly Powered by AbleSci AI