Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 3047963, 10 pages
Research Article

An Objective Train Timetabling Quality Evaluation Method

School of Transportation and Logistics, National Railway Train Diagram Research and Training Center, National and Local Joint Engineering Laboratory of Comprehensive Intelligent Transportation, 111 North 1 Section, Beierhuan Road, Jinniu District, Chengdu 610031, China

Correspondence should be addressed to Shao-quan Ni

Received 8 October 2016; Revised 14 December 2016; Accepted 9 May 2017; Published 5 June 2017

Academic Editor: Andrea L. Facci

Copyright © 2017 Feng Jiang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The train timetable dominates the rail traffic organization. The timetabling quality should be evaluated to check the work skill of train timetable managers. The values of existing timetable evaluation indexes vary with infrastructure features and traffic flow; therefore, they are not comparable in fact. Furthermore, subjective inputs like expert scores are involved in evaluation; this will lead to unreliable results because the experts may have different opinions. To overcome these shortages, we propose a relative train path efficiency index by taking the train paths as production units. Each unit consumes some transport resources and produces some feedback outputs. A DEA model is applied to compute the train path efficiency. Two statistical functions of train path efficiency are used to evaluate the timetabling quality. We verify our method with real-world timetables. First, we use the Shibantan-to-Xinqiao line timetable to test the relative feature of the index proposed, and the results show that the train path efficiency value is relative and can reflect whether the stops are evenly distributed or not. Second, we evaluate the timetabling quality of another two timetables of the Qingdao-to-Jinan line with different traffic flows, and the results show that, compared with the 2012 timetable, the timetabling quality decreased in 2013.

1. Introduction

A train timetable defines the departure and arrival times of a train at each station. The Train Timetabling Problem (TTP) is mainly about setting a feasible path for each train by displaying and adjusting the arrival and departure times of the train (see, e.g., Caprara et al. [1]). From this point of view, the evaluation of the train timetabling quality involves evaluating the TTP process mentioned above, particularly the distribution and adjustment of the train paths.

A timetable can be made by a computer or manually. For cases of simple traffic, computer timetabling can provide a good solution, while for large-scale, complex traffic, it is difficult to generate a timetable completely automatically. Therefore, manual adjustments are necessary. In China, where the timetable is nonperiodic and the scale of the rail network is large, at the timetabling stage, a lot of readjustments are required due to the complexity of the problem, so we employ a manual timetabling process. The person in charge of this job is usually known as the timetable manager (TM). As the TTP is NP-hard [1], it is difficult to find the optimal solution for all train paths; thus, different TMs can reach different solutions, and the work skill of the TM will eventually affect the timetable quality. Usually, there are several TMs working on timetabling, each of whom is in charge of different lines. Nowadays, we are facing the problem of how to evaluate the work skill of TMs, in other words, how to find a way to evaluate the train timetabling quality (TTQ).

