A new approach for improving the performance of freight train timetabling of a single-track railway system

A new approach for improving the performance of freight train timetabling for single-track railways is proposed. Using the idea of a fixed-block signaling system, we develop a matrix representation to express the occupation of inter- and intra-station tracks by trains illustrating the train blocking time diagram in its entirety. Train departure times, dwell times, and unnecessary stopping are adjusted to reduce average train travel time and single train travel time. Conflicts between successive stations and within stations are identified and solved. A fuzzy logic system is further used to adjust the range of train departure times and checks are made to determine whether dwell times and time intervals can be adjusted for passenger and freight trains at congested stations to minimize train waiting times. By combining manual scheduling expertise with the fuzzy inference method, timetable efficiency is significantly improved and becomes more flexible.     

A heuristic for the train pathing and timetabling problem

In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. These important tasks were traditionally done manually, but there is an increasing move toward automated software based on mathematical models and algorithms. Most published models in the literature either focus on train timetabling only, or are too complicated to solve when facing large instances. In this paper, we present an optimization heuristic that includes both train pathing and train timetabling, and has the ability to solve real-sized instances. This heuristic allows the operation time of trains to depend on the assigned track, and also lets the minimum headway between the trains to depend on the trains’ relative status. It generates an initial solution with a simple rule, and then uses a four-step process to derive the solution iteratively. Each iteration starts by altering the order the trains travel between stations, then it assigns the services to the tracks in the stations with a binary integer program, determines the order they pass through the stations with a linear program, and uses another linear program to produce a timetable. After these four steps, the heuristic accepts or rejects the new solution according to a Threshold Accepting rule. By decomposing the original complex problem into four parts, and by attacking each part with simpler neighborhood-search processes or mathematical programs, the heuristic is able to solve realistic instances. When tested with two real-world examples, one from a 159.3 km, 29-station railroad that offers 44 daily services, and another from a 345 km, eight-station high-speed rail with 128 services, the heuristic obtained timetables that are at least as good as real schedules.     

Train scheduling simulation that minimises operational conflicts due to service constraints

This paper presents an attempt made to facilitate re‐scheduling of trains to minimize operational delays and accommodate uniform headways for off peak sub urban services subject to resource constraints such as locomotive availability, poor track conditions and stations without siding facilities. The paper describes the computer simulation model designed to optimize train schedules on single‐track rail lines. Using this simulation program it is possible to plan and optimize timetables for railway networks with train runs within short time periods for both single track and double track conditions. The paper describes the capabilities of presenting the results of the simulation runs. These include the time‐distance graph, the network with train movements, dialog boxes with information about selected trains. The programme is capable of changing the starting point, departure time, train destinations and adding or deleting a stop etc. from the user interface. Four objects of array variables are used in the simulation process to keep train and station data. Two object arrays are used for the train movements in up and down directions. The stations' data are stored in the other two object arrays. One of these arrays of stations contains all the stations of the line while the other one contains only the stations with siding facilities. A case study that covers a 61 km long single‐track line with 14 stations is presented to highlight the model capabilities.     

Train routing and timetabling problem for heterogeneous train traffic with switchable scheduling rules

This paper proposes a mathematical model for the train routing and timetabling problem that allows a train to occasionally switch to the opposite track when it is not occupied, which we define it as switchable scheduling rule. The layouts of stations are taken into account in the proposed mathematical model to avoid head-on and rear-end collisions in stations. In this paper, train timetable could be scheduled by three different scheduling rules, i.e., no switchable scheduling rule (No-SSR) which allows trains switching track neither at stations and segments, incomplete switchable scheduling rule (In-SSR) which allows trains switching track at stations but not at segments, and complete switchable scheduling rule (Co-SSR) which allows trains switching track both at stations and segments. Numerical experiments are carried out on a small-scale railway corridor and a large-scale railway corridor based on Beijing–Shanghai high-speed railway (HSR) corridor respectively. The results of case studies indicate that Co-SSR outperforms the other two scheduling rules. It is also found that the proposed model can improve train operational efficiency.     

The train platforming problem: The infrastructure management company perspective

