Identification of Critical Track Sections in a Railway Station Using a Multiplex Networks Approach
Abstract
:1. Introduction
- Development of an RSMN model that integrates three operationally distinct layers—TR, ER, and SR—derived from IT data. This model provides a theoretical foundation for railway station topology modeling, capturing the multi-layered interdependencies inherent in railway operations and enabling a more comprehensive representation of track utilization patterns.
- Introduction of an FC metric, which combines connection count and connectivity efficiency while incorporating railway-specific topological characteristics. This extension enriches the evaluation framework, allowing for a more accurate and operationally relevant assessment of track section importance, thereby improving the robustness and precision of node ranking results.
- Implementation of a PCA-TOPSIS hybrid algorithm for objective multi-criteria decision analysis, further enhanced by a SHAP-based interpretability framework. This approach overcomes the limitations of single-metric evaluations, ensuring a more balanced and holistic ranking of track sections. Moreover, the SHAP-based contribution analysis provides transparent and interpretable insights into the influence of different factors, thereby enhancing the reliability and credibility of HiSORTS identification.
2. Methods
2.1. Overview of the Proposed Methodology
2.2. Construction Method of the RSMN
2.3. Calculation Method of Classical Evaluation Metrics
- A.
- Degree Centrality (DC)
- B.
- Betweenness Centrality (BC)
- C.
- Closeness Centrality (CC)
- D.
- Katz Centrality (KC)
- E.
- PageRank (PR)
2.4. Calculation Method of Custom Evaluation Metrics
Algorithm 1: Calculation of the Connection-Count-Based Improved Shortest-Path Matrix of the -th layer network () | |
Input: : The Adjacency Matrix of the -th layer network; : The Connection Count Matrix of the -th layer network. | |
Output: : The Connection-Count-Based Improved Shortest-Path Matrix of the -th layer network | |
1 | Initialize |
2 | Foreach do |
3 | Calculation of the Shortest-Path Matrix from node s to node t by |
4 | |
5 | Foreach do |
6 | |
7 | Iterate through every adjacent pair of nodes p and q along |
8 | |
9 | End Foreach |
10 | |
11 | End Foreach |
12 | |
13 | End Foreach |
2.5. Identification Method in Single-Layer Networks Based on PCA
2.6. Identification Method in the RSMN Based on TOPSIS
Algorithm 2: Identification of HiSORTS in the RSMN based on TOPSIS | |
Input: M: The number of layers in the TSMN; N: The number of nodes in the TSMN; : The overall ranking of all nodes in the m-th layer network, determined by PCA; : Weight vector for the m-th layer network satisfying ; : An array specifying the type of each layer, with each entry designated as either “benefit” or “cost”. | |
Output: : ranking of track sections based on static occupancy rates using the TOPSIS method | |
1 | # Step 1: Construct Multi-Attribute Matrix |
2 | Initialize |
3 | Foreach do |
4 | Foreach do |
5 | |
6 | End Foreach |
7 | End Foreach |
8 | # Step 2: Normalize the multi-attribute matrix |
9 | |
10 | Foreach do |
11 | |
12 | End Foreach |
13 | # Step 3: Evaluate and rank nodes with TOPSIS |
14 | Construct the weighted normalized multi-attribute matrix |
15 | Initialize |
16 | Foreach do |
17 | |
18 | End Foreach |
19 | # Step 4: Determine the ideal () and negative ideal () solutions |
20 | Initialize |
21 | For do |
22 | If equals “benefit” then |
23 | |
24 | Else If equals “cost” then |
25 | |
26 | End If |
27 | End For |
28 | # Step 5: Compute the separation measures (Euclidean distances) |
29 | Initialize |
30 | For to do |
31 | |
32 | |
33 | End For |
34 | # Step 6: Calculate the relative closeness to the ideal solution |
35 | Initialize |
36 | For do |
37 | |
38 | End For |
3. Case Study
3.1. Station Selection
3.2. Construction of the RSMN
3.3. Result Analysis
3.3.1. Calculation Results of Classic and Custom Evaluation Metrics
3.3.2. Identification Results in Single-Layer Network Based on PCA
3.3.3. Identification Results in the RSMN Based on TOPSIS
- (1)
- Analysis of Identification Results
- (2)
- Analysis of Metric Contributions
4. Discussion
4.1. Advantages of the Proposed Method
- A More Comprehensive Yard Modeling Framework
- A More Scientifically Rigorous Network Centrality Metric
- Combining PCA and TOPSIS to Overcome Traditional Limitations
- Flexible and Practical Analysis Framework
4.2. Limitations and Areas for Improvement
- Lack of Consideration for Temporal Dynamics
- Simplified Weight Allocation in TOPSIS
- No Consideration of Special Cases
4.3. Future Research Directions
- Incorporation of Temporal Dynamic Networks
- Extension to Multi-station Network Analysis
- Integration of Machine Learning for Model Optimization
- Incorporation of Special Cases
- Exploring Multi-Criteria Optimization for Enhanced Decision-Making
- Development of Predictive Decision Support Systems
- Incorporation of Additional Operational Metrics
5. Conclusions
Author Contributions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
Abbreviations
RSMN | Railway Station Multiplex Networks |
MCDM | Multi-Criteria Decision-Making |
IT | Interlocking Table(s) |
TR | Train Routes |
ER | Extended Routes |
SR | Shunting Routes |
AM | Adjacency Matrix |
CCM | Connection Count Matrix |
HiSORTS | Track Sections with Highest Static Occupancy Rates |
FC | Fusion Centrality |
ISP_CCM | Connection-Count-Based Improved Shortest Path Matrix |
PCA | Principal Component Analysis |
TOPSIS | Technique for Order Preference by Similarity to Ideal Solution |
SHAP | SHapley Additive exPlanations |
References
- Zemp, S.; Stauffacher, M.; Lang, D.J.; Scholz, R.W. Generic Functions of Railway Stations—A Conceptual Basis for the Development of Common System Understanding and Assessment Criteria. Transp. Policy 2011, 18, 446–455. [Google Scholar] [CrossRef]
- Wang, W.; Cai, K.; Du, W.; Wu, X.; Tong, L.; Zhu, X.; Cao, X. Analysis of the Chinese Railway System as a Complex Network. Chaos Solitons Fractals 2020, 130, 109408. [Google Scholar] [CrossRef]
- Song, H.; Li, L.; Li, Y.; Tan, L.; Dong, H. Functional Safety and Performance Analysis of Autonomous Route Management for Autonomous Train Control System. IEEE Trans. Intell. Transp. Syst. 2024, 25, 13291–13304. [Google Scholar] [CrossRef]
- Stenström, C. Operation and Maintenance Performance of Rail Infrastructure: Model and Methods. Ph.D. Thesis, Luleå University of Technology, Luleå, Sweden, 2014. [Google Scholar]
- Song, H.; Gao, S.; Li, Y.; Liu, L.; Dong, H. Train-Centric Communication Based Autonomous Train Control System. IEEE Trans. Intell. Veh. 2023, 8, 721–731. [Google Scholar] [CrossRef]
- Xiangxian, C.; Yulin, H.; Hai, H. A Component-Based Topology Model for Railway Interlocking Systems. Math. Comput. Simul. 2011, 81, 1892–1900. [Google Scholar] [CrossRef]
- Wang, D.; Chen, X.; Huang, H. A Graph Theory-Based Approach to Route Location in Railway Interlocking. Comput. Ind. Eng. 2013, 66, 791–799. [Google Scholar] [CrossRef]
- Ki, H.; Park, D.; Kim, D.; Kim, H. Estimation of Line Utilization Rate and Track Maintenance Time of Conventional Railway. J. Korean Soc. Railw. 2012, 15, 638–644. [Google Scholar] [CrossRef]
- Ristic, I. Automated Development of Railway Signalling Control Tables: A Case Study from Serbia. MITS 2023, 2, 227–235. [Google Scholar] [CrossRef]
- Tombs, D.; Robinson, N.; Nikandros, G. Signalling Control Table Generation and Verification. In Proceedings of the Cost Efficient Railways Through Engineering: CORE 2002: Conference on Railway Engineering, Wollongong, NSW, Australia, 10–13 November 2002; Citeseer: Wollongong, NSW, Australia, 2002; p. 10. [Google Scholar]
- Kavička, A.; Krýže, P. Dynamic Automated Search of Shunting Routes Within Mesoscopic Rail-Traffic Simulators. J. Adv. Transp. 2021, 2021, 8840516. [Google Scholar] [CrossRef]
- Ding, R.; Ujang, N.; Hamid, H.B.; Wu, J. Complex Network Theory Applied to the Growth of Kuala Lumpur’s Public Urban Rail Transit Network. PLoS ONE 2015, 10, e0139961. [Google Scholar] [CrossRef]
- Xing, Y.; Lu, J.; Chen, S.; Dissanayake, S. Vulnerability Analysis of Urban Rail Transit Based on Complex Network Theory: A Case Study of Shanghai Metro. Public Transp. 2017, 9, 501–525. [Google Scholar] [CrossRef]
- Zhang, L.; Lu, J.; Fu, B.; Li, S. A Review and Prospect for the Complexity and Resilience of Urban Public Transit Network Based on Complex Network Theory. Complexity 2018, 2018, 2156309. [Google Scholar] [CrossRef]
- Jia, G.-L.; Ma, R.-G.; Hu, Z.-H. Urban Transit Network Properties Evaluation and Optimization Based on Complex Network Theory. Sustainability 2019, 11, 2007. [Google Scholar] [CrossRef]
- Ding, R.; Ujang, N.; Hamid, H.B.; Manan, M.S.A.; Li, R.; Albadareen, S.S.M.; Nochian, A.; Wu, J. Application of Complex Networks Theory in Urban Traffic Network Researches. Netw. Spat. Econ. 2019, 19, 1281–1317. [Google Scholar] [CrossRef]
- Wang, W.; Wang, Y.; Wang, G.; Li, M.; Jia, L. Identification of the Critical Accident Causative Factors in the Urban Rail Transit System by Complex Network Theory. Phys. A Stat. Mech. Its Appl. 2023, 610, 128404. [Google Scholar] [CrossRef]
- Song, J.; Ding, J.; Gui, X.; Zhu, Y. Assessment and Solutions for Vulnerability of Urban Rail Transit Network Based on Complex Network Theory: A Case Study of Chongqing. Heliyon 2024, 10, e27237. [Google Scholar]
- Zanin, M.; Lillo, F. Modelling the Air Transport with Complex Networks: A Short Review. Eur. Phys. J. Spec. Top. 2013, 215, 5–21. [Google Scholar] [CrossRef]
- Wang, H.; Song, Z.; Wen, R.; Zhao, Y. Study on Evolution Characteristics of Air Traffic Situation Complexity Based on Complex Network Theory. Aerosp. Sci. Technol. 2016, 58, 518–528. [Google Scholar] [CrossRef]
- Dai, L.; Derudder, B.; Liu, X. The Evolving Structure of the Southeast Asian Air Transport Network Through the Lens of Complex Networks, 1979–2012. J. Transp. Geogr. 2018, 68, 67–77. [Google Scholar] [CrossRef]
- Sallan, J.M.; Lordan, O. Air Route Networks Through Complex Networks Theory; Elsevier: Amsterdam, The Netherlands, 2019. [Google Scholar]
- Bombelli, A.; Santos, B.F.; Tavasszy, L. Analysis of the Air Cargo Transport Network Using a Complex Network Theory Perspective. Transp. Res. Part E Logist. Transp. Rev. 2020, 138, 101959. [Google Scholar] [CrossRef]
- Lin, J.; Ban, Y. Complex Network Topology of Transportation Systems. Transp. Rev. 2013, 33, 658–685. [Google Scholar] [CrossRef]
- Wandelt, S.; Wang, Z.; Sun, X. Worldwide Railway Skeleton Network: Extraction Methodology and Preliminary Analysis. IEEE Trans. Intell. Transp. Syst. 2016, 18, 2206–2216. [Google Scholar] [CrossRef]
- Liu, J.; Zheng, W.; Li, K.; Wu, D. Complex Network Theory-based Evaluation Method for Hazard Causal Factors of High-speed Railway Signaling Systems. J. China Railw. Soc. 2021, 7, 87–94. [Google Scholar] [CrossRef]
- Qian, L.; Huidi, J. Exploring the Characteristics of High-Speed RAILWAY Network Based on Complex Network Theory. In Proceedings of the 2020 IEEE 5th International Conference on Intelligent Transportation Engineering (ICITE), Beijing, China, 11–13 September 2020; IEEE: Piscataway, NJ, USA, 2020; pp. 200–204. [Google Scholar]
- Liu, J.; Schmid, F.; Zheng, W.; Zhu, J. Understanding Railway Operational Accidents Using Network Theory. Reliab. Eng. Syst. Saf. 2019, 189, 218–231. [Google Scholar] [CrossRef]
- Lee, S.; Kim, S.; Kim, J. Robustness Analysis of Public Transportation Systems in Seoul Using General Multilayer Network Models. J. Supercomput. 2024, 80, 26589–26613. [Google Scholar] [CrossRef]
- Ivaschenko, A.; Maslennikov, S.; Stolbova, A.; Golovnin, O. Multi-Layer Data Model for Transportation Logistics Solutions. In Proceedings of the 2020 26th Conference of Open Innovations Association (FRUCT), Yaroslavl, Russia, 20–24 April 2020; IEEE: Piscataway, NJ, USA, 2020; pp. 124–129. [Google Scholar]
- Wang, C.; Xia, Y.; Zhu, L. A Method for Identifying the Important Node in Multi-Layer Logistic Networks. Front. Phys. 2022, 10, 968645. [Google Scholar] [CrossRef]
- De Domenico, M.; Solé-Ribalta, A.; Cozzo, E.; Kivelä, M.; Moreno, Y.; Porter, M.A.; Gómez, S.; Arenas, A. Mathematical Formulation of Multilayer Networks. Phys. Rev. X 2013, 3, 041022. [Google Scholar] [CrossRef]
- Kivela, M.; Arenas, A.; Barthelemy, M.; Gleeson, J.P.; Moreno, Y.; Porter, M.A. Multilayer Networks. J. Complex Netw. 2014, 2, 203–271. [Google Scholar] [CrossRef]
- Boccaletti, S.; Bianconi, G.; Criado, R.; Del Genio, C.I.; Gómez-Gardeñes, J.; Romance, M.; Sendiña-Nadal, I.; Wang, Z.; Zanin, M. The Structure and Dynamics of Multilayer Networks. Phys. Rep. 2014, 544, 1–122. [Google Scholar] [CrossRef]
- Ghariblou, S.; Salehi, M.; Magnani, M.; Jalili, M. Shortest Paths in Multiplex Networks. Sci. Rep. 2017, 7, 2142. [Google Scholar] [CrossRef]
- Li, Z.; Tang, J.; Feng, T.; Liu, B.; Cao, J.; Yu, T.; Ji, Y. Investigating Urban Mobility through Multi-Source Public Transportation Data: A Multiplex Network Perspective. Appl. Geogr. 2024, 169, 103337. [Google Scholar] [CrossRef]
- Li, Z.; Yuan, C.; Tang, J.; Zhu, K.; Pan, X. Understanding the Mobility of Public Transport Systems Based on Weighted Multiplex Networks. Phys. A Stat. Mech. Its Appl. 2023, 624, 128977. [Google Scholar] [CrossRef]
- Ma, Y.; Sallan, J.M.; Lordan, O. Rail Transit Networks and Network Motifs: A Review and Research Agenda. Sustainability 2024, 16, 3641. [Google Scholar] [CrossRef]
- Mirchev, M.J. Spectra of Multilayer Networks-Mathematical Foundations, Metrics, Spectral Properties. Electrotech. Electron. (E + E) 2019, 54, 49–56. [Google Scholar]
- Gao, P.; Zheng, W.; Liu, J.; Wu, D. Research on Modeling and Analysis Methods of Railway Station Yard Diagrams Based on Multi-Layer Complex Networks. Appl. Sci. 2025, 15, 2324. [Google Scholar] [CrossRef]
- Zhang, J.; Luo, Y. Degree Centrality, Betweenness Centrality, and Closeness Centrality in Social Network. In Proceedings of the 2017 2nd International Conference on Modelling, Simulation and Applied Mathematics (MSAM2017), Bangkok, Thailand, 26–27 March 2017; Atlantis Press: Dordrecht, The Netherlands, 2017; pp. 300–303. [Google Scholar]
- Bródka, P.; Skibicki, K.; Kazienko, P.; Musiał, K. A Degree Centrality in Multi-Layered Social Network. In Proceedings of the 2011 International Conference on Computational Aspects of Social Networks (CASoN), Salamanca, Spain, 19–21 October 2011; IEEE: Piscataway, NJ, USA, 2011; pp. 237–242. [Google Scholar]
- Feng, Y.; Wang, H.; Chang, C.; Lu, H. Intrinsic Correlation with Betweenness Centrality and Distribution of Shortest Paths. Mathematics 2022, 10, 2521. [Google Scholar] [CrossRef]
- Zhang, Y.; Bao, Y.; Zhao, S.; Chen, J.; Tang, J. Identifying Node Importance by Combining Betweenness Centrality and Katz Centrality. In Proceedings of the 2015 International Conference on Cloud Computing and Big Data (CCBD), Shanghai, China, 4–6 November 2015; IEEE: Piscataway, NJ, USA, 2015; pp. 354–357. [Google Scholar]
- Zhan, J.; Gurung, S.; Parsa, S.P.K. Identification of Top-K Nodes in Large Networks Using Katz Centrality. J. Big Data 2017, 4, 16. [Google Scholar] [CrossRef]
- Qu, H.; Song, Y.-R.; Li, R.; Li, M.; Jiang, G.-P. Node Ranking Based on Graph Curvature and PageRank. Chin. Phys. B 2024, 34, 028901. [Google Scholar] [CrossRef]
- Zhang, Y.; Lu, Y.; Yang, G.; Hang, Z. Multi-Attribute Decision Making Method for Node Importance Metric in Complex Network. Appl. Sci. 2022, 12, 1944. [Google Scholar] [CrossRef]
- Lilin, Q.; Muqing, W.; Min, Z. Identification of Key Nodes in Complex Networks. In Proceedings of the 2021 7th International Conference on Computer and Communications (ICCC), Chengdu, China, 10–13 December 2021; IEEE: Piscataway, NJ, USA, 2021; pp. 2230–2234. [Google Scholar]
- Jiang, C.; Sun, Q.; Ye, T.; Wang, Q. Identification of Systemically Important Financial Institutions in a Multiplex Financial Network: A Multi-Attribute Decision-Based Approach. Phys. A Stat. Mech. Its Appl. 2023, 611, 128446. [Google Scholar] [CrossRef]
- Zhao, X.; Zhang, Y.; Zhai, Q.; Zhang, J.; Qi, L. A Multi-Attribute Decision-Making Approach for Critical Node Identification in Complex Networks. Entropy 2024, 26, 1075. [Google Scholar] [CrossRef] [PubMed]
- Abdi, H.; Williams, L.J. Principal Component Analysis. WIREs Comput. Stats. 2010, 2, 433–459. [Google Scholar] [CrossRef]
- Hu, J.; Du, Y.; Mo, H.; Wei, D.; Deng, Y. A Modified Weighted TOPSIS to Identify Influential Nodes in Complex Networks. Phys. A Stat. Mech. Its Appl. 2016, 444, 73–85. [Google Scholar] [CrossRef]
- Li, X.; Han, Y.; Wu, X.; Zhang, D.A. Evaluating Node Importance in Complex Networks Based on TOPSIS and Gray Correlation. In Proceedings of the 2018 Chinese Control And Decision Conference (CCDC), Shenyang, China, 9–11 June 2018; IEEE: Piscataway, NJ, USA, 2018; pp. 750–754. [Google Scholar]
- Akram, M.; Kahraman, C.; Zahid, K. Extension of TOPSIS Model to the Decision-Making Under Complex Spherical Fuzzy Information. Soft Comput. 2021, 25, 10771–10795. [Google Scholar] [CrossRef]
- Liu, L.; Wan, X.; Li, J.; Wang, W.; Gao, Z. An Improved Entropy-Weighted Topsis Method for Decision-Level Fusion Evaluation System of Multi-Source Data. Sensors 2022, 22, 6391. [Google Scholar] [CrossRef]
- Mosca, E.; Szigeti, F.; Tragianni, S.; Gallagher, D.; Groh, G. SHAP-Based Explanation Methods: A Review for NLP Interpretability. In Proceedings of the 29th International Conference on Computational Linguistics, Gyeongju, Republic of Korea, 12–17 October 2022; Calzolari, N., Huang, C.-R., Kim, H., Pustejovsky, J., Wanner, L., Choi, K.-S., Ryu, P.-M., Chen, H.-H., Donatelli, L., Ji, H., et al., Eds.; International Committee on Computational Linguistics: Gyeongju, Republic of Korea, 2022; pp. 4593–4603. [Google Scholar]
- Marcilio, W.E.; Eler, D.M. From Explanations to Feature Selection: Assessing SHAP Values as Feature Selection Mechanism. In Proceedings of the 2020 33rd SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI), Porto de Galinhas, Brazil, 7–10 November 2020; pp. 340–347. [Google Scholar]
- Wang, H.; Liang, Q.; Hancock, J.T.; Khoshgoftaar, T.M. Feature Selection Strategies: A Comparative Analysis of SHAP-Value and Importance-Based Methods. J. Big Data 2024, 11, 44. [Google Scholar] [CrossRef]
- Hagberg, A.; Swart, P.J.; Schult, D.A. Exploring Network Structure, Dynamics, and Function Using NetworkX. In Proceedings of the 7th Python in Science Conference (SciPy2008), Pasadena, CA, USA, 19–24 August 2008; Los Alamos National Laboratory (LANL): Los Alamos, NM, USA, 2008; pp. 11–15. [Google Scholar]
- Platt, E.L. Network Science with Python and NetworkX Quick Start Guide: Explore and Visualize Network Data Effectively; Packt Publishing Ltd.: Birmingham, UK, 2019; ISBN 978-1-78995-531-6. [Google Scholar]
- Kouvaris, N.E.; Hata, S.; Guilera, A.D. Pattern Formation in Multiplex Networks. Sci. Rep. 2015, 5, 10840. [Google Scholar] [CrossRef]
- Butler, H.; Daly, M.; Doyle, A.; Gillies, S.; Schaub, T.; Hagen, S. RFC Editor. In RFC 7946: The GeoJSON Format; IETF Administration LLC: Wilmington, DE, USA, 2016; p. 28. [Google Scholar] [CrossRef]
- Mukherjee, C.; Mukherjee, G. Role of Adjacency Matrix in Graph Theory. IOSR J. Comput. Eng. 2014, 16, 58–63. [Google Scholar] [CrossRef]
- China Railway Corporation. Principles for Compiling Interlocking Diagrams for Computer Interlocking Stations: Q/CR 654-2018; China Railway Corporation: Beijing, China, 2018. [Google Scholar]
Route Type | Direction | Start | End | Track Sections |
---|---|---|---|---|
Train Routes (TRs) | Dispatch/UP | IG | IIAG | IG, 55-61DG, 29-31DG, 27-33DG, 21DG, 9DG, IIAG |
Dispatch/UP | IG | IIAG | IG, 55-61DG, 29-31DG, 11-23DG, 9DG, IIAG | |
Dispatch/UP | IG | IIAG | IG, 55-61DG, 57-59DG, 25-43DG, 11-23DG, 9DG, IIAG | |
Dispatch/UP | IIG | IIAG | IIG, 51DG, 27-33DG, 21DG, 9DG, IIAG | |
… (175 train routes in total) | ||||
Extended Routes (ERs) | SII Signal to X Signal | 51DG | IAG | 51DG, 27-33DG, 29-31DG, 11-23DG, 1-7DG, IAG |
SII Signal to XF Signal | 51DG | IIAG | 51DG, 27-33DG, 21DG, 9DG, IIAG | |
SII Signal to Locomotive Track | 51DG | D9G | 51DG, 27-33DG, 21DG, 19DG, D9G | |
SIV Signal to XD Signal | 53-63DG | IIIAG | 53-63DG, 51DG, 27-33DG, 29-31DG, 11-23DG, 1-7DG, 3-5DG, IIIAG | |
… (18 extended routes in total) | ||||
Shunting Routes (SRs) | D3 Signal to D21 Signal | 3-5DG | 11-23DG | 3-5DG, 1-7DG, 11-23DG |
D3 Signal to D35 Signal | 3-5DG | 25-43DG | 3-5DG, 1-7DG, 11-23DG, 25-43DG | |
D3 Signal to D37 Signal | 3-5DG | 49DG | 3-5DG, 1-7DG, 11-23DG, 25-43DG, 37-47DG, 49DG | |
D3 Signal to S5 Signal | 3-5DG | 37-47DG | 3-5DG, 1-7DG, 11-23DG, 25-43DG, 37-47DG | |
… (204 shunting routes in total) | ||||
… (Additionally, it also includes combined train routes, push routes, and others.) |
Rank | TR Network | ER Network | SR Network | |||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
DC | BC | CC | KC | PR | FC | DC | BC | CC | KC | PR | FC | DC | BC | CC | KC | PR | FC | |
1 | 47 | 18 | 18 | 47 | 47 | 58 | 13 | 12 | 9 | 12 | 36 | 13 | 47 | 4 | 4 | 47 | 4 | 2 |
2 | 46 | 19 | 13 | 51 | 58 | 56 | 12 | 13 | 2 | 9 | 29 | 12 | 4 | 11 | 11 | 51 | 14 | 15 |
3 | 11 | 52 | 19 | 50 | 1 | 61 | 10 | 4 | 29 | 13 | 2 | 10 | 51 | 14 | 3 | 4 | 11 | 9 |
4 | 53 | 11 | 32 | 53 | 46 | 36 | 1 | 10 | 36 | 2 | 12 | 16 | 50 | 3 | 1 | 11 | 10 | 10 |
5 | 50 | 32 | 4 | 52 | 4 | 62 | 17 | 1 | 12 | 10 | 28 | 4 | 11 | 12 | 14 | 50 | 1 | 1 |
6 | 4 | 13 | 12 | 4 | 52 | 59 | 11 | 16 | 10 | 29 | 9 | 1 | 10 | 13 | 10 | 54 | 3 | 3 |
7 | 51 | 4 | 52 | 11 | 2 | 7 | 2 | 17 | 13 | 4 | 5 | 17 | 46 | 10 | 2 | 10 | 47 | 14 |
8 | 52 | 16 | 11 | 46 | 50 | 63 | 9 | 11 | 3 | 36 | 13 | 11 | 53 | 51 | 54 | 46 | 15 | 4 |
9 | 57 | 14 | 16 | 1 | 53 | 67 | 16 | 2 | 33 | 3 | 1 | 2 | 52 | 1 | 15 | 3 | 51 | 11 |
10 | 14 | 12 | 53 | 57 | 51 | 23 | 4 | 14 | 4 | 1 | 33 | 14 | 61 | 53 | 51 | 49 | 53 | 46 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Gao, P.; Zheng, W.; Liu, J.; Wu, D. Identification of Critical Track Sections in a Railway Station Using a Multiplex Networks Approach. Mathematics 2025, 13, 1151. https://doi.org/10.3390/math13071151
Gao P, Zheng W, Liu J, Wu D. Identification of Critical Track Sections in a Railway Station Using a Multiplex Networks Approach. Mathematics. 2025; 13(7):1151. https://doi.org/10.3390/math13071151
Chicago/Turabian StyleGao, Pengfei, Wei Zheng, Jintao Liu, and Daohua Wu. 2025. "Identification of Critical Track Sections in a Railway Station Using a Multiplex Networks Approach" Mathematics 13, no. 7: 1151. https://doi.org/10.3390/math13071151
APA StyleGao, P., Zheng, W., Liu, J., & Wu, D. (2025). Identification of Critical Track Sections in a Railway Station Using a Multiplex Networks Approach. Mathematics, 13(7), 1151. https://doi.org/10.3390/math13071151