The TTP is recognized as one of the most important problems in rail traffic organization; a lot of research focuses on this field. In Caprara et al.’s study [1], a single one-way track TTP is studied and an ILP model is used, where the ILP is relaxed in a Lagrangian way and a heuristic method is used to schedule each train while keeping it as close as possible to the ideal timetable. In Brännlund et al.’s study [2], a single track, two-way line case is studied and the Lagrangian relaxation method is used to solve the model. In Zhou and Zhong’s study [3], based on passenger demands, the train plan problem is solved for a double-track high-speed line to minimize both the waiting time for high-speed trains and the total travel time for all trains, and a branch-and-bound algorithm with effective dominance rules is used to solve the bicriteria scheduling problem. Some works focus on periodic TTP, in which for every period (usually 1 hour) the timetable is repeated to assist passengers to remember and transfer between trains. A Periodic Event Scheduling Problem (PESP) model is applied by Liebchen and Möhring [4] and Kroon and Peeters [5]. We refer readers to the review by Cacchiani and Toth [6] of nominal and robust models and algorithms about TTP for further details. After the timetable is created, it should be evaluated to check its quality. In this field, much research focuses on the dynamic performance. In Huisamn and Boucherie’s study [7], the delays caused by fast trains becoming caught behind slower ones are investigated, and a Markov chain is used to build a stochastic model capturing both scheduled and unscheduled train movements; the model allows the analysis of the running times for both fixed periodical timetables and long-term capacity calculation with random trains arriving. In Vromans et al.’s study [8], the reliability of the public railway system is examined by reducing the interdependency between trains and the homogeneity of the train timetable is evaluated. In Goverde’s study [9], a Max-plus method is used to evaluate the stability of a periodic timetable by considering the delay propagation of the initial ones. These studies evaluate the train timetable from the point of view of effects among train paths, some of which call for such a specific condition as no overtaking is allowed (see, e.g., [7]) or a periodic timetable is used (see, e.g., [8]). In China, the evaluation emphasis differs. Usually, evaluation indexes are proposed to evaluate specific features like the passenger service level and infrastructure utilization level, and then subjective scores are given as inputs to describe how good the features are. In Peng et al.’s study [10], an index system including passenger service quality and dynamic performance as well as timetable production efficiency is built, and the timetable is evaluated with a Grey theory based on expert scores. In Zhu et al.’s study [11], the vague sets (see, e.g., Gau and Buehrer [12]) from the fuzzy sets are applied to another index system, which is proposed for the passenger-dedicated line in terms of passenger transport demands, in order to deal with the experts’ scores so that the timetable’s evaluation can be gained.

The TTQ impacts the rail transport system directly, but it is difficult to compare the work skills of TMs. The major reason is that when a train path is set, one needs to consider several different constraints, usually including capacity constraints, which involve the running time of a train between stations, headway distances, crossover constraints, and so forth (see, e.g., [1]). Meanwhile, these constraints are caused by traffic flow, such as the number of trains and train stop patterns. Usually, we consider all the relevant factors such as capacity constraints and traffic flow as the background of the timetable. Once the timetable background is changed, the timetable features become incomparable. That is why when we try to evaluate a timetable’s quality, a subjective input like an expert score is involved (see, e.g., [10, 11]). However, the result of this method is unstable because it is based on the assumption that the experts are familiar with the timetable background. As mentioned before, when a TM adjusts a train path, since the constraints for the train paths will affect each other, the timetable background changes at the same time. Due to this consideration, there is no guarantee that the experts will give an objective score. For example, supposing we have 2 lines, one consisting of 100 trains with two speeds, 120 km/h and 140 km/h, and the other consisting of 80 trains with four speeds, 160 km/h, 140 km/h, 120 km/h, and 80 km/h, given the different traffic flow and capacity constraints, it is hard to say which timetabling process is better. As the timetable background varies from line to line, the key point in evaluating the TTQ is to find a relative index which is still comparable even when the timetable background changes. Then, it will be possible to abandon the subjective inputs in the evaluation.

This paper introduces a TTQ evaluation method where the infrastructure features and traffic flows are no longer relevant. This allows us to determine the skill of the TMs even if the timetable background is different. We tested the method on different lines and obtained objective evaluation results without any subjective inputs, where the results showed the method to be effective and reasonable. As far as we know, this TTQ evaluation method is new.

The construction of this paper is as follows. In Section 2, we describe the problem and propose a train path efficiency index to evaluate the timetabling quality. In Section 3, we analyze the elements of the train path efficiency and give calculation methods. In Section 4, a solution model of train path efficiency based on Data Envelopment Analysis (DEA) is given, and the model is solved by linear programming. The method is verified with real-world timetables in China in Section 5, while in the final section some conclusions are given.

2. Problem Description

In TTP, the shortest running time between two stations is known as the ideal running time (see, e.g., [13]). A timetable with the ideal running time and minimum stop time is called an ideal timetable (see, e.g., [1]). In real-world cases, it is difficult to set an ideal timetable for every train, because some trains will conflict with others and violate the capacity constraints. To make a conflict-free timetable, some trains need to stop at a station longer or to slow down in the rail sector. In China, we allow TMs to modify the stop pattern and stop time of a train to meet the capacity constraints. Once the train type is given, the timetabling quality is affected mainly by the adjustment of the departure and arrival time instants as well as extra stop time.

