Pub Date : 2026-03-01Epub Date: 2026-02-12DOI: 10.1016/j.jrtpm.2026.100571
Pengwei Xi , Yuguang Wei , Pan Wang , Xurui Liu , Yang Xia
High-speed rail (HSR) faces growing competition from aviation. This study proposes a mixed-integer fare optimization model that jointly represents trains and flights on a corridor over a given time window. The model is designed to maximize operator revenue subject to passenger utility constraints, thereby treating passenger behavior as a binding condition rather than a direct optimization objective. Unlike bilevel models that separate upper-level fare setting from lower-level passenger choice, enhanced bounded-rationality constraints are embedded directly in the optimization, integrating pricing and behavior. A multi-layer spatio-temporal price–time network captures competitive interactions, service attributes, and passenger choices across multiple operators and services. Using Beijing–Shanghai data, the model attains an objective value of 8,617,549 in 2984 s. Compared with fixed pricing, HSR revenue increases by 33.38%. The policy also balances flows by raising off-peak seat occupancy (e.g., G103: 87.71%→98.30%) and reducing peak congestion (e.g., G115: 100.00%→89.02%), demonstrating the managerial value of well-designed floating fares for peak–off-peak load balancing and guiding demand-responsive fare design and capacity allocation under intermodal competition.
{"title":"Ticket pricing for high-speed railways in a competitive market with enhanced boundedly rational constraints","authors":"Pengwei Xi , Yuguang Wei , Pan Wang , Xurui Liu , Yang Xia","doi":"10.1016/j.jrtpm.2026.100571","DOIUrl":"10.1016/j.jrtpm.2026.100571","url":null,"abstract":"<div><div>High-speed rail (HSR) faces growing competition from aviation. This study proposes a mixed-integer fare optimization model that jointly represents trains and flights on a corridor over a given time window. The model is designed to maximize operator revenue subject to passenger utility constraints, thereby treating passenger behavior as a binding condition rather than a direct optimization objective. Unlike bilevel models that separate upper-level fare setting from lower-level passenger choice, enhanced bounded-rationality constraints are embedded directly in the optimization, integrating pricing and behavior. A multi-layer spatio-temporal price–time network captures competitive interactions, service attributes, and passenger choices across multiple operators and services. Using Beijing–Shanghai data, the model attains an objective value of 8,617,549 in 2984 s. Compared with fixed pricing, HSR revenue increases by 33.38%. The policy also balances flows by raising off-peak seat occupancy (e.g., G103: 87.71%→98.30%) and reducing peak congestion (e.g., G115: 100.00%→89.02%), demonstrating the managerial value of well-designed floating fares for peak–off-peak load balancing and guiding demand-responsive fare design and capacity allocation under intermodal competition.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"37 ","pages":"Article 100571"},"PeriodicalIF":2.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147394631","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 : 2026-03-01Epub Date: 2025-12-18DOI: 10.1016/j.jrtpm.2025.100566
Xiling Lin , Qun Chen , Yan Wang
Due to a lack of seat availability information regarding metro train carriages, passengers constantly move on platforms or inside carriages in search of seats, leading to overcrowding and safety concerns. Informing passengers of available seats and guiding them to less crowded carriages are beneficial for riding. The number of available seats at the next station is determined not only by the number of passengers currently occupying the carriage but also by the number of passengers alighting at the station. This study proposes a predictive framework that uses an optimized random forest model to estimate seat availability by analyzing metro passenger action features to predict alighting behavior. A dataset comprising 2009 passenger samples, encompassing 14 categories and totaling 9228 action features, was collected from video recordings in Changsha metro carriages. SHapley additive exPlanations (SHAP) analysis demonstrated that passengers’ actions as they approach the next station—particularly moving toward the carriage exit and standing up—are strong indicators for predicting alighting behavior. Certain combinations of actions, such as “watching the information display” and “standing up” showed superior predictive effectiveness compared with individual occurrences. The predictive model achieves high accuracy in assessing seat availability, contributing to improved service and boarding efficiency.
{"title":"Predicting the alighting behavior of metro passengers based on the analysis of action features","authors":"Xiling Lin , Qun Chen , Yan Wang","doi":"10.1016/j.jrtpm.2025.100566","DOIUrl":"10.1016/j.jrtpm.2025.100566","url":null,"abstract":"<div><div>Due to a lack of seat availability information regarding metro train carriages, passengers constantly move on platforms or inside carriages in search of seats, leading to overcrowding and safety concerns. Informing passengers of available seats and guiding them to less crowded carriages are beneficial for riding. The number of available seats at the next station is determined not only by the number of passengers currently occupying the carriage but also by the number of passengers alighting at the station. This study proposes a predictive framework that uses an optimized random forest model to estimate seat availability by analyzing metro passenger action features to predict alighting behavior. A dataset comprising 2009 passenger samples, encompassing 14 categories and totaling 9228 action features, was collected from video recordings in Changsha metro carriages. SHapley additive exPlanations (SHAP) analysis demonstrated that passengers’ actions as they approach the next station—particularly moving toward the carriage exit and standing up—are strong indicators for predicting alighting behavior. Certain combinations of actions, such as “watching the information display” and “standing up” showed superior predictive effectiveness compared with individual occurrences. The predictive model achieves high accuracy in assessing seat availability, contributing to improved service and boarding efficiency.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"37 ","pages":"Article 100566"},"PeriodicalIF":2.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145797486","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 : 2026-03-01Epub Date: 2025-12-10DOI: 10.1016/j.jrtpm.2025.100565
Gayathri N P , Geena Prasad , Chada Narasimha Reddy , Chapa Gagan Dwaz , Guru Aswini Dath , Maitreyee Awasthi , Deepa Indira Nair
The escalating incidences of train-wildlife collisions, especially with elephants, are a real blow to forest-based wildlife conservation efforts. To enable real-time detection of wild animals such as elephants and promptly alert train operators, this study utilizes advanced deep learning algorithms integrated with camera systems installed at strategic locations along the railway tracks. The research proposes the use of WildlifeRailGuard as an innovative solution to address this issue effectively. To enable real-time detection of wild animals, such as elephants, and promptly alert train operators, this study utilizes advanced deep learning algorithms integrated with camera systems installed at strategic locations along railway tracks. Upon receiving alerts, train operators can immediately reduce speed, ensuring the safety of both passengers and wildlife. The proposed WildlifeRailGuard system also contributes to wildlife conservation by leveraging data analytics to generate valuable insights into animal behavior and movement patterns. The use of data analytics tools helps mitigate the negative effects of railway expansion on various animal species, fostering hope for achieving a sustainable balance between railway development and forest conservation.
{"title":"WildlifeRailGuard: A novel conservation technology to mitigate train-animal collisions in forest regions","authors":"Gayathri N P , Geena Prasad , Chada Narasimha Reddy , Chapa Gagan Dwaz , Guru Aswini Dath , Maitreyee Awasthi , Deepa Indira Nair","doi":"10.1016/j.jrtpm.2025.100565","DOIUrl":"10.1016/j.jrtpm.2025.100565","url":null,"abstract":"<div><div>The escalating incidences of train-wildlife collisions, especially with elephants, are a real blow to forest-based wildlife conservation efforts. To enable real-time detection of wild animals such as elephants and promptly alert train operators, this study utilizes advanced deep learning algorithms integrated with camera systems installed at strategic locations along the railway tracks. The research proposes the use of WildlifeRailGuard as an innovative solution to address this issue effectively. To enable real-time detection of wild animals, such as elephants, and promptly alert train operators, this study utilizes advanced deep learning algorithms integrated with camera systems installed at strategic locations along railway tracks. Upon receiving alerts, train operators can immediately reduce speed, ensuring the safety of both passengers and wildlife. The proposed WildlifeRailGuard system also contributes to wildlife conservation by leveraging data analytics to generate valuable insights into animal behavior and movement patterns. The use of data analytics tools helps mitigate the negative effects of railway expansion on various animal species, fostering hope for achieving a sustainable balance between railway development and forest conservation.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"37 ","pages":"Article 100565"},"PeriodicalIF":2.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145748445","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 : 2026-03-01Epub Date: 2025-11-21DOI: 10.1016/j.jrtpm.2025.100558
Jakob Geischberger , Norman Weik , Jürgen Pannek
In densely operated European railway networks the trade-off between network utilization and service quality leads to pondering traffic volume against the reliability of services. The perspective on service reliability, however, tends to vary between stakeholders. In this paper, we investigate and assess reliability in railway networks, particularly focusing on the comparison between railway operators and users in freight transport systems: While operators mainly focus on the punctuality of trains, users typically perceive reliability on the level of transportation chains. To combine both perspectives, a new agent-based simulation approach is developed that combines a microscopic domain-specific traffic control simulation incorporating the essential properties of the signaling system with a logistical perspective featuring the flow of goods within the network. The study outlines the methodical steps of model-setup, as well as the implementation on the backbone of an agent-based, open-source simulation environment. The methodology is applied to the German railway network and effects on the two different reliability perspectives are assessed and compared. A significant deviation of transport reliability from train punctuality is observed, highlighting the benefit of incorporating the end-customer perspective in reliability evaluation. It is also found that higher amounts of segments per transportation chain lead to significantly lower reliability.
{"title":"Reliability evaluation of rail freight transport processes — An agent-based approach combining microscopic rail simulation and freight network logistics","authors":"Jakob Geischberger , Norman Weik , Jürgen Pannek","doi":"10.1016/j.jrtpm.2025.100558","DOIUrl":"10.1016/j.jrtpm.2025.100558","url":null,"abstract":"<div><div>In densely operated European railway networks the trade-off between network utilization and service quality leads to pondering traffic volume against the reliability of services. The perspective on service reliability, however, tends to vary between stakeholders. In this paper, we investigate and assess reliability in railway networks, particularly focusing on the comparison between railway operators and users in freight transport systems: While operators mainly focus on the punctuality of trains, users typically perceive reliability on the level of transportation chains. To combine both perspectives, a new agent-based simulation approach is developed that combines a microscopic domain-specific traffic control simulation incorporating the essential properties of the signaling system with a logistical perspective featuring the flow of goods within the network. The study outlines the methodical steps of model-setup, as well as the implementation on the backbone of an agent-based, open-source simulation environment. The methodology is applied to the German railway network and effects on the two different reliability perspectives are assessed and compared. A significant deviation of transport reliability from train punctuality is observed, highlighting the benefit of incorporating the end-customer perspective in reliability evaluation. It is also found that higher amounts of segments per transportation chain lead to significantly lower reliability.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"37 ","pages":"Article 100558"},"PeriodicalIF":2.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145580301","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 : 2026-03-01Epub Date: 2026-01-30DOI: 10.1016/j.jrtpm.2026.100569
Julian Reisch, Peter Großmann, Reyk Weiß
We study the Track Maintenance Possession Problem which schedules maintenance works on railway tracks so that the maintenance machines are efficiently assigned and traffic restrictions are not violated. In this particular version of the problem, the maintenance works should be assigned to predefined time slots, so-called containers. We are provided real-world data for the maintenance demands, the containers, the available machines and the traffic restrictions for the whole railway network in Germany for one year. We present a Mixed Integer Program formulation for the problem and give a mathematical proof that it is NP-hard to solve. In order to be able to solve the problem on the large instance size nonetheless, we propose a Maximum Satisfiability encoding and solve the problem with a state-of-the-art solver. In our result, 95% of the maintenance demands are fulfilled which is close to an upper bound we can provide.
{"title":"A MaxSAT model for solving the track maintenance possession problem for the railway network in Germany","authors":"Julian Reisch, Peter Großmann, Reyk Weiß","doi":"10.1016/j.jrtpm.2026.100569","DOIUrl":"10.1016/j.jrtpm.2026.100569","url":null,"abstract":"<div><div>We study the Track Maintenance Possession Problem which schedules maintenance works on railway tracks so that the maintenance machines are efficiently assigned and traffic restrictions are not violated. In this particular version of the problem, the maintenance works should be assigned to predefined time slots, so-called containers. We are provided real-world data for the maintenance demands, the containers, the available machines and the traffic restrictions for the whole railway network in Germany for one year. We present a Mixed Integer Program formulation for the problem and give a mathematical proof that it is NP-hard to solve. In order to be able to solve the problem on the large instance size nonetheless, we propose a Maximum Satisfiability encoding and solve the problem with a state-of-the-art solver. In our result, 95% of the maintenance demands are fulfilled which is close to an upper bound we can provide.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"37 ","pages":"Article 100569"},"PeriodicalIF":2.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146077332","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 : 2026-03-01Epub Date: 2026-02-02DOI: 10.1016/j.jrtpm.2026.100567
Kenneth Ng, Nirajan Shiwakoti, Peter Stasinopoulos
Dwell time is a critical component of railway operations, influencing network capacity, service reliability, and passenger experience. Despite extensive methodological development, discussion of how dwell time models are operationalised in practice remains limited in the publicly available literature, a situation that may partly reflect commercial confidentiality in real-world applications. To address this, the paper proposes a novel lifecycle-oriented, systems-theoretic framework to support the selection, calibration, and operationalisation of dwell time models in alignment with institutional capabilities, data environments, and planning objectives. The framework is informed by a structured, non-exhaustive review of railway dwell time modelling approaches, synthesizing statistical-based, simulation-based, and advanced models to examine how passenger behaviour, operational constraints, and uncertainty are represented across different operational contexts. Unlike prior reviews that focus on individual modelling paradigms in isolation, this study integrates insights across major approaches and aligns them with practical deployment considerations. By introducing a six-part lifecycle framework, this work provides a structured, actionable pathway for translating dwell time models into real-world applications. By bridging academic rigor with real-world applicability, the proposed framework offers a pragmatic pathway for agencies to leverage data-driven modelling for improved dwell time management by advancing the operational maturity and responsiveness of railway systems.
{"title":"Modelling railway dwell time: A structured review and lifecycle framework for real-world integration","authors":"Kenneth Ng, Nirajan Shiwakoti, Peter Stasinopoulos","doi":"10.1016/j.jrtpm.2026.100567","DOIUrl":"10.1016/j.jrtpm.2026.100567","url":null,"abstract":"<div><div>Dwell time is a critical component of railway operations, influencing network capacity, service reliability, and passenger experience. Despite extensive methodological development, discussion of how dwell time models are operationalised in practice remains limited in the publicly available literature, a situation that may partly reflect commercial confidentiality in real-world applications. To address this, the paper proposes a novel lifecycle-oriented, systems-theoretic framework to support the selection, calibration, and operationalisation of dwell time models in alignment with institutional capabilities, data environments, and planning objectives. The framework is informed by a structured, non-exhaustive review of railway dwell time modelling approaches, synthesizing statistical-based, simulation-based, and advanced models to examine how passenger behaviour, operational constraints, and uncertainty are represented across different operational contexts. Unlike prior reviews that focus on individual modelling paradigms in isolation, this study integrates insights across major approaches and aligns them with practical deployment considerations. By introducing a six-part lifecycle framework, this work provides a structured, actionable pathway for translating dwell time models into real-world applications. By bridging academic rigor with real-world applicability, the proposed framework offers a pragmatic pathway for agencies to leverage data-driven modelling for improved dwell time management by advancing the operational maturity and responsiveness of railway systems.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"37 ","pages":"Article 100567"},"PeriodicalIF":2.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147394633","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 : 2026-03-01Epub Date: 2026-02-03DOI: 10.1016/j.jrtpm.2026.100568
Michał Grzybowski , Jakub Młyńczak , Lucyna Sokołowska , Szymon Surma , Michał Matowicki
Railways play a critical role in the modern transportation system, with infrastructure increasingly shifting towards computer-based signalling systems to enhance operational efficiency and safety. As part of this evolution, the design and visualization of the man-machine interface (MMI) in these systems become essential, since it serves as a key tool for human operators, such as dispatchers, to monitor and control railway traffic. While these computer-based schematics offer improved information density and user interaction, they also impose a significant design workload. Incorrectly designed schematics can lead to operator errors, potentially jeopardizing safety. Hence, high-quality design is imperative. This paper introduces a novel approach aimed at automating the process of railway schematic design by employing mathematical optimization, specifically through integer linear programming (ILP). The central challenge of schematic layout design is framed as a mathematical modelling problem, where the placement of elements such as signals, points, and track circuits is optimized under a set of constraints. The proposed method automates the placement of these elements while allowing for fine-tuned manual control, ensuring the legibility and ergonomics of the final output. By formalizing the layout problem as an ILP, this approach ensures an efficient and structured solution process, taking into account both the technical constraints of the railway system and the human factors that influence operator decision-making. The method’s effectiveness is demonstrated through the development of software capable of generating high-quality railway schematics with minimal manual intervention. The results highlight the potential of mathematical modelling techniques, particularly ILP, in automating complex design tasks while maintaining a high standard of usability and safety. This contribution not only reduces the workload for designers but also improves the overall quality and reliability of railway control systems.
{"title":"Automation of railway signalling system man machine interface design using linear programming optimization technique","authors":"Michał Grzybowski , Jakub Młyńczak , Lucyna Sokołowska , Szymon Surma , Michał Matowicki","doi":"10.1016/j.jrtpm.2026.100568","DOIUrl":"10.1016/j.jrtpm.2026.100568","url":null,"abstract":"<div><div>Railways play a critical role in the modern transportation system, with infrastructure increasingly shifting towards computer-based signalling systems to enhance operational efficiency and safety. As part of this evolution, the design and visualization of the man-machine interface (MMI) in these systems become essential, since it serves as a key tool for human operators, such as dispatchers, to monitor and control railway traffic. While these computer-based schematics offer improved information density and user interaction, they also impose a significant design workload. Incorrectly designed schematics can lead to operator errors, potentially jeopardizing safety. Hence, high-quality design is imperative. This paper introduces a novel approach aimed at automating the process of railway schematic design by employing mathematical optimization, specifically through integer linear programming (ILP). The central challenge of schematic layout design is framed as a mathematical modelling problem, where the placement of elements such as signals, points, and track circuits is optimized under a set of constraints. The proposed method automates the placement of these elements while allowing for fine-tuned manual control, ensuring the legibility and ergonomics of the final output. By formalizing the layout problem as an ILP, this approach ensures an efficient and structured solution process, taking into account both the technical constraints of the railway system and the human factors that influence operator decision-making. The method’s effectiveness is demonstrated through the development of software capable of generating high-quality railway schematics with minimal manual intervention. The results highlight the potential of mathematical modelling techniques, particularly ILP, in automating complex design tasks while maintaining a high standard of usability and safety. This contribution not only reduces the workload for designers but also improves the overall quality and reliability of railway control systems.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"37 ","pages":"Article 100568"},"PeriodicalIF":2.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147394635","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-30DOI: 10.1016/j.jrtpm.2025.100537
Shangyao Yan, Chun-Yi Wang, Tzu-Hao Yan
To ensure the smooth operation of the MRT system, efficient resource utilization for effective facility maintenance is crucial. Currently, engineers in Taiwan rely on past records and personal knowledge to schedule maintenance, which is inefficient and leads to higher costs. To address this challenge, a systematic weekly maintenance model has been developed, tailored to the needs of local MRT companies. This model takes into account preventive maintenance, repair needs, and workforce constraints, with the aim of minimizing total maintenance costs. Formulated as a challenging integer network flow problem with side constraints, the model utilizes a heuristic algorithm to efficiently solve complex scenarios. Initial results from a case study show promise, suggesting that this model and solution algorithm can be valuable tools for MRT companies.
{"title":"Optimizing weekly maintenance schedules for mass rapid transit facilities","authors":"Shangyao Yan, Chun-Yi Wang, Tzu-Hao Yan","doi":"10.1016/j.jrtpm.2025.100537","DOIUrl":"10.1016/j.jrtpm.2025.100537","url":null,"abstract":"<div><div>To ensure the smooth operation of the MRT system, efficient resource utilization for effective facility maintenance is crucial. Currently, engineers in Taiwan rely on past records and personal knowledge to schedule maintenance, which is inefficient and leads to higher costs. To address this challenge, a systematic weekly maintenance model has been developed, tailored to the needs of local MRT companies. This model takes into account preventive maintenance, repair needs, and workforce constraints, with the aim of minimizing total maintenance costs. Formulated as a challenging integer network flow problem with side constraints, the model utilizes a heuristic algorithm to efficiently solve complex scenarios. Initial results from a case study show promise, suggesting that this model and solution algorithm can be valuable tools for MRT companies.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100537"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144917000","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-28DOI: 10.1016/j.jrtpm.2025.100550
Phil Howlett, Maria Kapsis, Peter Pudney
In order to manage electricity transmission and distribution it is now common practice for system operators to offer financial incentives that encourage large consumers to reduce energy usage during designated peak demand periods. For train operators on large rail networks it may be profitable—with selected individual journeys—to reduce energy usage during peak times and increase energy usage at other times rather than simply minimizing overall energy consumption. The desired reduction in energy usage on some intermediate time interval can often be achieved if the overall optimal driving speed is increased but the usual speedhold segment is interrupted by a segment of coast–speedhold–maximum acceleration with a lower optimal driving speed on the designated interval. In Howlett et al. (2023) it was shown that an interruption of this type is optimal if and only if the coast phase begins at the entry time to the designated interval and the acceleration phase begins at the exit time. In this paper we show that the above strategy is a suboptimal strategy and that the true optimal restricted strategy is one where the usual speedhold phase is interrupted by a segment of maximum acceleration–coast–speedhold–coast–maximum acceleration. The initial phase for this segment ends at the entry time to the designated interval and the final phase begins at the exit time. We will also extend the new strategy to find optimal restricted strategies for problems with energy consumption constraints on multiple predetermined intermediate time intervals.
{"title":"Optimal driving strategies for trains on level track with bounds on energy consumption during specified intermediate time intervals","authors":"Phil Howlett, Maria Kapsis, Peter Pudney","doi":"10.1016/j.jrtpm.2025.100550","DOIUrl":"10.1016/j.jrtpm.2025.100550","url":null,"abstract":"<div><div>In order to manage electricity transmission and distribution it is now common practice for system operators to offer financial incentives that encourage large consumers to reduce energy usage during designated peak demand periods. For train operators on large rail networks it may be profitable—with selected individual journeys—to reduce energy usage during peak times and increase energy usage at other times rather than simply minimizing overall energy consumption. The desired reduction in energy usage on some intermediate time interval can often be achieved if the overall optimal driving speed is increased but the usual <em>speedhold</em> segment is interrupted by a segment of <em>coast–speedhold–maximum acceleration</em> with a lower optimal driving speed on the designated interval. In Howlett et al. (2023) it was shown that an interruption of this type is optimal if and only if the <em>coast</em> phase begins at the entry time to the designated interval and the <em>acceleration</em> phase begins at the exit time. In this paper we show that the above strategy is a suboptimal strategy and that the true optimal restricted strategy is one where the usual <em>speedhold</em> phase is interrupted by a segment of <em>maximum acceleration–coast–speedhold–coast–maximum acceleration</em>. The initial phase for this segment ends at the entry time to the designated interval and the final phase begins at the exit time. We will also extend the new strategy to find optimal restricted strategies for problems with energy consumption constraints on multiple predetermined intermediate time intervals.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100550"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145220118","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-08DOI: 10.1016/j.jrtpm.2025.100551
Junduo Zhao , Haiying Li , Lingyun Meng , Xiaojie Luan , Andrea D'Ariano
Train dispatching is critical for ensuring the punctuality and reliability in passenger transportation, especially in railway systems with a seat reservation mechanism, such as that in China. In the presence of a disruption, e.g., a 4-h segment blockage, passengers holding reservations on disrupted trains face significant travel plan alterations. As the flexibility for these stranded passengers to self-shift to alternative travel times and/or modes is often limited with pre-booked tickets and infrequent services, they are very likely to wait for their reserved trains for a long time, causing negative consequences on passenger satisfaction. In this study, we propose a method to address this rescheduling problem from the perspective of passenger reservicing. Measures of adding extra stops and inserting extra trains are conditionally used with the limitation of an effective time window (ETW), alongside retiming, reordering, and local-rerouting, to offer alternative travel options for stranded passengers, enabling them to reach their destinations with minimal delays. To accurately capture the limitation of ETW, we reconstructed the space-time network by introducing an alternative arc set, followed by formulating an ILP model. This NP-hard problem is then solved using a Lagrangian relaxation solution method, which integrates a decomposition approach, a label correcting algorithm, and a heuristic algorithm. We also conduct computational experiments on the Chinese high-speed railway network to validate the feasibility, effectiveness, and efficiency of our proposed method, and perform experimental analysis to help dispatchers to make more informed decisions in daily operations.
{"title":"Train rescheduling with consideration of passenger reservicing during severe disruptions","authors":"Junduo Zhao , Haiying Li , Lingyun Meng , Xiaojie Luan , Andrea D'Ariano","doi":"10.1016/j.jrtpm.2025.100551","DOIUrl":"10.1016/j.jrtpm.2025.100551","url":null,"abstract":"<div><div>Train dispatching is critical for ensuring the punctuality and reliability in passenger transportation, especially in railway systems with a seat reservation mechanism, such as that in China. In the presence of a disruption, e.g., a 4-h segment blockage, passengers holding reservations on disrupted trains face significant travel plan alterations. As the flexibility for these stranded passengers to self-shift to alternative travel times and/or modes is often limited with pre-booked tickets and infrequent services, they are very likely to wait for their reserved trains for a long time, causing negative consequences on passenger satisfaction. In this study, we propose a method to address this rescheduling problem from the perspective of passenger reservicing. Measures of adding extra stops and inserting extra trains are conditionally used with the limitation of an effective time window (<em>ETW</em>), alongside retiming, reordering, and local-rerouting, to offer alternative travel options for stranded passengers, enabling them to reach their destinations with minimal delays. To accurately capture the limitation of <em>ETW</em>, we reconstructed the space-time network by introducing an alternative arc set, followed by formulating an ILP model. This NP-hard problem is then solved using a Lagrangian relaxation solution method, which integrates a decomposition approach, a label correcting algorithm, and a heuristic algorithm. We also conduct computational experiments on the Chinese high-speed railway network to validate the feasibility, effectiveness, and efficiency of our proposed method, and perform experimental analysis to help dispatchers to make more informed decisions in daily operations.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"36 ","pages":"Article 100551"},"PeriodicalIF":2.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145265378","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}