Pub Date : 2025-12-01Epub Date: 2025-11-12DOI: 10.1016/j.jrtpm.2025.100556
Ruben A. Kuipers , Frida Carlvik , Carl-William Palmqvist , Johan Rahm
One of the major causes of dwell time delays is the behaviour of passengers during the alighting and boarding processes, such as an uneven spread of boarding passengers and queues formed in front of the doors. Therefore, changing the behaviour of passengers so that it does not negatively affect the time needed for alighting and boarding is one of the ways to reduce the risk of dwell time delays. Platform management interventions have the potential to induce such a behavioural change, but the real-world impact is not well studied. To fill this gap, the study presented here investigates the effects of a sticker-based platform intervention using video observations from several hundred trains halting at Lund Central Station. We find that the alighting flow rates slightly increased under intervention conditions, with results suggesting that this is due to fewer overlaps in alighting and boarding passenger flows. No statistically significant effects of the intervention on the spread of boarding passengers were found. Our results suggest that changing the behaviour of passengers is likely to be a slow process, requiring additional efforts such as information provision and ensuring that the halting position of a train accurately reflects the information provided by an intervention.
{"title":"The effect of a platform management intervention on the behaviour of passengers: A case study at Lund Central station","authors":"Ruben A. Kuipers , Frida Carlvik , Carl-William Palmqvist , Johan Rahm","doi":"10.1016/j.jrtpm.2025.100556","DOIUrl":"10.1016/j.jrtpm.2025.100556","url":null,"abstract":"<div><div>One of the major causes of dwell time delays is the behaviour of passengers during the alighting and boarding processes, such as an uneven spread of boarding passengers and queues formed in front of the doors. Therefore, changing the behaviour of passengers so that it does not negatively affect the time needed for alighting and boarding is one of the ways to reduce the risk of dwell time delays. Platform management interventions have the potential to induce such a behavioural change, but the real-world impact is not well studied. To fill this gap, the study presented here investigates the effects of a sticker-based platform intervention using video observations from several hundred trains halting at Lund Central Station. We find that the alighting flow rates slightly increased under intervention conditions, with results suggesting that this is due to fewer overlaps in alighting and boarding passenger flows. No statistically significant effects of the intervention on the spread of boarding passengers were found. Our results suggest that changing the behaviour of passengers is likely to be a slow process, requiring additional efforts such as information provision and ensuring that the halting position of a train accurately reflects the information provided by an intervention.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100556"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145519580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01Epub Date: 2025-09-20DOI: 10.1016/j.jrtpm.2025.100549
Miroslav Prokić , Branislav Bošković
Despite the EU's efforts to enhance the competitiveness of rail freight transport, the lack of coordination and cooperation among governments and infrastructure managers remains a significant barrier. Rail freight corridors, serving as critical arteries for transnational trade and economic integration, are particularly vital for strengthening rail's competitive position in European transport market. This paper proposes the application of cooperative game theory to address the coordination challenges among stakeholders within rail freight corridors. A cooperative game model is developed to evaluate the potential for improving corridor governance through the formation of coalitions among the involved countries. In addition to the Shapley value we introduce two novel allocation rules, termed the proportional rule and the adjusted proportional rule, which are specifically designed to address the railway freight corridor problem by linking allocation of coalition worth to countries' contributions to improving corridor competitiveness. The results of the model suggest that forming coalitions around shared objectives within the cooperative game framework significantly increases the revenues of infrastructure managers and ensures a fairer distribution of the coalition's worth among the participating countries.
{"title":"Enhancing railway corridor governance: Cooperative game model","authors":"Miroslav Prokić , Branislav Bošković","doi":"10.1016/j.jrtpm.2025.100549","DOIUrl":"10.1016/j.jrtpm.2025.100549","url":null,"abstract":"<div><div>Despite the EU's efforts to enhance the competitiveness of rail freight transport, the lack of coordination and cooperation among governments and infrastructure managers remains a significant barrier. Rail freight corridors, serving as critical arteries for transnational trade and economic integration, are particularly vital for strengthening rail's competitive position in European transport market. This paper proposes the application of cooperative game theory to address the coordination challenges among stakeholders within rail freight corridors. A cooperative game model is developed to evaluate the potential for improving corridor governance through the formation of coalitions among the involved countries. In addition to the Shapley value we introduce two novel allocation rules, termed the proportional rule and the adjusted proportional rule, which are specifically designed to address the railway freight corridor problem by linking allocation of coalition worth to countries' contributions to improving corridor competitiveness. The results of the model suggest that forming coalitions around shared objectives within the cooperative game framework significantly increases the revenues of infrastructure managers and ensures a fairer distribution of the coalition's worth among the participating countries.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100549"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145095969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents an innovative integrated optimization model for the train dynamic traction system efficiency (TDTSE) in power-dispersed trains. The model combines a train kinematics model and a TDTSE model to analyze the potential of power unit switching for improving the train traction system (TTS) efficiency. Sequential optimization (SO) and collaborative optimization (CO) methods are designed to focus on optimizing the energy-saving speed profile and power unit switching strategy. Improved dynamic programming (DP) incorporating coasting conditions serves as the foundation for both CO and SO. Simulation results demonstrate that power unit switching significantly reduces energy losses in the TTS. The proposed improved DP method exhibits superior energy-saving capabilities. Compared to the actual train operation, the SO and CO methods achieved energy savings of 20.34 % and 25.42 %, respectively, with CO performing better.
{"title":"An integrated optimization model for energy saving of train speed profile and power unit switching","authors":"Chengcheng Fu, Pengfei Sun, Xinghe Liu, Qingyuan Wang, Xiaoyun Feng","doi":"10.1016/j.jrtpm.2025.100557","DOIUrl":"10.1016/j.jrtpm.2025.100557","url":null,"abstract":"<div><div>This paper presents an innovative integrated optimization model for the train dynamic traction system efficiency (TDTSE) in power-dispersed trains. The model combines a train kinematics model and a TDTSE model to analyze the potential of power unit switching for improving the train traction system (TTS) efficiency. Sequential optimization (SO) and collaborative optimization (CO) methods are designed to focus on optimizing the energy-saving speed profile and power unit switching strategy. Improved dynamic programming (DP) incorporating coasting conditions serves as the foundation for both CO and SO. Simulation results demonstrate that power unit switching significantly reduces energy losses in the TTS. The proposed improved DP method exhibits superior energy-saving capabilities. Compared to the actual train operation, the SO and CO methods achieved energy savings of 20.34 % and 25.42 %, respectively, with CO performing better.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100557"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145571447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01Epub Date: 2025-08-21DOI: 10.1016/j.jrtpm.2025.100539
Tamme Emunds, Nils Nießen
Railway stations serve as critical nodes within railway networks, facilitating connections across diverse travel directions. Traditionally, the analytical performance analysis of railway stations has been divided into two distinct components: the examination of stopping tracks and the evaluation of route nodes, the locations within a station where switches determine the direction of travel. This study introduces an innovative Continuous-Time Markov Chain model that represents a comprehensive queueing system encompassing the entire railway station. By deriving timetable-independent performance indicators, this model provides a robust framework for assessing station performance. Consequently, it equips infrastructure operators with a holistic tool for infrastructure planning and evaluation.
{"title":"A queueing-based approach for timetable-independent railway station performance analysis","authors":"Tamme Emunds, Nils Nießen","doi":"10.1016/j.jrtpm.2025.100539","DOIUrl":"10.1016/j.jrtpm.2025.100539","url":null,"abstract":"<div><div>Railway stations serve as critical nodes within railway networks, facilitating connections across diverse travel directions. Traditionally, the analytical performance analysis of railway stations has been divided into two distinct components: the examination of stopping tracks and the evaluation of route nodes, the locations within a station where switches determine the direction of travel. This study introduces an innovative Continuous-Time Markov Chain model that represents a comprehensive queueing system encompassing the entire railway station. By deriving timetable-independent performance indicators, this model provides a robust framework for assessing station performance. Consequently, it equips infrastructure operators with a holistic tool for infrastructure planning and evaluation.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100539"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144878958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01Epub Date: 2025-10-11DOI: 10.1016/j.jrtpm.2025.100552
Richard Schaeffer , Daria Ivina , Gemma Nicholson , Paul Plummer , Sergeĭ Sergeev
Railway maintenance scheduling requires rigorous planning to ensure harmony between the agents involved. The roles of these agents can vary from country to country; however, the infrastructure manager usually oversees the railway operations and controls access to the railway network for maintenance measures. Trackwork requires time free from train traffic — therefore, this will be the main discussion point of this paper. In particular, the negotiations between infrastructure managers and maintenance undertakers regarding time on track in the capacity allocation process. Irrationality in negotiations for time on track is a consequence of the aims and responsibilities of each agent, as well as imbalance of leverage. This paper models the scenario as a Stackelberg game and solves the problem using methods from bilevel optimisation. The model considers factors that affect leverage, such as the urgency of the works and quality of other available options - e.g. outside parties that may be able to provide a better deal, known as the Best Alternative To a Negotiated Agreement. The results from a worked example using synthetic data provide evidence that there is a significant surplus of utility being left on the table due to non-cooperation between agents, and corrective rather than preventative maintenance.
{"title":"A bilevel programming and bargaining game approach to negotiations regarding time on track for railway maintenance","authors":"Richard Schaeffer , Daria Ivina , Gemma Nicholson , Paul Plummer , Sergeĭ Sergeev","doi":"10.1016/j.jrtpm.2025.100552","DOIUrl":"10.1016/j.jrtpm.2025.100552","url":null,"abstract":"<div><div>Railway maintenance scheduling requires rigorous planning to ensure harmony between the agents involved. The roles of these agents can vary from country to country; however, the infrastructure manager usually oversees the railway operations and controls access to the railway network for maintenance measures. Trackwork requires time free from train traffic — therefore, this will be the main discussion point of this paper. In particular, the negotiations between infrastructure managers and maintenance undertakers regarding time on track in the capacity allocation process. Irrationality in negotiations for time on track is a consequence of the aims and responsibilities of each agent, as well as imbalance of leverage. This paper models the scenario as a Stackelberg game and solves the problem using methods from bilevel optimisation. The model considers factors that affect leverage, such as the urgency of the works and quality of other available options - e.g. outside parties that may be able to provide a better deal, known as the Best Alternative To a Negotiated Agreement. The results from a worked example using synthetic data provide evidence that there is a significant surplus of utility being left on the table due to non-cooperation between agents, and corrective rather than preventative maintenance.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100552"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145265429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01Epub Date: 2025-09-10DOI: 10.1016/j.jrtpm.2025.100548
Yukun Gu, Yuguang Wei, Yang Xia
The increasing passenger demand on certain high-speed railway lines has resulted in strained capacity utilization, posing a challenge for railway operators to optimize train timetables to maximize capacity utilization. This paper investigates the impact of train path sequences on section carrying capacity, as well as how train paths utilize time-space resources of train timetables. The problem of scheduling train timetables is transformed into the problem of node routing, where nodes represent train paths, directed arcs depict the sequential connections between train paths. A train timetable optimization model based on node routing is constructed, with the objective of maximizing the number of trains and the constraint that the total arc weight does not exceed total amount of time-space resources on the train timetable. Then considering the characteristics of the model, this paper designs an optimization algorithm for train timetables, which includes modules for designing train overtaking combinations, quantifying time-space resources, optimizing train path sequences, and scheduling train timetables. The algorithm is tested on the Shanghai-Hangzhou High-speed Railway in China. The computational results prove that the optimization method based on node routing can help railway operators improve the capacity utilization level of high-speed railways. Further, we design a series of experiments to study the impact of train headway times, train running speed, and other factors on the section carrying capacity, reveal the impact mechanisms of these train timetable factors on section carrying capacity, and propose optimization strategies for high-speed train timetables to railway operators.
{"title":"Optimization method for maximizing capacity utilization of high-speed railway train timetable based on node routing model","authors":"Yukun Gu, Yuguang Wei, Yang Xia","doi":"10.1016/j.jrtpm.2025.100548","DOIUrl":"10.1016/j.jrtpm.2025.100548","url":null,"abstract":"<div><div>The increasing passenger demand on certain high-speed railway lines has resulted in strained capacity utilization, posing a challenge for railway operators to optimize train timetables to maximize capacity utilization. This paper investigates the impact of train path sequences on section carrying capacity, as well as how train paths utilize time-space resources of train timetables. The problem of scheduling train timetables is transformed into the problem of node routing, where nodes represent train paths, directed arcs depict the sequential connections between train paths. A train timetable optimization model based on node routing is constructed, with the objective of maximizing the number of trains and the constraint that the total arc weight does not exceed total amount of time-space resources on the train timetable. Then considering the characteristics of the model, this paper designs an optimization algorithm for train timetables, which includes modules for designing train overtaking combinations, quantifying time-space resources, optimizing train path sequences, and scheduling train timetables. The algorithm is tested on the Shanghai-Hangzhou High-speed Railway in China. The computational results prove that the optimization method based on node routing can help railway operators improve the capacity utilization level of high-speed railways. Further, we design a series of experiments to study the impact of train headway times, train running speed, and other factors on the section carrying capacity, reveal the impact mechanisms of these train timetable factors on section carrying capacity, and propose optimization strategies for high-speed train timetables to railway operators.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100548"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145026841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01Epub Date: 2025-10-16DOI: 10.1016/j.jrtpm.2025.100555
Florian Fuchs, Bernardo Martin-Iradi, Francesco Corman
We present a novel microscopic model for railway timetabling designed to maximize periodic stability in mixed single- and multi-track networks. Unlike conventional approaches based on the Periodic Event Scheduling Problem (PESP), our model provides a detailed infrastructure representation with flexible routing and nuanced conflict resolution, enhancing adaptability to real-world constraints and facilitating practical implementation by operators. To ensure scalability, we integrate a Satisfiability Modulo Theories (SMT)-based approach, which efficiently narrows feasible cycle time bounds, enabling the model to handle large-scale networks. Validated on operational data from the Rhätische Bahn network—a Swiss railway with complex infrastructure—the microscopic model consistently yields lower minimal cycle times than its macroscopic counterpart. The comparative analysis also offers insights into the trade-offs between model detail, computational efficiency, and achievable cycle times across diverse operational scenarios. These findings underscore the importance of infrastructure abstraction and the careful consideration of operational and commercial interdependencies for optimal stability in complex railway networks.
{"title":"Optimizing periodic stability in railway timetables: A microscopic model for networks with a macroscopic comparison","authors":"Florian Fuchs, Bernardo Martin-Iradi, Francesco Corman","doi":"10.1016/j.jrtpm.2025.100555","DOIUrl":"10.1016/j.jrtpm.2025.100555","url":null,"abstract":"<div><div>We present a novel microscopic model for railway timetabling designed to maximize periodic stability in mixed single- and multi-track networks. Unlike conventional approaches based on the Periodic Event Scheduling Problem (PESP), our model provides a detailed infrastructure representation with flexible routing and nuanced conflict resolution, enhancing adaptability to real-world constraints and facilitating practical implementation by operators. To ensure scalability, we integrate a Satisfiability Modulo Theories (SMT)-based approach, which efficiently narrows feasible cycle time bounds, enabling the model to handle large-scale networks. Validated on operational data from the Rhätische Bahn network—a Swiss railway with complex infrastructure—the microscopic model consistently yields lower minimal cycle times than its macroscopic counterpart. The comparative analysis also offers insights into the trade-offs between model detail, computational efficiency, and achievable cycle times across diverse operational scenarios. These findings underscore the importance of infrastructure abstraction and the careful consideration of operational and commercial interdependencies for optimal stability in complex railway networks.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100555"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145323873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01Epub Date: 2025-10-15DOI: 10.1016/j.jrtpm.2025.100554
Marta Leonina Tessitore , Marcella Samà , Giorgio Sartor , Carlo Mannino , Dario Pacciarelli
To proactively manage disturbances in railway systems, it is crucial to design robust timetables that can effectively absorb secondary delays. In practice, when route planners are tasked to produce a robust timetable, they usually start from an existing timetable and follow a complicated, iterative, and time-consuming trial-and-error process to build a new one. Given the increase in traffic demand, decision support systems are becoming essential to guide practitioners through this complex task. While several robustness measures have been proposed in the last few years, many overlook the impact of dispatching decisions on knock-on delays, limiting their real-world applicability. In this work, we introduce a fragility-based approach to timetable design, inspired by the concept of fragility recently proposed. Our approach focuses on identifying and addressing the most critical sections of the timetable to enhance the overall robustness. Specifically, we show how timetable fragility can be actually exploited by route planners to design new and more robust timetables. We propose a MILP model that aims to enhance timetable robustness by focusing on its most critical part. Considering real-life scenarios from a Norwegian railway line, our iterative approach demonstrates the ability to enhance timetable robustness, even when employing conservative strategies for potential improvements.
{"title":"An iterative fragility-based approach to timetable design","authors":"Marta Leonina Tessitore , Marcella Samà , Giorgio Sartor , Carlo Mannino , Dario Pacciarelli","doi":"10.1016/j.jrtpm.2025.100554","DOIUrl":"10.1016/j.jrtpm.2025.100554","url":null,"abstract":"<div><div>To proactively manage disturbances in railway systems, it is crucial to design robust timetables that can effectively absorb secondary delays. In practice, when route planners are tasked to produce a robust timetable, they usually start from an existing timetable and follow a complicated, iterative, and time-consuming trial-and-error process to build a new one. Given the increase in traffic demand, decision support systems are becoming essential to guide practitioners through this complex task. While several robustness measures have been proposed in the last few years, many overlook the impact of dispatching decisions on knock-on delays, limiting their real-world applicability. In this work, we introduce a fragility-based approach to timetable design, inspired by the concept of fragility recently proposed. Our approach focuses on identifying and addressing the most critical sections of the timetable to enhance the overall robustness. Specifically, we show how timetable fragility can be actually exploited by route planners to design new and more robust timetables. We propose a MILP model that aims to enhance timetable robustness by focusing on its most critical part. Considering real-life scenarios from a Norwegian railway line, our iterative approach demonstrates the ability to enhance timetable robustness, even when employing conservative strategies for potential improvements.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100554"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145323875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper addresses the problem of passenger flow management in major public transport terminals by proposing a new modeling approach for passenger flows management. Currently, passenger management is done based on the experience of station managers, while existing models generally view the passenger flows as continuous. In contrast, this research proposes modeling the flows of passengers as discrete, according to the behavior of passengers in major transport terminals with non-fixed platform allocation. The problem is modeled as mixed-integer linear programming (MILP) inspired by the alternative graph (AG) model. The case study results show that the model can be used to assess and compare passenger management strategies, for instance, the morning peak case study results show that 578 s of conflict which occur in one strategy can be traded off with 78 s of total tardiness by applying a different strategy. This model can be used to support station managers in assessing complex situations before making management decisions.
{"title":"Assessment of passenger management strategies within major railway terminals","authors":"Nattanon Luangboriboon , Marcella Samà , Andrea D’Ariano , Taku Fujiyama","doi":"10.1016/j.jrtpm.2025.100540","DOIUrl":"10.1016/j.jrtpm.2025.100540","url":null,"abstract":"<div><div>This paper addresses the problem of passenger flow management in major public transport terminals by proposing a new modeling approach for passenger flows management. Currently, passenger management is done based on the experience of station managers, while existing models generally view the passenger flows as continuous. In contrast, this research proposes modeling the flows of passengers as discrete, according to the behavior of passengers in major transport terminals with non-fixed platform allocation. The problem is modeled as mixed-integer linear programming (MILP) inspired by the alternative graph (AG) model. The case study results show that the model can be used to assess and compare passenger management strategies, for instance, the morning peak case study results show that 578 s of conflict which occur in one strategy can be traded off with 78 s of total tardiness by applying a different strategy. This model can be used to support station managers in assessing complex situations before making management decisions.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100540"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145026842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01Epub Date: 2025-10-11DOI: 10.1016/j.jrtpm.2025.100553
Steffi , Sunita Kumawat , Sakshi Gupta , Francesco Flammini
Internet of Things (IoT) has revolutionized sectors such as transportation through enabling smart, interdependent systems that propel operational efficiency, safety, and user experience. Integrating IoT devices, however, into complex systems, for instance, rail networks, exposes such systems to conflict, which negatively impacts performance, safety, and reliability. This paper explores the conflict detection and resolution for IoT-based railway systems using Petri nets, a formal modeling methodology famous for its ability to model and analyze dynamic systems. The current research delves into the inherent challenges of IoT-based railway systems, such as sensor data conflict, network congestion, and interoperability issues between systems. The current work then builds a framework in terms of Petri nets to define the system's components, interaction, and areas of conflict. By modeling the system processes, data flows, and dependencies with Petri nets, the paper identifies conflict scenarios and proposes resolution mechanisms to prevent risks. The key contribution of this paper is the application of Petri net to detect conflicts in real-time by analyzing the operational flow of the system. The paper also proposes a conflict resolution mechanism based on feedback loops and synchronization mechanisms in the Petri net model. By simulation, the research demonstrates that the envisioned framework improves the robustness and reliability of IoT-enabling railway systems while keeping up with effective operations despite the complexities of connecting diverse IoT devices. The paper contributes valuable inputs toward designing resilient IoT-enabled railway systems and establishes grounds for future study in conflict detection and resolution in complex dynamic systems.
{"title":"Conflict detection and resolution in IoT-Enabled railway systems using Petri nets","authors":"Steffi , Sunita Kumawat , Sakshi Gupta , Francesco Flammini","doi":"10.1016/j.jrtpm.2025.100553","DOIUrl":"10.1016/j.jrtpm.2025.100553","url":null,"abstract":"<div><div>Internet of Things (IoT) has revolutionized sectors such as transportation through enabling smart, interdependent systems that propel operational efficiency, safety, and user experience. Integrating IoT devices, however, into complex systems, for instance, rail networks, exposes such systems to conflict, which negatively impacts performance, safety, and reliability. This paper explores the conflict detection and resolution for IoT-based railway systems using Petri nets, a formal modeling methodology famous for its ability to model and analyze dynamic systems. The current research delves into the inherent challenges of IoT-based railway systems, such as sensor data conflict, network congestion, and interoperability issues between systems. The current work then builds a framework in terms of Petri nets to define the system's components, interaction, and areas of conflict. By modeling the system processes, data flows, and dependencies with Petri nets, the paper identifies conflict scenarios and proposes resolution mechanisms to prevent risks. The key contribution of this paper is the application of Petri net to detect conflicts in real-time by analyzing the operational flow of the system. The paper also proposes a conflict resolution mechanism based on feedback loops and synchronization mechanisms in the Petri net model. By simulation, the research demonstrates that the envisioned framework improves the robustness and reliability of IoT-enabling railway systems while keeping up with effective operations despite the complexities of connecting diverse IoT devices. The paper contributes valuable inputs toward designing resilient IoT-enabled railway systems and establishes grounds for future study in conflict detection and resolution in complex dynamic systems.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100553"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145323874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}