An example is given to show how a train TM affects the timetabling quality in Figure 1: T and K are train types, where T is a long-distance train with a fixed departure time at station A and K is a short-distance train with a variable departure time at station A, and the overtaking is due to capacity constraints. By modifying the departure time at station A, the improved train paths (expressed with dashed lines) improved the performances; for example, K1′ has a better stop equilibrium because of the shorter average stop distance and K2′ has less total travel time because some unnecessary stops are avoided.

Figure 1: Example of timetable.

From this simplified example, we can see that as we allow the TM to modify the departure and stop time at stations (at both the departure station and the intermediate stations), the train path performance can actually be improved. Thus, the TTQ, which indicates the TM’s work skill, can be reflected through the adjustments of train paths. Because of the different speeds and stop patterns of trains, some stopping due to capacity constraints is inevitable, for example, if we imagine that we have a timetable that has scheduled lots of trains with different speeds, and it is obvious that the slow trains will be overtaken by fast trains and cause a slower speed feature. Yet, this overtaking is necessary; otherwise, no feasible solution could be found for the slow trains. Considering this, a good TM should try to modify the train path as follows: try to move the train path to see if this modification can avoid conflicts with other trains and meanwhile try to make the stop time more efficient, which means setting the stop time at a station to be as short as possible but respecting the minimum stop time constraints.

In Figure 1, we can see some examples of the modifications mentioned above. Once train K1 moved to K1′, although the total stop time does not change, considering the stop distribution feature, the stops of K1′ are more balanced. As for K1, which will make two stops, this will cause higher energy consumption because the train needs to accelerate and decelerate repeatedly. Also, once train K2 was moved to K2′, an overtake is avoided and this improves the travel speed (due to the shorter total stop time). But remember, if we want to schedule train K2 without overtaking, no solution can be found (considering a certain departure time window, e.g., within 2 minutes before and after the departure time of K2). So, the stop caused by overtaking for train K2 is necessary and this should be considered when we evaluate the TM’s work skill.

When we view a timetable that includes train paths which have different features such as stop patterns and speed, we can say that the TTQ is good if most stops of a train are necessary and balanced. Because the adjustments of train paths are done by TMs, it is natural that the train path efficiency can be used to evaluate the TTQ, which is also known as the TM work skill mentioned before.

If we consider a train path as a production unit, we can take a timetable as one production system which includes many production units with each unit having similar inputs and outputs. Thus, once we manage to find a way to obtain the efficiency of the units, we can analyze the TTQ objectively.

This proposal is reasonable because trains are scheduled one by one, attempting to find the best solution with respect to the formed structure (see, e.g., [1]). This will lead to a solution in which, for each train of the same type, the efficiency is as similar as possible. And a train path with lower efficiency will have worse quality.

In this paper, we propose a train path efficiency index that uses the concept of the production unit efficiency. Then, we use this train path efficiency index to evaluate the timetabling quality. To obtain the objective value of the train path efficiency, a Data Envelopment Analysis (DEA) method is applied. As the proposed index does not need subjective inputs, it is more reliable than other evaluation methods.

3. Train Path Efficiency

A train timetable contains several train paths, which define the location where a train is supposed to be at a given time instant. To schedule a train, two behaviors are involved: travel between stations and stops at stations. So, the rail line can be separated into two parts: the sector track between two stations and the station track at a station. Taking these as transport resources, each train path will then consume these transport resources. Then, a train has certain technical features like the stop time at a station, travel speed between two stations, and so forth. Taking these as technical productions, each train path will produce these technical productions at the same time. As a simple example, occupation of the sector track will produce travel speed. We define the ratio of production and resource as a kind of efficiency, in the case above, the ratio of travel speed and track occupation time of the sector, and then this efficiency is comparable without loss of generality. As mentioned, assuming that two trains are of the same type, if an extra buffer time is set for one of them, then the track consumption between two stations will increase and the travel speed production will decrease, which will cause a lower efficiency. This is because, for the same type, the extra buffer time is assumed to be the same for every train. For the occupation of the station track, consuming the resource will produce the stop time for checking of the rolling stock and passenger loading/alighting. If we suppose that the stop time is for passenger services, we can define another efficiency, which is the ratio of production and resource, specifically, of the effective stop time and station track occupation time. Remember that the TM can prolong the stop time of a train to resolve conflicts with other trains and that trains of the same type should have the same or nearly the same service level. If a train stops at a station longer than others, this train path will have a worse travel speed and lower efficiency.

