ABSTRACT

The North American railroad system can be well represented by a network with 302,943 links (track segments) and 250,388 nodes (stations, junctions, and waypoints), and other points of interest based on publicly accessible geographical information obtained from the Bureau of Transportation Statistics (BTS) and the Federal Railroad Administration (FRA). From this large network, a slightly more consolidated subnetwork representing the major freight railroads and Amtrak was selected for analysis. Recent improvements in network and graph theory and improvements in all-pairs shortest path algorithms make it more feasible to process certain characteristics on large networks with reduced computation time and resources. The characteristics of networks at issue in this study to support network-level risk and resilience studies include node efficiency, node eccentricity, and other attributes derived from those measures, such as network arithmetic efficiency, network geometric central node, radius, and diameter, and some distribution measures of the node characteristics. Rail distance weighting factors, representing the length of each rail derived from BTS data, are mapped to corresponding links and are used as link weights for the purpose of computing shortest paths and subsequent characteristics. These network characteristics can be used to place resources and plan for natural hazard and disaster scenarios. They relate to many practical applications such as network efficiency to distribute traffic and a network’s ability to recover from disruptions.

Get full access to this article

View all available purchase options and get full access to this chapter.

REFERENCES

Chan, T. M. (2010). “More Algorithms for All-Pairs Shortest Paths in Weighted Graphs.” SIAM J. Comput., 39 (5): 2075–2089. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/08071990X.
Csardi, G. (2023). “igraph Documentation.” https://igraph.org/r/doc/distances.html.
Euler, L. (1726). “Solutio problematis ad geometriam situs pertinentis.” Comment Acad Sci U, Petrop 8: 128–140.
“Geospatial at the Bureau of Transportation Statistics.” (n.d.). Accessed April 18, 2023. https://data-usdot.opendata.arcgis.com.
Hamed, M., Y. Mao, B. M. Ayyub, M. Elsibaie, and T. Omar. (2022). “Connectedness Efficiency Analysis of Weighted U.S. Freight Railroad Networks.” ASCE-ASME J Risk Uncert Engrg Sys Part B Mech Engrg, 8 (4). https://doi.org/10.1115/1.4054326.
Jordan, C. (1869). “Sur les assemblages de lignes.” J. Für Reine Angew. Math., 70: 185–190.
Latora, V., and M. Marchiori. (2001). “Efficient Behavior of Small-World Networks.” Phys. Rev. Lett., 87 (19): 198701. American Physical Society. https://doi.org/10.1103/PhysRevLett.87.198701.
Newman, M. (2010). Networks: An Introduction. Oxford; New York: Oxford University Press.
Newman, M. E. J. (2001). “Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality.” Phys. Rev. E, 64 (1): 016132. American Physical Society. https://doi.org/10.1103/PhysRevE.64.016132.
Newman, M. E. J. (2004). “Analysis of weighted networks.” Phys. Rev. E, 70 (5): 056131. American Physical Society. https://doi.org/10.1103/PhysRevE.70.056131.
Peixoto, T. (2020). “Graph-tool performance comparison.” https://graph-tool.skewed.de/performance.
Seidel, R. (1995). “On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs.” J. Comput. Syst. Sci., 51 (3): 400–403. https://doi.org/10.1006/jcss.1995.1078.
Wang, J., M. Lu, F. Belardo, and M. Randić. (2018). “The anti-adjacency matrix of a graph: Eccentricity matrix.” Discrete Appl. Math., 251: 299–309. https://doi.org/10.1016/j.dam.2018.05.062.
West, D. B. (2000). Introduction to Graph Theory. Upper Saddle River, N.J: Pearson College.

Information & Authors

Information

Published In

Go to ASCE Inspire 2023
ASCE Inspire 2023
Pages: 692 - 701

History

Published online: Nov 14, 2023

Permissions

Request permissions for this article.

ASCE Technical Topics:

Authors

Affiliations

Sherief M. Elsibaie, S.M.ASCE [email protected]
1Center for Technology and Systems Management, Dept. of Civil and Environmental Engineering, Univ. of Maryland, College Park, MD. Email: [email protected]
Yujie Mao, S.M.ASCE
2Center for Technology and Systems Management, Dept. of Civil and Environmental Engineering, Univ. of Maryland, College Park, MD
Bilal M. Ayyub, Ph.D., P.E., Dist.M.ASCE
3Center for Technology and Systems Management, Dept. of Civil and Environmental Engineering, Univ. of Maryland, College Park, MD
Yating Zhang, Ph.D., S.M.ASCE
4Center for Technology and Systems Management, Dept. of Civil and Environmental Engineering, Univ. of Maryland, College Park, MD
Tarek Omar, Ph.D.
5Federal Railroad Administration, US Dept. of Transportation, Washington, DC

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Paper
$35.00
Add to cart
Buy E-book
$230.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Paper
$35.00
Add to cart
Buy E-book
$230.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share