论文信息 - Computation of Transportation Performance in Public Service Systems

Computation of Transportation Performance in Public Service Systems

In our contribution, we study a particular approach to test the robustness of a public service system design. We can often use scenarios where possible random failures can occur and they can influence the time accessibility of service, which is provided for system users. Construction of a suitable scenario is based on the choice of links of the transportation network, which influence the system performance in a substantial way. In such scenarios one or multiple arcs can be affected by this failure. In our contribution we present characteristics of pairs of critical arcs that can be used to develop an algorithm for the creation of critical scenarios.

Michal Koháni | Peter Czimmermann | Peter Czimmermann | M. Koháni

[1] E. Jenelius. Network structure and travel patterns: explaining the geographical disparities of road network vulnerability , 2009 .

[2] Darren M. Scott,et al. Network Robustness Index : a new method for identifying critical links and evaluating the performance of transportation networks , 2006 .

[3] Michal Kvet,et al. Concept of Dynamic Index Management in Temporal Approach Using Intelligent Transport Systems , 2017, WorldCIST.

[4] Martine Labbé,et al. Solving Large p-Median Problems with a Radius Formulation , 2011, INFORMS J. Comput..

[5] Marek Kvet,et al. Characteristic of a critical network ARC in a service system , 2018 .

[6] Marek Kvet,et al. Relevant Network Distances for Approximate Approach to Large p-Median Problems , 2012, OR.

[7] Darren M. Scott,et al. Identifying Critical Road Segments and Measuring System-Wide Robustness in Transportation Networks with Isolating Links: A Link-Based Capacity-Reduction Approach , 2010 .

[8] Marek Kvet. Computational study of radial approach to public service system design with generalized utility , 2014, The 10th International Conference on Digital Technologies 2014.