Because of the capacity constraints and traffic flow, the stop pattern and extra buffer time are highly dependent on the timetable background. This makes it hard to find a certain solution that defines how good the performance a train path should be since the TTP problem is NP-hard itself (see Caprara et al. [1]). In this case, the evaluation of train path efficiency should be relative, which means that a given train path is relatively good compared with others. Because of this relative feature, the timetable background is involved in train path efficiency and makes the train path efficiency comparable. This relative feature is important when we try to evaluate the TTQ because, by applying the train path efficiency, we can abandon the subjective inputs in order to get a more reliable result.

Meanwhile, since the train path efficiency is relative, it is possible that the efficiency value is good, while for every train path, the absolute efficiency is low. But this case will not happen in practice because, as mentioned before, the timetabling process is to find the best solution for each train path with respect to the constraints. Therefore, the absolute low efficiency train path will never be selected and this avoids naturally the disadvantage of relative evaluation.

The display of train path not only affects the train path efficiency, but also has a strong impact on the dynamic features of the timetable such as its robustness and reliability. The dynamic aspect of the timetable is mainly about setting extra buffer time between train paths and using this extra buffer time to absorb possible delays in order to reduce the propagation. Usually, we set this extra buffer time according to the data that indicates where and when the delay will happen. We refer readers to Cacchiani and Toth [6] for further details over this problem. However, in this paper, we assume that the buffer time set is balanced, which means that the TMs set the buffer time equally between every train path. Thus, we can ignore the buffer time evaluation and the dynamic features of the timetable are therefore out of the scope of this paper.

To obtain the value of train path efficiency, one possible way is to give each element of resource and production a weight and then use the weighted ratio of productions and resources as the value of the train path efficiency.

Consider a technical output set given out by train path , known as production; is a transport resource set consumed by train path , known as resource. The efficiency of train path is defined aswhere is the number of train paths and and are the weight sets.

Although and depend on the traffic flow, infrastructure features, and so forth, the relative feature of the train path efficiency guarantees that its value is comparable even when the timetable background is different. By analyzing the train path efficiency in a timetable, we can evaluate the quality of the timetabling.

Notice that other train path efficiency criteria such as the ratio of loading/alighting volumes and stop time, the ratio of incomes, and costs of each train path could be proposed. However, in this paper, we focus on the technical features of the timetabling, so the service and economic features are not considered and will be surveyed in the future.

To get , we need to analyze the transport resources and the technical productions of a train path. We propose two kinds of transport resource and four kinds of feedback production. Again, these proposals are from the technical point of view.

3.1. Train Path Transport Resource

A train path occupies the sector and station tracks, and we give the calculation method of them in this subsection.

3.1.1. Sector Track Occupation Time

Train path passes sectors, is the length of sector , and is the speed of train path in sector . The sector occupation time for train path is

3.1.2. Station Track Occupation Time

Train path stops at station ; for each station, the station track occupation time starts from the signal that has been prepared and ends when the station throat is clear. So, it is longer than the actual stop time of the train at the station. The station track occupation time for train path at station iswhere is the running time, from when the signal has been prepared for the train to enter the station until the train arrives at station , which iswhere is the breaking distance, is the protection distance, is the distance from the signal to the stop point, is the average approaching speed until stopping, and is the approaching time, which is the reaction time for the train driver to confirm the signal and respond with corresponding operations [14].

is the stop time for train path at station , given bywhere and are the arrival and departure time instants at station , respectively.

