Efficient Identification of Critical Links Based on Reachability Under the Presence of Time Constraint
Efficient Identification of Critical Links Based on Reachability Under the Presence of Time Constraint
复制标题
DOI：
10.1007/978-3-030-29911-8_31
复制
发表时间：
2019-08
期刊：
影响因子：
--
通讯作者：
Kazumi Saito;K. Ohara;M. Kimura;H. Motoda
中科院分区：
文献类型：
--
作者：
Kazumi Saito;K. Ohara;M. Kimura;H. Motoda
在本文中，我们专注于在现实世界中的紧急情况，如灾难疏散，并提出了一种算法，可以有效地识别空间网络中的关键环节，大大降低网络性能，如果他们不能正常工作。为此，我们量化的网络性能节点可达性从/到目标设施之一，在预先指定的时间限制，这对应于在灾难中可以安全撤离的人数。使用一个真实的道路网络和地理信息的实际设施，我们证明了所提出的方法是更有效的方法比基于介数中心性，这是一个代表性的中心性措施，我们的方法检测到的关键环节不能通过使用一个简单的扩展介数中心性。
In this paper, we focus on an emergency situation in the real-world such as disaster evacuation and propose an algorithm that can efficiently identify critical links in a spatial network that substantially degrade network performance if they fail to function. For that purpose, we quantify the network performance by node reachability from/to one of target facilities within the prespecified time limitation, which corresponds to the number of people who can safely evacuate in a disaster. Using a real-world road network and geographical information of actual facilities, we demonstrated that the proposed method is much more efficient than the method based on the betweenness centrality that is one of the representative centrality measures and that the critical links detected by our method cannot be identified by using a straightforward extension of the betweenness centrality.