If railway companies ask for station capacity numbers, their underlying question is in fact one about the platformability of extra trains. Train platformability depends not only on the infrastructure, buffer times, and the desired departure and arrival times of the trains, but also on route durations, which depend on train speeds and lengths, as well as on conflicts between routes at any given time. We consider all these factors in this paper. We assume a current train set and a future one, where the second is based on the expected traffic increase through the station considered. The platforming problem is about assigning a platform to each train, together with suitable in- and out-routes. Route choices lead to different route durations and imply different in-route-begin and out-route-end times. Our module platforms the maximum possible weighted sum of trains in the current and future train set. The resulting number of trains can be seen as the realistic capacity consumption of the schedule. Our goal function allows for current trains to be preferably allocated to their current platforms.Our module is able to deal with real stations and train sets in a few seconds and has been fully integrated by Infrabel, the Belgian Infrastructure Management Company, in their application called Ocapi, which is now used to platform existing and projected train sets and to determine the capacity consumption.     

An investigation of passenger interchange and train standing time at LRT stations: (ii) Estimation of standing time

The standing-time of trains at urban rail stations is pertinent to determining the line capacity and fleet size. The assumption of uniform boarding and alighting leads to under-estimation of the standing time. It is shown that the train standing-time is related to the fraction of boarders and the maximum demand for boarding and alighting at a door. It is further shown that the probability distribution of passengers at a door depends on the platform entrance locations. A methodology that takes into account the above factors is proposed for estimating the train standing-time.     

Express guideway transit: A case for further development in transit automation

Safe and reliable coupling and decoupling of cars from a moving train is feasible with further developments in linear motor propulsion and control of transit vehicles. This allows the last car of a train to decouple and stop at a station for a relative long dwell time, before it accelerates and is coupled to a following train. Controlled doors in front and rear of the transit vehicle permit passengers to walk through the train to the car which stops at their destination. A proposed transit system using these features is described and compared to Bombardier's Advanced Rapid Transit. Potential advantages are high schedule speed, uncrowded trains, smaller and more stations, low energy requirements and a smaller vehicle fleet.     

Mining missing train logs from Smart Card data

This paper shows how to recover the arrival times of trains from the gate times of metro passengers from Smart Card data. Such technique is essential when a log, the set of records indicating the actual arrival and departure time of each bus or train at each station and also a critical component in reliability analysis of a transportation system, is missing partially or entirely. The procedure reconstructs each train as a sequence of the earliest exit times, called S-epochs, among its alighting passengers at each stations. The procedure first constructs a set of passengers, also known as reference passengers, whose routing choices are easily identifiable. The procedure then computes, from the exit times of the reference passengers, a set of tentative S-epochs based on a detection measure whose validity relies on an extreme-value characteristic of the platform-to-gate movement of alighting passengers. The tentative S-epochs are then finalized to be a true one, or rejected, based on their consistencies with bounds and/or interpolation from prescribed S-epochs of adjacent trains and stations. Tested on 12 daily sets of trains, with varying degrees of missing logs, from three entire metro lines, the method restored the arrival times of 95% of trains within the error of 24 s even when 100% of logs was missing. The mining procedure can also be applied to trains operating under special strategies such as short-turning and skip-stop. The recovered log seems precise enough for the current reliability analysis performed by the city of Seoul.     

Precise estimation of connections of metro passengers from Smart Card data

The aim of this study is to estimate both the physical and schedule-based connections of metro passengers from their entry and exit times at the gates and the stations, a data set available from Smart Card transactions in a majority of train networks. By examining the Smart Card data, we will observe a set of transit behaviors of metro passengers, which is manifested by the time intervals that identifies the boarding, transferring, or alighting train at a station. The authenticity of the time intervals is ensured by separating a set of passengers whose trip has a unique connection that is predominantly better by all respects than any alternative connection. Since the connections of such passengers, known as reference passengers, can be readily determined and hence their gate times and stations can be used to derive reliable time intervals. To detect an unknown path of a passenger, the proposed method checks, for each alternative connection, if it admits a sequence of boarding, middle train(s), and alighting trains, whose time intervals are all consistent with the gate times and stations of the passenger, a necessary condition of a true connection. Tested on weekly 32 million trips, the proposed method detected unique connections satisfying the necessary condition, which are, therefore, most likely true physical and schedule-based connections in 92.6 and 83.4 %, respectively, of the cases.     