is the departure interval of train path at station ; it starts when the departure signal is ready and ends when the train has left the station and the station track can be used by other train paths, which iswhere is the distance from the stop point to the departure signal, is the leaving block length, is the train length, is the average leaving speed, and is the departing time, which is the reaction time for the train driver to confirm the signal and respond with corresponding operations [14].

Because the signal set and station tracks are not always the same for every station, the track occupation time may differ from station to station. The total station track occupation time of train path is

3.2. Train Path Technical Production

The train path technical production includes the efficient stop time and several kinds of speed. Once a train stops at a station, there is an ideal stop time which is the minimum stop time with respect to the capacity constraints or passenger loading/alighting stop time limitations. But usually it is hard to set every train path to have the ideal stop time at each stop. Generally, we believe that the ideal stop time is efficient, and the stop time beyond ideal stop time is inefficient. So, we propose the efficient stop time in order to check the adjustments of train paths. Considering that each train path should have an equilibrium stop distribution and that the TMs can adjust the stop pattern, we propose different kinds of speed to evaluate the stop pattern. An example of two stop patterns with the same number of stops is given in Figure 2. In the example, plan (a) is worse because the stops are bunched and this will increase the energy consumption for frequent acceleration and deceleration.

Figure 2: Stop distributions.

We propose four kinds of speed as the technical productions of a train path, which are the efficient stop time, average running speed, average travel speed, and travel speed.

3.2.1. Efficient Stop Time

For train path at station , the minimum stop time is determined by the passenger loading/alighting needs or the capacity constraints. As the minimum stop time differs from stations and trains, we use to express the overall efficient stop time of train path at station , so the efficiency stop time for train path is

3.2.2. Average Running Speed

For train path in sector with the length , there are a maximum track speed , maximum locomotive speed , and maximum vehicle speed . Because the minimum running time in sector is limited by the maximum possible speed for train path in sector , the average running speed is

3.2.3. Average Travel Speed

For train path in sector with the length , is the running speed of train path in sector , and there are an acceleration/deceleration extra time and an extra running time .

Whether or not an acceleration/deceleration extra time is added depends on whether or not the train path stops at the start/end station of the sector. If the train path stops at the start station of sector , an acceleration extra time should be added; if the train path stops at the end station of sector , a deceleration extra time should be added. Thus, is

In (10), and are binary variables, equal to 1 if the train stops at the corresponding stations mentioned above. The extra running time is due to the buffer times. The average travel speed is

3.2.4. Travel Speed

For train path , this is determined by the total travel distance and total travel time, which is

Here, we give some explanations of the proposed speeds. Formula (9) checks if the rolling stock plan is appropriate. The rolling stock should be used according to the type of train. This means that a high-speed rolling stock unit should be assigned to a high-speed train and vice versa. Using a fast train unit to run a slow train is a waste and should be avoided. If faster rolling stock is assigned to a slow train, compared with other train paths with the same average running speed, the track occupation time will be larger. This will cause the transport resource consumption to increase and reduce the train path efficiency. Formula (11) checks if the stop is at equilibrium. Given a certain number of stops, the average travel speed will be lower if the stops are concentrated. Moreover, extra time should be added equally to every train path as well, or else some train paths will have lower performance if more extra time is assigned. For two trains of the same type, if the number of stops is the same, the train path with an equilibrium stop pattern will have a higher average travel speed; if the number of stops and the stop patterns are the same, the train path with less extra time will have a higher travel speed.

4. Train Path Efficiency Calculation and Timetabling Quality Evaluation

The value of train path efficiency is determined not only by the train path itself but also by the other train paths in a timetable. This is because one train path becomes a constraint for the others once it has been scheduled. Good TTQ means a highly balanced train path efficiency value for all train paths. As the proposed train path efficiency is a weighted ratio, the value of train path efficiency is decided by the weight parameters. We need to set an objective weight for every element of the train path efficiency in order to get an objective result. In this sector, we introduce a Data Envelopment Analysis (DEA) method to get an objective value of the train path efficiency. The benefit of this application is that DEA allows us to calculate the relative efficiency of a production unit in a production system, while all the parameters are decided by the feature of the production system itself. This means that no subjective input is required and can lead to a more reliable result.

