Metro Network Operational Solutions for Connectivity Control based on Percolation Theory

Abstract

Recent studies have applied the percolation theory to analyze the connectivity of networks in the transportation field. However, research was conducted in a manner that completely removed the function of nodes or links. There was a limit in that applying public transportation was difficult to guarantee the right to move the captive rider. In this study, penalties were imposed on public transportation nodes in the form of wait times to remove the function of node partially. Accordingly, the travel time of a network was calculated by optimal strategy assignment to reflect passenger behavior. When nodes were randomly penalized without transfer distinctions, there was a critical point of travel-time increase between cases with penalties of 50 and 60 nodes, respectively, and percolation was observed indirectly. A large and global effect of increased travel time was observed when the penalties were issued only to transfer stations. The application of a trip frequency weight increases the effect of penalties on medium- or short-timed trips. The results of this study can be used to establish quarantine policies for controlling public transportation networks. Furthermore, it is the first attempt at observing percolation by partially limiting its function in the form of node penalties in a public transportation network.