Performability evaluation of the ERTMS/ETCS – Level 3

Level 3 of the ERTMS/ETCS improves the capacity of railways by replacing fixed-block signalling, which prevents a train to enter a block occupied by another train, with moving block signalling, which allows a train to proceed as long as it receives radio messages ensuring that the track ahead is clear of other trains. If messages are lost, a train must stop for safety reasons within a given deadline, even though the track ahead is clear, making the availability of the communication link crucial for successful operation.We combine analytic evaluation of failures due to burst noise and connection losses with numerical solution of a non-Markovian model representing also failures due to handovers between radio stations. In so doing, we show that handovers experienced by a pair of chasing trains periodically affect the availability of the radio link, making behavior of the overall communication system recurrent over the hyper-period of periodic message releases and periodic arrivals at cell borders. As a notable aspect, non-Markovian transient analysis within two hyper-periods is sufficient to derive an upper bound on the first-passage time distribution to an emergency brake, permitting to achieve a trade-off between railway throughput and stop probability. A sensitivity analysis is performed with respect to train speed and headway distance, permitting to gain insight into the consequences of system-level design choices.     

An investigation of passenger interchange and train standing time at LRT stations: (i) Alighting,boarding and platform distribution of passengers

The train standing-time at a station is a determinant of the line capacity and the necessary fleet-size. Its determination is usually based on the assumption that boarding and alighting is uniform at all doors of a train. Uniform boarding and alighting is conceivable if passengers distribute themselves uniformly on station platforms while waiting for trains. The validity of the uniformity assumptions is tested using data from two stations (one CBD, one suburban) of the Calgary, Alberta LRT system. It is shown that passenger distribution on the platform, alighting and boarding is not uniform and is closely related to the location of platform access points. Some strategies that will encourage uniformity are discussed. However, procedures that can estimate the standing time for non-uniform boarding and alighting need to be developed.     

Passenger Perspectives in Railway Timetabling: A Literature Review

When looking at railway planning, a discrepancy exists between planners who focus on the train operations and publish fixed railway schedules, and passengers who look not only at the schedules but also at the entirety of their trip, from access to waiting to on-board travel and egress. Looking into this discrepancy is essential, as assessing railway performances by merely measuring train punctuality would provide an unfair picture of the level of service experienced by passengers. Firstly, passengers’ delays are often significantly larger than the train delays responsible for the passengers to be late. Secondly, trains’ punctuality is often strictly related to too tight schedules that in turn might translate into knock-on delays for longer dwelling times at stations, trip delays for increased risk of missing transfer connections, and uncertain assessment of the level of service experienced, especially with fluctuating passenger demand. A key aspect is the robustness of railway timetables. Empirical evidence indicates that passengers give more importance to travel time certainty than travel time reductions, as passengers associate an inherent disutility with travel time uncertainty. This disutility may be broadly interpreted as an anxiety cost for the need for having contingency plans in case of disruptions, and may be looked at as the motivator for the need for delay-robust railway timetables. Interestingly, passenger-oriented optimisation studies considering robustness in railway planning typically limit their emphasis on passengers to the consideration of transfer maintenance. Clearly, passengers’ travel behaviour is far more complex and multi-faceted and thus several other aspects should be considered, as becoming more and more evident from passenger surveys. The current literature review starts by looking at the parameters that railway optimisation/planning studies are focused on and the key performance indicators that impact railway planning. The attention then turns to the parameters influencing passengers’ perceptions and travel experiences. Finally, the review proposes guidelines on how to reduce the gap between the operators’ railway planning and performance measurement on the one hand and the passengers’ perception of the railway performance on the other hand. Thereby, the conclusions create a foundation for a more passenger-oriented railway timetabling ensuring that passengers are provided with the best service possible with the resources available.     

Train boarding and alighting rates at high passenger loads