4.1. Index Definition and Solution Method Based on DEA

Taking the train path as a production unit, each train path uses resources with positive numbers (value of item used by ) to produce productions valued by (value of item produced by ); suppose we have kinds of output and kinds of input, and the efficiency of train path is defined as

It can be solved using DEA method in a short computation time.

DEA was proposed by Charnes, Cooper, and Rhodes. It is an efficient way to qualify the relative efficiency by searching for the best virtual producer using linear programming models [15]. For a group of producers that consume the same kinds of resources and produce the same kinds of productions, DEA allows us to evaluate the efficiency of each producer with the model below:

For producer , the model finds a virtual producer with respect to the global productivity by solving linear programming models and then uses parameters and of the virtual producer to get the relative efficiency of producer . We can see that as no subjective input is needed for the process, the result is therefore objective. We refer readers to Charnes et al. [15] for a better knowledge of the model above.

4.2. Solution Model of Train Path Efficiency

As a multi-input-output system efficiency evaluation problem, we apply DEA to build the train path efficiency solution model:where is the efficiency value of train path proposed in (1) and and are parameters decided by the linear programming model.

Set , , , , , , , using the Charnes-Cooper transformation to simplify the model [15, 16]:

By solving linear programming models, we can get the train path efficiency value set and evaluate the timetabling quality.

4.3. Evaluation of Train Timetabling Quality

We evaluate the TTQ based on the train path efficiency value set . As mentioned before, the average train path efficiency can be used to evaluate the TTQ; therefore, we use the train path efficiency expectation (TEE)as the evaluation results of TTQ.

In addition, let where is the given train path efficiency value; we introduce a train path efficient distribution function (EDF) with interval to describe the distribution of train path efficiency of the timetable:

The TEE shows the average level of train path efficiency, which is in positive correlation with TTQ. It is obvious that a timetable with a higher TEE has a better TTQ. Meanwhile, EDF gives the efficiency distribution, which can help us to analyze the train path efficiency distribution of a timetable in detail.

5. Case Study

In this section, we use real-world timetables in China to verify our TTQ evaluation method. As mentioned before, the relative feature of train path efficiency is the key to evaluate the TTQ. In this section, we first show the relative feature of the train path efficiency. Then, we evaluate the TTQ of timetables with different backgrounds and compare their TTQ to show that our method can give objective results.

5.1. Train Path Efficiency Feature Test

The first case is the 119 km Shibantan-to-Xinqiao line with 4 intermediate stations. The maximum track speed is 200 km/h and 112 trains of four types are scheduled. We use and to represent and as an approximation. Other parameters are as follows:  min. Because is highly dependent on the number of passengers that are loading/alighting as well as the constraints caused by overtaking, in the test, we simplify cases as below:If the stop is for passenger loading/alighting, then set as the actual stop time.If the stop is due to a train overtaking, then is set to 9 min, and if there is more than one train overtaking, is set to ) min, where is the number of trains that are overtaking.If the stop involves both of the above, then set has the largest value.

The model is solved by Lingo 11 within 1 second on a Win7 64-bit 8 GB Core 2 personal computer. We report the train path efficiency value with the total number of stops (see Table 1) and the layout of travel speed with efficiency value to express the relative feature (see Figure 3), where the down trains run from Xinqiao to Shibantan and the up trains run in the opposite direction. The TEE is 0.8412, and a DEF with interval 0.1 is given (see Table 2).

Table 1: Train path efficiency value.
Table 2: Efficient distribution function (EDF) with 0.1 interval.
Figure 3: Train path travel speed-efficiency value layout.

In this case, the value of train path efficiency is not relevant to the train type, which means that although the train speeds are different, their train path efficiency is comparable. In fact, the computing results also show that the train path efficiency is not relative to the infrastructure features either (shown in the next test case). As expected, since the train path efficiency is objective, we can evaluate the TTQ more convincingly.

