Partial Node Failure in Shortest Path Network Problems

doi:10.3390/su11226275

Return

Partial Node Failure in Shortest Path Network Problems

2019-11-08

Qian Ye

Hyun Kim *

DOI：10.3390/su11226275

Original

Save

View PDF

Abstract

En 中文

This paper investigates the impact of partial node failure from the perspective of shortest path network problems. We propose a network model that we call shortest path network problems for partial node failure, designed to examine the influence of partial node failures in a flow-based network using a set of indicators. The concept of partial node failure was applied to a special type of hub station, a mandatory transfer in subway or railway systems where multiple lines are arranged for the transfer of passengers. Numerical experiments were carried out on the Washington Metropolitan Area Transit Authority network (WMATA). The results or analysis detail how changes in flow distribution in the network were measured when a station partially failed, as well as ways of identifying heavily impacted stations with respect to different indicators. Various partial node failure scenarios were simulated for origin-destination (OD) flows by days, providing comprehensive information with which to evaluate plans for partial node failures, such as those related to scheduling maintenance, along with insights with which to make contingent plans for potential closure of stations. A major finding emphasizes that the rankings of station criticality are highly sensitive to the different OD flows by days when partial node failures are assumed in network modeling.

Keywords:

partial node failure

shortest path network problem

cost update

link attribute

flow reroute cost

the Washington Metropolitan Area Transit Authority network (WMATA)

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.