Line capacity in metro and high‐frequency suburban railways is as much determined by station stop times as by factors such as line speed or train acceleration. This paper applies the method developed by London Underground to estimate the time that trains spend at stations, as a function of the physical characteristics of the situation (e.g. train door width) and the numbers of passengers involved. Analysis was carried out on a number of alternative designs for refurbishment of South West Trains' Class 455 inner‐suburban rolling stock. Whilst there is indeed an interaction between boarding and alighting passengers, this paper demonstrates that the LUL relationship breaks down at the highest passenger loads. Moreover, results indicate that passenger flow is not equal between different parts of the same group of boarders or alighters.     

A case study on the coordination of last trains for the Beijing subway network

Passengers may make several transfers between different lines to reach their destinations in urban railway transit networks. Coordination of last trains in feeding lines and connecting lines at transfer stations is especially important because it is the last chance for many travellers to transfer. In this paper, a mathematical method is used to reveal the relationships between passenger transfer connection time (PTCT) and passenger transfer waiting time (PTWT). A last-train network transfer model (LNTM) is established to maximize passenger transfer connection headways (PTCH), which reflect last-train connections and transfer waiting time. Additionally, a genetic algorithm (GA) is developed based upon this LNTM model and used to test a numerical example to verify its effectiveness. Finally, the Beijing subway network is taken as a case study. The results of the numerical example show that the model improves five connections and reduces to zero the number of cases when a feeder train arrives within one headway’s time after the connecting train departed.     

Designing an integrated distribution system for catering services for high-speed railways: A three-echelon location routing model with tight time windows and time deadlines

An emerging task in catering services for high-speed railways (CSHR) is to design a distribution system for the delivery of high-quality perishable food products to trains in need. This paper proposes a novel model for integrating location decision making with daily rail catering operations, which are affected by various aspects of rail planning, to meet time-sensitive passenger demands. A three-echelon location routing problem with time windows and time budget constraints (3E-LRPTWTBC) is thus proposed toward formulating this integrated distribution system design problem. This model attempts to determine the capacities/locations of distribution centers and to optimize the number of meals delivered to stations. The model also attempts to generate a schedule for refrigerated cars traveling from distribution centers to rail stations for train loading whereby meals can be catered to trains within tight time windows and sold before a specified time deadline. By relaxing the time-window constraints, a relaxation model that can be solved using an off-the-shelf mixed integer programming (MIP) solver is obtained to provide a lower bound on the 3E-LRPTWTBC. A hybrid cross entropy algorithm (HCEA) is proposed to solve the 3E-LRPTWTBC. A small-scale case study is implemented, which reveals a 9.3% gap between the solution obtained using the HCEA and that obtained using the relaxation model (RM). A comparative analysis of the HCEA and an exhaustive enumeration algorithm indicates that the HCEA shows good performance in terms of computation time. Finally, a case study considering 156 trains on the Beijing-Shanghai high-speed corridor and a large-scale case study considering 1130 trains on the Chinese railway network are addressed in a comprehensive study to demonstrate the applicability of the proposed models and algorithm.     

高速铁路列车运行图均衡性研究

以相邻间隔时间期望方差及相间间隔时间均值和方差为计算指标,描述车站的列车分布及顺序均衡性。运用均衡性指标矩阵及均衡度指标向量来评价列车实际与计划运行图的均衡性。结果表明,由于干扰影响列车间隔时间大小波动明显,列车到达均衡性整体优于列车出发均衡性,长沙南站时间间隔分布及顺序均衡性最差,衡山西站、株洲西站、长沙南站到发均衡度最差,应结合列车晚点情况重点考虑运行图结构优化。     

A fault tolerance approach for railway scheduling and train control