For fast trains (type D), the stop affects the train path efficiency significantly. One more stop will cause the train path efficiency to drop greatly, for example, D5107 and D5109 (bold trains in Table 1). Given that the nonstop travel time for a fast train is 38 min 25 sec, one stop will increase the travel time by 15.6% (6 min). This means that fast trains are sensitive to the total travel time. For slow trains (types T, K, and X), the average stop time is 17 min 10 sec, while the average travel time is 1 h 27 min 15 sec. Due to the capacity constraints, they have to stop to let fast trains overtake. The increase of travel time caused by the stop is 19.54%. This means that slow trains are less sensitive to the total travel time than fast trains (see Figure 3).

Considering the sensitivity differences, it is better to schedule the fast train with fewer stops. This conclusion is logical because as the travel time between stations decreases, the train is more competitive with different means of transport. We would like to mention here that because the train path efficiency is a relative value, if most fast trains stop a lot, the relative value will not be impacted. This shows how the train path efficiency reflects the train plan and makes the result more reliable.

In the case investigated, over 98% of trains have an efficiency value greater than 0.8. But some slow trains have low efficiency because of their long stop times (see Table 3). From this result, we can conclude that, compared with the efficient stop time, a longer stop will cause a decrease in train path efficiency.

Table 3: Trains with stop time over 30 min.

The train path efficiency distinguishes the stop distribution differences as expected. Taking trains K587 and K697 as an example, the total stop times are 32 min and 34 min. Train K587 stops twice while train K697 stops only once, and the lower average travel speed leads to a worse efficiency value for K587. In another result, T248 has a higher train path efficiency than K1094 although the total stop time is longer. This is because T248 has a better stop plan (see Figure 4). This means that the stop distribution is more important than the total stop time for this case. But note that this conclusion is based on a specific case and that it is possible that the total stop time is more important than the stop distribution in other cases.

Figure 4: Station distributions.
5.2. Timetabling Quality Comparison Test

The second case is the 393 km, double-track, mixed traffic Qingdao-to-Jinan line with a maximum track speed of 200 km/h. We use the 2012 and 2013 timetables with different numbers of trains, and the parameters are the same as the first case. Note that as the number and composition of trains are different for these two timetables, based on the existing evaluation method, we cannot say which one has a better TTQ, while subjective input like an expert score cannot guarantee a reliable result either. We use the train path efficiency proposed to evaluate the TTQ of these two timetables. All results are computed within 4 seconds on the same computer. As before, we report the TEE as well as the EDF with a 0.1 interval as Table 4 shows.

Table 4: Evaluation results of Qingdao-to-Jinan line.

As mentioned in the first case, because the timetable background has changed, the train path efficiency value shows its relative feature since the values of train path efficiency are in the same region. Again, this proves that we can use this train path efficiency to evaluate the TTQ without considering the timetable background.

Compared with the 2012 timetable, in the 2013 timetable, 15 more trains are scheduled, and the TEE decreased by 0.0065. We can conclude that the timetabling quality is worse for 2013. One possible reason is that as the number of trains increased, the line became more congested. Because of the short-sighted nature of manual timetabling, it is difficult to find an optimized path for every train. Therefore, automatic timetabling should be applied for the case of congestion.

If we compare the evaluation results of the three cases, we will find that the timetables of the Qingdao-to-Jinan line have a higher TEE. This means that the TTQ of Qingdao-to-Jinan line is higher even though this line has a more congested traffic flow. This indicates that the TM in charge of the Qingdao-to-Jinan line is more skilled at his work.

The main reason why the Shibantan-to-Xinqiao line has a worse TTQ is that many trains have to make quite long stops, as shown in Table 3. This makes the stop time efficiency worse and means that the timetable could be optimized by adjusting some of the train paths, although the TM has not done this. So, the skill level of the TM in charge of the line of the first case is worse.

6. Conclusions

There is little research on the evaluation of timetabling quality. In this paper, we propose a relative train path efficiency index, and the value of train path efficiency is computed by applying DEA method. The timetabling quality was evaluated by the statistical analysis of the train path efficiency value. The method was verified by real-world train timetables in China and the results showed that it is practical.

