CHARACTERISTIC OF A CRITICAL NETWORK ARC IN A SERVICE SYSTEM

Publications

Share / Export Citation / Email / Print / Text size:

Transport Problems

Silesian University of Technology

Subject: Economics, Transportation, Transportation Science & Technology

GET ALERTS

eISSN: 2300-861X

DESCRIPTION

17
Reader(s)
31
Visit(s)
0
Comment(s)
0
Share(s)

SEARCH WITHIN CONTENT

FIND ARTICLE

Volume / Issue / page

Related articles

VOLUME 12 , ISSUE SE (December 2017) > List of articles

CHARACTERISTIC OF A CRITICAL NETWORK ARC IN A SERVICE SYSTEM

Jaroslav JANÁČEK * / Marek KVET

Keywords : detrimental event, robust service system, transportation performance, critical arc characteristic

Citation Information : Transport Problems. Volume 12, Issue SE, Pages 141-146, DOI: https://doi.org/10.20858/tp.2017.12.se.12

License : (CC BY 4.0)

Received Date : 09-March-2017 / Accepted: 21-November-2017 / Published Online: 31-March-2018

ARTICLE

ABSTRACT

Vulnerability of a transportation network influences, importantly, the function of public service systems constituted on the network. To be able to study the importance of an individual network arc for proper functionality of the system, we suggested a characteristic function of the arc transit time elongation together with its upper and lower estimations. We also suggested and verified an algorithm that enables the determination of parameters of the characteristic estimation, and we provide a reader with a computational study performed with real road networks.

Content not available PDF Share

FIGURES & TABLES

REFERENCES

García, S. & Labbé, M. & Marín, A. Solving large p-median problems with a radius formulation. INFORMS Journal on Computing. 2011. Vol. 23. No. 4. P. 546-556.

 

Janáček, J. & Kvet, M. Relevant Network Distances for Approximate Approach to Large p- Median Problems. In: Proceedings of International Annual Conference "GOR". Hannover: Leibnitz Universitat Hannover. 2012. P. 123-128.

 

Jánošíková, L. Emergency Medical Service Planning. Communications –Scientific Letters of the University of Žilina. 2007. Vol. 9. No. 2. P. 64-68.

 

Jenelius, E. Network structure and travel patterns: explaining the geographical disparities of road network vulnerability. Journal of Transport Geography. 2009. Vol 17. P. 234-244.

 

Jukna, S. & Schnitger, G. On the optimality of Bellman–Ford–Moore shortest path algorithm. Theoretical Computer Science. 2016. Vol. 628. P. 101-109.

 

Kvet, M. 2014. Computational Study of Radial Approach to Public Service System Design with Generalized Utility. In: Proceedings of International Conference "Digital Technologies". Žilina: University of Zilina. 2014. P. 198-208.

 

Kvet, M. & Matiaško, K. Concept of dynamic index management in temporal approach using intelligent transport systems. Recent advances in information systems and technologies. 2017. Vol. I. Springer. P. 549-560.

 

Majer, T. & Palúch, S. Rescue System Resistance to Failures in Transport Network. In: Proceedings of 34th International Conference "Mathematical Methods in Economics". Liberec: Technical University of Liberec. 2016. P. 518-522.

 

Scott, D.M. & Novak, D.C. & Aultman-Hall, L. & Guo, F. Network robustness index a new method for identifying critical links and evaluating the performance of transportation networks. Journal of Transport Geography. 2006. Vol. 14. No. 3. P. 215-227.

 

Sullivan, J.L. & Novak, D.C. & Aultman-Hall, L. & Scott, D.M. Identifying critical road segments and measuring system-wide robustness in transportation networks with isolating links: A linkbased capacity-reduction problem. Transportation Research Part A. 2010. Vol. 44. P. 323-336.

 

EXTRA FILES

COMMENTS