This paper makes two contributions. It firstly proposes the use of a fault tolerance approach for railway operations and secondly it develops a minimum time gap matrix model for capacity computation and the study of perturbation effects through the generation of a compressed timetable. A fault tolerance approach is proposed to improve the operational efficiency of the railway network in terms of the network capacity and the robustness of train timetables. The term fault tolerance is used in a broad sense, to represent any abnormalities or unexpected events in operations or equipment. Enhanced fault tolerance capability provides safety assurance so that, in normal operating conditions, trains can adopt much faster speed profiles when approaching a ‘to-be-cleared’ signal block at stations and junctions than those currently permitted, effectively turning the status of ‘be ready to stop’ to that of ‘proceed with caution’. In the rare event of a ‘fault’ in the system, e.g. if a conflicting train fails to move out of a signalling block as expected or a switch fails to operate as required, the train would be re-routed to take an alternative path. In this study, the new approach is developed on three scenarios i.e., a standard classic right turn junction, a terminus station, and a small network combining both of these elements to demonstrate the performance gains, but the concept can be readily extended for other types of junctions/stations. Results so far show great potential in the proposed fault tolerance approach to increase the capacity and enhance operational robustness to perturbations at such locations. A novel method for capacity computation called minimum time gap matrix model is also introduced that has capability to produce compressed timetables directly from a given train sequence.     

A practical capacity model of a single track line

The paper presents a model for determining the practical capacity of a single track line, i.e. the maximum number of trains which can be run along it in a time unit under the condition that each train enters its bottleneck segment with a definite delay.

The input data used in the model are: geometrical characteristics of the bottleneck segment of the line under study, the intensity and structure of demand expressed by a number of trains which are run over the line in a given time unit, the scenario of traffic running over the line under study and the operational tactics of individual train categories processing on the bottleneck segment.

(Two tactics can be applied in the train processing on the line under study; first, the trains of individual categories are given different priorities in the processing, and second, all the trains have the same priority).

The output results of the model are average delays of trains of each category occurring within the train processing performed on the bottleneck segment of the line under study in a given time unit.     

Standardization of capacity unit for headway-based rail capacity analysis

Determining the required capacity upgrades to accommodate future demand is a critical process in assisting public and private financing of capacity investments. Conventional railway systems usually operate multiple types of trains on the same track. These different types of trains can exert substantially different capacity impact, and can cause serious operational conflicts. In the past, rail line capacity is commonly defined as the maximum number of trains that can be operated on a section of track within a given time period. However, a specific unit (trains/hr or trains/day) does not reflect the heterogeneity of train types. According to the concept of base train equivalents (BTE) and base train unit (BTU), this study developed headway-based models to determine BTE for transforming different train types into a standard unit (i.e., BTU). An approximate method for lines with three and more types of trains was also proposed to compute BTEs for non-base trains. Results from the case studies demonstrate that this method enables the standardization of rail capacity unit, facilitates assessment of the impact from heterogeneous trains, and allows comparison and evaluation of the capacity measurements from different lines and systems.     

Estimation of train dwell time at short stops based on track occupation event data: A study at a Dutch railway station

Train dwell time is one of the most unpredictable components of railway operations, mainly because of the varying volumes of alighting and boarding passengers. However, for reliable estimations of train running times and route conflicts on main lines, it is necessary to obtain accurate estimations of dwell times at the intermediate stops on the main line, the so‐called short stops. This is a great challenge for a more reliable, efficient and robust train operation. Previous research has shown that the dwell time is highly dependent on the number of boarding and alighting passengers. However, these numbers are usually not available in real time. This paper discusses the possibility of a dwell time estimation model at short stops without passenger demand information by means of a statistical analysis of track occupation data from the Netherlands. The analysis showed that the dwell times are best estimated for peak and off‐peak hours separately. The peak‐hour dwell times are estimated using a linear regression model of train length, dwell times at previous stops and dwell times of the preceding trains. The off‐peak‐hour dwell times are estimated using a non‐parametric regression model, in particular, the k‐nearest neighbor model. There are two major advantages of the proposed estimation models. First, the models do not need passenger flow data, which is usually impossible to obtain in real time in practice. Second, detailed parameters of rolling stock configuration and platform layout are not required, which makes the model more generic and eases implementation. A case study at Dutch railway stations shows that the estimation accuracy is 85.8%–88.5% during peak hours and 80.1% during off‐peak hours, which is relatively high. We conclude that the estimation of dwell times at short stop stations without passenger data is possible. Copyright © 2016 John Wiley & Sons, Ltd.