Further research will specify the efficiency part of the total stop time and verify the train path efficiency at the passenger service level. Another possibility is the application of sensitivity analysis to identify possible improvements of the train path efficiency.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.


The first author would like to express gratitude for the support from the National Railway Train Diagram Researching and Training Center, Southwest Jiaotong University, and the support of the Chinese Natural Science Foundation under Grant no. 61403317 and Technology Department of China Railway Cooperation under Grants nos. 2013X010-A and 2014X004-D. The authors also appreciate the valuable comments from Dr. V. Cacchiani, DEI, University of Bologna.


  1. A. Caprara, M. Fischetti, and P. Toth, “Modeling and solving the train timetabling problem,” Operations Research, vol. 50, no. 5, pp. 851–861, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. U. Brännlund, P. O. Lindberg, A. S. Nou, and J.-E. Nilsson, “Railway timetabling using lagrangian relaxation,” Transportation Science, vol. 32, no. 4, pp. 358–369, 1998. View at Publisher · View at Google Scholar · View at Scopus
  3. X. Zhou and M. Zhong, “Bicriteria train scheduling for high–speed passenger railroad planning applications,” European Journal of Operational Research, vol. 167, no. 3, pp. 752–771, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  4. C. Liebchen and R. H. Möhring, “A case study in periodic timetabling,” Electronic Notes in Theoretical Computer Science, vol. 66, no. 6, pp. 18–31, 2002. View at Publisher · View at Google Scholar · View at Scopus
  5. L. G. Kroon and L. W. P. Peeters, “A variable trip time model for cyclic railway timetabling,” Transportation Science, vol. 37, no. 2, pp. 198–212, 2003. View at Publisher · View at Google Scholar · View at Scopus
  6. V. Cacchiani and P. Toth, “Nominal and robust train timetabling problems,” European Journal of Operational Research, vol. 219, no. 3, pp. 727–737, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. T. Huisman and R. J. Boucherie, “Running times on railway sections with heterogeneous train traffic,” Transportation Research Part B: Methodological, vol. 35, no. 3, pp. 271–292, 2001. View at Publisher · View at Google Scholar · View at Scopus
  8. M. J. C. M. Vromans, R. Dekker, and L. G. Kroon, “Reliability and heterogeneity of railway services,” European Journal of Operational Research, vol. 172, no. 2, pp. 647–665, 2006. View at Publisher · View at Google Scholar · View at Scopus
  9. R. M. P. Goverde, “Railway timetable stability analysis using max–plus system theory,” Transportation Research Part B: Methodological, vol. 41, no. 2, pp. 179–201, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. Q. Y. Peng, J. J. Bao, C. Wen et al., “Evaluation theory and method of high–speed train diagrams,” Journal of Southwest Jiaotong University, vol. 48, no. 6, pp. 969–974, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. T. Zhu, H. Wang, and B. Lu, “Method for optimally selecting the train diagram of passenger dedicated line based on Vague sets,” China Railway Science, vol. 32, no. 4, pp. 122–127, 2011. View at Google Scholar · View at Scopus
  12. W. L. Gau and D. J. Buehrer, “Vague sets,” IEEE Transactions on Systems, Man and Cybernetics, vol. 23, no. 2, pp. 610–614, 1993. View at Publisher · View at Google Scholar · View at Scopus
  13. P. Vansteenwegen and D. Van Oudheusden, “Developing railway timetables which guarantee a better service,” European Journal of Operational Research, vol. 173, no. 1, pp. 337–350, 2006. View at Publisher · View at Google Scholar · View at Scopus
  14. Y. Zhang, C. Tian, X. Jiang, and Y. Wang, “Calculation method for train headway of high speed railway,” China Railway Science, vol. 34, no. 5, pp. 120–125, 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. A. Charnes, W. W. Cooper, and E. Rhodes, “Measuring the efficiency of decision making units,” European Journal of Operational Research, vol. 2, no. 6, pp. 429–444, 1978. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. W. W. Cooper, L. M. Seiford, and K. Tone, Data Envelopment Analysis, vol. 71, Kluwer Academic Publishers, New York, NY, USA, 2004.