- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Discrete Dynamics in Nature and Society
Volume 2012 (2012), Article ID 451201, 11 pages
Study on the Train Operation Optimization of Passenger Dedicated Lines Based on Satisfaction
School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, China
Received 22 August 2012; Accepted 13 September 2012
Academic Editor: Wuhong Wang
Copyright © 2012 Zhipeng Huang and Huimin Niu. 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 passenger transport demands at a given junction station fluctuate obviously in different time periods, which makes the rail departments unable to establish an even train operation schedule. This paper considers an optimization problem for train operations at the junction station in passenger dedicated lines. A satisfaction function of passengers is constructed by means of analyzing the satisfaction characteristics and correlative influencing factors. Through discussing the passengers’ travel choice behavior, we formulate an optimization model based on maximum passenger satisfaction for the junction and then design a heuristic algorithm. Finally, a numerical example is provided to demonstrate the application of the method proposed in this paper.
In passenger dedicated lines, passenger trains feature high-speed, high-density, and small train-unit, and the characteristics of passenger transport demands are similar to those of city bus passenger demands. Therefore, train operations in passenger dedicated lines need to be designed differently from the cases in other lines. In particular, train operations at junction stations must be schemed based on the changing of passenger demands. Many scholars had studied the train plan problem in passenger dedicated lines. Crisalli presented a system of within-day dynamic railway service choice and assignment models, which were used as a large decision support system for the operational planning of rail services . Salido and Barber presented a set of heuristics for a constraint-based train scheduling tool to formulate train scheduling as constraint optimization problems . Freling et al. introduced the problem of shunting passenger train units in a railway station. Shunting occurs whenever train units are temporarily not necessary to operate a given timetable . Some other scholars noticed that passenger flows were much uneven in different time-periods in everyday, so they studied the dynamic feature of passenger flows. Niu presented a matching problem between skip-stop operations and time-dependent demands in city headways, and formulated a nonlinear programming model which minimized the overall waiting time and in-vehicle crowding costs . Jha et al. studied the alternative travel choices which were evaluated by a disutility function of perceived travel time and perceived schedule delay, and formulated a Bayesian updating model to optimize an alternative scheme . He et al. presented a fuzzy dispatching model to assist the coordination among multiobjective decisions in railway dispatching plan . Nie et al. considered the passenger choice behavior in rail, and proposed a calculation method of network impedance which could reduce the influence of different travel distance in passengers choice behavior . Chang et al. developed a multiobjective programming model for the optimal allocation of passenger train service on an intercity high-speed rail line without branches. Minimizing the operator's total operating cost and the passenger's total travel time loss is the two planning objectives of the model . Shi et al. established a multiobjective optimum model of passenger train plans for dedicated passenger traffic lines by balancing benefits of both railway transportation corporations and passengers, and proposed a method to solve the optimization problem . Ghoseiri et al. developed a multiobjective optimization model for the passenger train-scheduling problem on a railroad network which included single and multiple tracks . In this study, lowering the fuel consumption cost was the measure of satisfaction of the railway company, and shortening the total passenger-time was being regarded as the passenger satisfaction criterion.
In previous studies, operation plans of passenger trains were mainly studied on optimizing transport organization in rail lines, including the train stop-schedule, service frequency, fleet size, and so forth. However, research on optimizing transport organization at a junction station is less concerned by other scholars. In general, the optimization objective of train operations for rail departments is to utilize trains efficiently and to lower travel cost for passengers. Therefore, the optimized train operations should be balanced between rail departments' operating cost and the travel cost of passengers. However, passenger demands are uneven in different time-periods, and train-set quantity is limited at junction stations; the train-set quantity probably cannot meet passenger demands at peak time-period. Passengers will be unsatisfied when their travel cost is increased by longer waiting time or raised ticket price. Thus, it is important to reasonably arrange the train’s quantity and degrees in different time-periods. In this paper, we will focus on the matching of passenger train quantity with passenger demands at junction stations in different time-periods in passenger dedicated lines.
This paper is organized as follows: Passenger demands and travel choices at peak time-period are discussed in Section 2. An optimized model is built in Section 3, whose objective is to get maximum total passengers’ satisfaction at the junction stations. In Section 4, a heuristic algorithm is designed to meet the changing of passenger demands and satisfy the constraint of train-set quantity. A numerical example is provided to illustrate the application of the model and algorithm in Section 5. The last section highlights the conclusion, and suggests future research directions.
2. Problem Statement
2.1. Passenger Demands and Travel Choices
As mentioned above, the passenger demands in passenger dedicated lines are heavily different at different time-periods, thus train operations show irregularly in every time-period at junction stations. Previous studies have discussed the departing interval of trains at junction stations based on the condition that passenger transport demands and capacities are equal during the peak time-periods. In fact, the hypothesis is unreasonable when passenger transport demands are larger than capacities during the peak time-periods. Therefore, the railway departments can not arrange enough trains to meet the passenger demands in the peak time-periods.
Passengers mainly consider the degree and departing time of trains when they choose railway to travel. However, passenger demands are larger than transport ability during the peak time-periods. In this case, this paper considers that passengers probably choose the following suboptimal travel schemes for themselves: avoiding the peak time-periods and taking a train of the same degree to travel in another time-period; choosing a train of another degree to travel when its quantity is large enough in the same time-period.
2.2. Optimization Methods
The optimization objective for train operations at junction stations is to get maximum passenger satisfaction. Passenger satisfaction for train operations, presented in this paper, is an important indicator to evaluate the train operations. Here, the service time at junction stations is divided into time-periods, according to which passenger demands and train-set quantity at junction stations are obtained, respectively. The time-periods in which passenger demands are larger than transport abilities are defined as peak time-periods. Finally, train operations in peak time-periods are organized according to the following two schemes.
2.2.1. Transferring Passenger Demands
The process that passengers choose the suboptimal schemes to travel is shown in Figure 1. The parameters and represent some time-periods in the service time at the junctions, respectively; and indicate the aboard process that passengers take and degree trains, respectively; and indicate the travelling process that passengers take and degree trains, respectively; represents the fare loss of passengers who intend to take degree train but are transferred to degree train; f represents travelling time loss of the passenger who intends to take degree train but is transferred to degree train; indicates the waiting time cost of passengers who have to travel in time-period .
2.2.2. Adjusting Operation Section of Train-Set
Passenger demands generate at the junction stations, from which passenger trains are dispatched to different terminal stations , , and in passenger dedicated lines as shown in Figure 2.
As mentioned above, the transport capacity is limited at a junction station because the train-set quantity is affected by its operation mode. Stationary operation mode of train-set is used in most of the passenger dedicated lines presently; train-sets are operated on fixed railway sections as shown in Figure 3. represents a train-set; represents the departure interval of the same kind of train-sets at stations. In general, the value of is larger than that of , which represents the train service time at stations as shown in Figure 3(a). However, the value of must be minimized to just meet train servicing time at stations; the value of is equal to that of in peak time-period as shown in Figure 3(b). Thus, the measure ensures that the train-set operation will be optimized and the transport capacity will be raised.
Train-sets are not utilized completely in normal periods according to the above analysis. The paper introduces a method to adjust some train-sets from one rail section to another. For example, is the peak time-period for rail section 1 but not for rail section 2. Moreover, there are superfluous train-sets in rail section 2, then we can adjust some from section 2 to section 1 in time-period .
3. The Train Operation Model
3.1. Definitions and Notations
The following notations are used to describe the proposed model.
is the set of time-periods, .
is the set of train degrees, .
is the set of terminal stations, .
is the demands of passengers who prepare to get th degree trains to th terminal station in th time-period.
is the train-set quantity of th degree trains which are dispatched to th terminal station in th time-period.
is the maximum number of seats in th degree trains.
is the passenger satisfaction when passenger’s departure time is changed from th to th time-period.
is the passenger satisfaction when passenger train is changed from th to th degree.
is the weighted average satisfaction of total passengers who prepare to get to th terminal station by th degree trains in th time-period.
Three intermediate variables are defined as follows.
is the passenger demands which can be contented in .
is the passenger demands which are adjusted to travel in th time-period.
is the passenger demands which are adjusted to travel by th degree trains.
The decision variable is defined as follows.
is the train operation quantity when rail department organizes th degree trains to th terminal station in th time-period.
3.2. Passenger Satisfaction Function
3.2.1. Passenger’s Sensitivity for Changing Their Travel Plan
For every passenger who prepares to travel by th degree train in th time-period, their satisfactions are different. In this paper, the satisfaction value is set to 1 when the passenger’s travel plan is contented; otherwise, the value is smaller than 1. Passenger satisfactions are on account of passenger’s sensitivity for the changing of their departure time or train degree. The passenger’s sensitivity for departure time is a tolerable degree for waiting time when passengers have to change their departure time to travel. The passenger’s sensitivity for train degree is a tolerable degree for ticket price rise when passengers have to change the train degree to travel.
The function is defined to illustrate the passenger’s sensitivity when their departure time is delayed. It is related with the waiting time and travel time as shown in formula (3.1). The formula reflects a ratio relation between the waiting time at junction stations and the travel time in lines. In this formula, numerator represents the passenger’s waiting time at junction stations, and denominator shows the travel time on lines. The passenger’s departure time is put off to the next time-period when . Otherwise, . Consider where is the average waiting time of every time-period. represents the travel time from junction station to the th terminal station.
The function is defined to illustrate the passenger’s sensitivity when their train degree is changed. It is related with the rangeability of ticket price, as shown in (3.2). The value of is larger than that of when the value of is less than that of . The passenger’s satisfaction does not decrease with the reducing of ticket price in this case but will decrease with the changing of their travel plan. Here, is introduced to present the descending of passenger satisfaction: where, is the parameter when the train degree is changed, . represents the ticket price of th degree train from the junction station to th terminal station.
3.2.2. Passenger Satisfaction for Changing Travel Plan
The value of is correlative with the function . The larger the value of , the smaller the value of . The passenger satisfaction function for changing train departure time can be defined as (3.3). In the same way, has similar character, and the passenger satisfaction function for changing train degree is defined as (3.4):
3.2.3. Passenger Satisfaction Function
In this paper, passenger satisfaction is defined as formula (3.5) representing the weighted average satisfaction of total passengers who prepare to get to the th terminal station by the th degree train in the th time-period:
3.3. The Division Method of Time-Period
According to the above analysis, passenger satisfaction will decrease when passenger’s waiting time is enlarged at junction station, as passenger’s waiting time will increase with the prolonging of the time-period. Thus, time-periods are divided according to the minimum passenger satisfaction . The time-period division is unreasonable when the value of is less than . This paper computes the value of when the parameter is equal to , and uses the value of as the dividing standard of time-period, as shown in formula (3.6). The number of time-periods is calculated by (3.7): where is the number of time-periods, and denotes the length of service time in passenger dedicated lines.
3.4.1. Objective Function
Here, represents the weighted average satisfaction of total passengers who prepare to get to th terminal station by th degree train in th time-period, and the range of value is from 0 to 1. In (3.8), the objective is to get maximum total passenger satisfaction: where, represents the satisfaction of passengers who get to th terminal station at th time-period. is the satisfaction of all passengers who get to th station.
The constraint of even passenger flow is shown in (3.9). The value of can be divided into , , and when the passenger demands cannot be contented completely in peak-periods. indicates the demand of passengers who prepare to travel in th time-period and probably to be assigned to other time-periods. Consider
The constraint of the train operation quantity balance is shown in (3.10). In this formula, , is the symbol of modular division. The formula indicates that the train quantity should meet the passenger demands . Similarly, the formula and represent the train quantity meeting the demands and , respectively:
The constraint of the train-set quantity is shown in (3.12), which represents that train quantity is restricted by train-set quantity :
The nonnegative and integer constraint is shown in: and are integer.
4. Algorithm Design
This paper designs a heuristic algorithm of train operation based on maximum passenger satisfaction. The algorithm process is shown as follows.
Step 1 (initialization). Firstly, the smaller value between train-set and train demand quantity is assigned to the train operation quantity, namely . Secondly, the value of demands is assigned to intermediate variable , and 0 is assigned to intermediate variable and , respectively. Thirdly, define the counter and feasible scheme . Finally, the value of and are set to 0.
Step 2 (examining the balance constraint of train-set capacity and demand). If the train demand quantity is less than train operation quantity in some time-periods, namely , go to Step 3. Otherwise, go to Step 4.
Step 3 (passenger satisfaction examination). Firstly, take the value of meeting. Secondly, passenger satisfaction is calculated when the value of is larger than that of , and output this scheme . Otherwise, all passenger demands transformed from other time-periods are adjusted to prior time-period , and equal passenger demands generated at time-period are adjusted to th time-period. Then go to Step 4. Secondly, the counter is refreshed with the equation of .
Step 4 (adjusting scheme). The value of is assigned to the value of when the value of is larger than . Then, the value of is assigned equally to and , according to formula . Finally, the value of train-set quantity is refreshed by formula , and go to Step 2.
5. Numerical Example
In some passenger dedicated lines, passenger trains are only operated from the junction station to the terminal stations , , and . The travel time from the junction station to terminal stations , , and is 2, 3, and 5 hours, respectively, namely , , and . There are two degree trains, , . The trains’ ticket prices are shown in Table 1. The service time of every day is 14 hours from 6:00 to 20:00. The length of the time-period and the number of time-periods are computed according to (3.6) and (3.7). The calculation results: the value of is 3.3 hours, and the number of time-period is 4. The service time can be divided into four time-periods, from which the passenger demands collected are shown in Table 2.
The passenger demands can be transformed to train demands according to (3.10), and the constraint of train-set is given in the numerical example as shown in Table 3, where the notation and represent maximum train-set quantity and train demands. Then the datum, in which is less than , is adjusted to other time-periods or other degree trains according to the above heuristic algorithm.
This paper optimizes the passenger operation at the junction station according to the above model and algorithm in Table 4. The adjustment result of passenger demands is shown in Table 5, and that of the passenger satisfaction is in Table 6.
In this paper, an optimization model based on maximum passenger satisfaction for the junction station has been given. A heuristic algorithm is proposed to solve it. According to the scheme results, all passenger satisfaction is calculated. Average satisfaction of passengers who prepare to get to th, th, and th terminal stations are 0.87, 0.81, and 0.91, respectively. Minimum satisfaction of passengers who prepare to get to th, th, and th terminal station are 0.42, 0.45, and 0.4, respectively. The result shows that the method proposed in this paper can effectively solve the problem, and is suitable for formulating passenger train operation in passenger dedicated lines. Furthermore, it is an important topic for further research to consider the train operation based on collaborative optimization among several junction stations in passenger dedicated lines.
The work described in the paper was supported by National Nature Science Foundation of China under Grant no. 50968009 and no. 71261014, and the Research Fund for the Doctoral Program of Higher Education under Grant no. 20096204110003.
- U. Crisalli, “User's behaviour simulation of intercity rail service choices,” Simulation Practice and Theory, vol. 7, no. 3, pp. 233–249, 1999.
- M. A. Salido and F. Barber, “Mathematical solutions for solving periodic railway transportation,” Mathematical Problems in Engineering, vol. 2009, Article ID 728916, 19 pages, 2009.
- R. Freling, R. M. Lentink, L. G. Kroon, and D. Huisman, “Shunting of passenger train units in a railway station,” Transportation Science, vol. 39, no. 2, pp. 261–272, 2005.
- H. M. Niu, “Determination of the skip-station scheduling for a congested transit line by bilevel genetic algorithm,” International Journal of Computational Intelligence Systems, vol. 6, no. 4, pp. 1158–1167, 2011.
- M. Jha, S. Madanat, and S. Peeta, “Perception updating and day-to-day travel choice dynamics in traffic networks with information provision,” Transportation Research Part C, vol. 6, no. 3, pp. 189–212, 1998.
- S. He, R. Song, and S. S. Chaudhry, “Fuzzy dispatching model and genetic algorithms for railyards operations,” European Journal of Operational Research, vol. 124, no. 2, pp. 307–331, 2000.
- L. Nie, X. F. Hu, L. Tong, and H. L. Fu, “Research of passenger flow assignment based on passenger train plan,” Journal of Transportation Systems Engineering and Information Technology, vol. 11, no. 3, pp. 87–92, 2011.
- Y. H. Chang, C. H. Yeh, and C. C. Shen, “A multiobjective model for passenger train services planning: application to Taiwan's high-speed rail line,” Transportation Research Part B, vol. 34, no. 2, pp. 91–106, 2000.
- F. Shi, L. B. Deng, X. H. Li, and Q. G. Fang, “Research on passenger train plans for dedicated passenger traffic lines,” Journal of the China Railway Society, vol. 26, no. 2, pp. 16–20, 2004.
- K. Ghoseiri, F. Szidarovszky, and M. J. Asgharpour, “A multi-objective train scheduling model and solution,” Transportation Research Part B, vol. 38, no. 10, pp. 927–952, 2004.