Modeling Marshaling Yard Processes with M/HypoK/1/m Queuing Model Under Failure Conditions
Source abstract
Abstract
This study presents a comprehensive analysis of the M/HypoK/1/m queuing model to evaluate the performance of marshaling yards in freight rail classification systems. The model effectively captures the complex, multi-phase nature of service and repair processes by incorporating hypo-exponential probability distributions. The marshaling yard is modeled as a finite-capacity, single-server queue subject to potential server failures, reflecting real-world disruptions. Two complementary methodological frameworks are employed: a mathematical model based on continuous-time Markov chains (CTMCs) and a simulation model constructed using Colored Petri Nets (CPNs). In the analytical approach, both service time and repair time follow hypo-exponential distributions, which are used to approximate the gamma distribution. The simulation model built in CPN Tools allows for dynamic visualization and performance evaluation. In the CPN model, we applied a gamma distribution, which allowed us to evaluate the accuracy of the approximation implemented in the analytical model. The result indicated that utilization of the marshaling yard in primary shunting was approximately 23.81%, and with secondary shunting, 22.53%. The study output proves that the hypo-exponential distribution is able to approximate the gamma distribution. This dual-framework approach, combining analytics with simulation, provides a deeper understanding of system behavior, supporting data-driven decisions for capacity planning, failure mitigation, and operational optimization in freight rail networks.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Railway Systems and Energy Efficiency · Software System Performance and Reliability · Petri Nets in System Modeling
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Institute of Transport, Faculty of Mechanical Engineering, VSB—Technical University of Ostrava, 17. listopadu 15/2172, 708 00 Ostrava, Czech Republic
Funding
Faculty of Mechanical Engineering, VSB—Technical University of Ostrava
References (31)
Show source-provided references
1. Routing and scheduling of trains and engines in a railway marshalling station yard10.1016/j.trc.2024.104826 ↗
2. Optimization of Classification Track Assignment Considering Block Sequence at Train Marshaling Yard10.1155/2018/3802032 ↗
3. Zharkov, M., Lempert, A., and Pavidis, M. (2020). Simulation of Railway Marshalling Yards Based on Four-Phase Queuing Systems. Information Technologies and Mathematical Modelling, Queueing Theory and Applications,19th International Conference, ITMM 2020, Springer.10.1007/978-3-030-72247-0_11 ↗
4. Assessment of rail freight transport service quality
5. Model for the Optimization of Technology and Capacity in Marshalling Station
6. The Maintenance Location Choice Problem for railway rolling stock
7. Quantifying the Influence of Volume Variability on Railway Hump Classification Yard Performance with AnyLogic Simulation10.1177/03611981231160178 ↗
8. Utilizing phase-type distributions for queueing-based railway junction performance determination
9. A quasi-birth-and-death process approach for integrated capacity and reliability modeling of railway systems
10. Tsyganov, S.A., Romanova, P.B., and Salamova, A. (2023). Development of a Simulation Model of a Marshalling Yard. BIO Web of Conferences, EDP Sciences.10.1051/bioconf/20236304007 ↗
11. Railcar itinerary optimization in railway marshalling yards: A graph neural network based deep reinforcement learning method10.1016/j.trc.2024.104970 ↗
12. Zhao, Y., and Lin, B. (2020). Optimization of the classification yard location problem based on train service network. Symmetry, 12.10.3390/sym12060872 ↗
13. Chen, W., Yang, W., and Zhang, G. (2022). Track Utilization Optimization Method for Arrival Yard of Marshalling Station Considering Arrival and Break-Up Coordination Operation. Mathematics, 10.10.3390/math10183289 ↗
14. Railroad Classification Yard Throughput: The Case of Multistage Triangular Sorting10.1016/0191-2607(83)90063-8 ↗
15. Designing Optimal Railroad Operating Plans: Lagrangian Relaxation and Heuristic Approaches10.1016/0191-2615(89)90042-8 ↗
16. Discrete Optimization A solvable queueing network model for railway networks and its validation and applications for the Netherlands10.1016/S0377-2217(01)00269-7 ↗
17. Multistage methods for freight train classification10.1002/net.20385 ↗
18. Bychkov, I., Kazakov, A., Lempert, A., and Zharkov, M. (2021). Modeling of railway stations based on queuing networks. Appl. Sci., 11.10.3390/app11052425 ↗
19. Hypoexponential Distribution with Different Parameters10.4236/am.2013.44087 ↗
20. Some properties of hypoexponential distribution with stabilizer constant
21. Numerical methods and hypoexponential approximations for gamma distributed delay differential equations10.1093/imamat/hxac027 ↗
22. Yanev, G.P. (2020). Exponential and hypoexponential distributions: Some characterizations. Mathematics, 8.10.3390/math8122207 ↗
23. Wrapped hypo-exponential distribution
24. Distribution of the sum of gamma mixture random variables10.55937/sut/1717586953 ↗
25. A new family of distributions based on the hypoexponential distribution with applications
26. On The Product of Two Hypoexponential Random Variables10.54729/2959-331X.1008 ↗
27. A Modified-Form Expressions for the Hypoexponential Distribution10.9734/BJMCS/2014/6317 ↗
28. Stewart, W.J. (2009). Probability, Markov Chains, Queues, and Simulation, Princeton University Press.10.1515/9781400832811 ↗
29. Modelling of freight trains classification using queueing system subject to breakdowns10.1155/2013/307652 ↗
30. Bardossy, M.G. (2015, January 21–23). Analysis of hump operation at a Railroad classification yard. Proceedings of the SIMULTECH 2015-5th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Colmar, France.
31. Coloured Petri Nets and CPN Tools for Modelling and Validation of Concurrent Systems10.1007/s10009-007-0038-x ↗