Research Article  Open Access
Zhiqiang Tian, "Optimizing Crew Rostering with Multilicense on HighSpeed Railway Lines", Discrete Dynamics in Nature and Society, vol. 2014, Article ID 910569, 10 pages, 2014. https://doi.org/10.1155/2014/910569
Optimizing Crew Rostering with Multilicense on HighSpeed Railway Lines
Abstract
This paper studies the crew rostering problem with the consideration of multilicense of crewmembers. A 01 integer programming model is established to minimize the number of crewmembers used and to maintain the working time balance and the income balance of crewmembers. The method for calculating the reasonable cycle schemes is designed by considering the parameters of monthly working time standard and the number and the average working time of crew routes. The order for selecting the optimal cycle scheme is then determined with consideration of the connection relationships between crew routes. According to the characteristics of the problem and the requirements in application, this paper presents the design of an improved ant colony algorithm for solving the optimization model. The reasonableness of the model and the effectiveness of the algorithm are verified by a numerical example with 43 generated crew routes.
1. Introduction
Crew planning problem (CPP), one of the classic problems in operations research, is common in airlines, railway, urban public transport, and other transport industries. After costs for fuel, crew costs constitute the second largest expense of an airline [1]. An annual saving of tens of millions of US dollars for large airlines can be obtained by a good crew plan; hence, the research and application of the CPP in airlines start at an early stage. With the development of other transportation industries, their CPPs have received wide attention.
Due to its complexity, CPP is usually divided into crew scheduling and crew rostering phases [2, 3]. Crew scheduling plan usually combines the minimum units (e.g., flight legs and crew segments) into a task (e.g., flight duty and crew route) that can be accomplished in a day by one crewmember, whereas crew rostering plan assigns these tasks to crewmembers in a given cycle scheme (e.g., a week, a month, or a custom cycle) by satisfying various criteria. So far, many studies have focused on crew scheduling problem [2–5]. The operation cost of crewmembers can be saved greatly by a reasonable combination of work units. However, research on crew rostering problem started lately. Although the operation cost can still be saved by controlling the number of crewmembers, the workload and life quality of the crewmembers restrict the optimization degree of the costs.
Ernst et al. [6] presented a review of staff scheduling and rostering. They pointed out that rostering algorithms must be more general in the future because of the changing working environments and conditions. In practice, each problem has its own business characteristics and core problems to be solved. Thus, the rostering method is still developed for certain problems.
According to the different uses of crewmembers, the crew rostering problem can be solved in various ways following different approaches. For example, EmdenWeinert et al. [7] introduced a rostering system for tram and bus drivers at the Bremer Straßenbahn AG in Germany. The proposed system divides the drivers and duties at a depot into groups and then develops rotas for each group. In this study, we call this process grouped rostering, in which a rota is a pattern of rest days and shift type. However, individual rosters at most European airlines are constructed directly for each crewmember; this process is called personalized rostering [8–10]. In this situation, all crewmembers should have their own unique evaluation criteria or individual needs. All individual needs of crewmembers should be satisfied as much as possible to generate feasible rotas. Chu [9] dealt with a personnel planning problem in an international airport by decomposing it into a duty generating phase (a GP planner), followed by GP scheduling and rostering phase. Maenhout and Vanhoucke [11] indicated that the objective of this problem is to assign a personalized roster to each crewmember, which minimizes the overall operational costs while ensuring the social quality of the schedule. They also compared the proposed scatter search algorithm with optimal solutions obtained by an exact branchandprice procedure and a steepest descent variable neighborhood search. Chu et al. [12] proposed another type of crew rostering plan with a single cycle, which combined all crew routes into a single loop. Although this method could realize the absolute equilibrium of working time, the cycle of the plan is determined by the number of crew routes, which reduces the flexibility and adjustability of the plan. The common feature of the former two approaches is that the cycle scheme of the plan is determined before planning. Therefore, for the convenience of description, the first two approaches are called crew rostering with given cycle.
Early studies on staff rostering assumed that each worker can only perform one type of task. However, with the improved crewmember capability and staff training, problems related to multiskilled staff scheduling have attracted attention. According to the difference of license types, the multilicense crew rostering problem may have the following different cases. (a) All crewmembers have only one license type, and these license types have no inheritance and substitutability. In working out the crew rostering plan with this characteristic, all crew routes will be divided into groups according to their license types and work out crew rostering plan. (b) Contrary to the first situation, all crewmembers have received full training and thus can undertake crew routes with any license type. At this time, the constraint of license type does not influence the feasibility of the plan, and all crew routes can be placed in one set with no differences when working out the crew rostering plan. (c) Each crewmember possesses part of all licenses types, and some of them have the inheritance and substitutability with other licenses. That is, crewmembers with higher license types can accomplish crew routes that need the lower one. When working out crew rostering plan with this characteristic, the different combinations of the crew routes with different license types will significantly affect the result of crew rostering plan. Corominas et al. [13] addressed a problem of assigning different task types to completely multiskilled workers in a retail chain selling clothes. Avramidis [14] addressed a multiskill staffing problem in a call center and developed a twostage heuristic that finds good solutions to the founded mathematical programs.
From a modeling point of view, crew rostering problem is usually formulated as a set partitioning problem and its transformation. Various types of crew rostering plan have different objective functions. Buhr [15] treated this problem as a zeroone integer programming problem with a defined objective function and a specific set of constraints. Beaumont [16] used mixed integer programming to design employee rosters in the rostering plan, whereas Ryan [17] and Kohl and Karisch [1] modeled the crew rostering problem as a generalized set partitioning problem. From a solution point of view, the algorithm for solving the crew rostering problem can be generally divided into three categories, namely, accurate solution algorithm, heuristic algorithm, and modern optimization algorithm. The accurate solution algorithm can find an optimal solution because the scale of the problem is small. However, finding an optimal solution with this method is hard to be accepted for its long solution time when the numbers of variables and constraints are very large. Thus, the heuristic algorithm [18, 19] and modern optimization algorithm [20–23] are designed to solve this problem more accurately and more quickly.
The remainder of this paper is organized as follows. A detailed statement of the problem is described in Section 2. A mathematical model of the crew rostering problem based on the analysis of the optimization targets and constraints of our problem is established in Section 3. In Section 4, two algorithms are designed to decide a reasonable cycle scheme and compile the crew rostering plan under a given cycle. Finally, a numerical example with generated data is presented in Section 5.
2. Problem Statement
For describing the crew rostering problem in our research, the descriptions of some concepts are given below. Crew route is a train line (or a sequence of train lines) for a crewmember to accomplish during a day’s work, which is obtained by the combination of the working segments. Crew roster is a long term plan for the operation and management of crewmembers, which arranges the work of crewmembers in a fixed cycle scheme according to the related regulations of highspeed railway lines. Rota is a sequence that consists of several crew routes, which are finished by a group of crewmembers in a circulation with the satisfaction of working time and resting time. A rota usually contains the following information: number, working time, and income of all crew routes. License type is the requirement of the skills of crewmembers when accomplishing a specific crew route. Different license types represent different skills of crewmembers. The higher the level of license required by a crew route, the higher the revenue per unit time of the crewmember.
In China, the train’s running time on highspeed railway lines ranges from 6:00 to 24:00, which indicates that the working time of crewmembers is also in this range. Therefore, crewmembers can accomplish two crew routes in two adjacent days with the satisfaction of resting time standard. Then, the crew rostering plan with a given cycle scheme has its natural advantage of arranging the crewmembers’ daily work.
The relationships are built directly between crew routes and crewmembers in a personalized crew rostering plan. This method can minimize the number of crewmembers used. However, the scale of the problem is too large to design an effective algorithm for finding an optimal solution. The grouped crew rostering plan can largely reduce the scale of the problem. It can also help implement the plan and manage the crewmembers. However, the cycle scheme of grouped rostering must be designed as reasonable as possible to avoid the undesirable increase in the number of crewmembers. The grouped rostering problem is studied in this paper based on the determination of the optimal cycle scheme to generate and organize the crew rostering plan more easily.
On highspeed railway lines, the Automatic Train Operation (ATO) system can replace the drivers in some running sections under the supervision of the Train Automatic Protection system. The application of ATO not only realizes the efficient and energysaving operation of the train but also reduces the intensity of the drivers, allowing drivers to work on different trains. Under this circumstance, this paper proposes a crew scheduling problem of motor train set drivers with multilicense.
Based on the above analysis, this paper studies the crew rostering problem of motor train set drivers with the following characteristics: (a) the reasonable cycle scheme can be determinedand (b) all crewmembers are fully trained with the same driver licenses and (c) used as groups in the plan.
Tian and Niu [24] studied the crew rostering problem with a given cycle. However, a slightly complicated twostep optimization approach is adopted to avoid the inactivity of some crewmembers because the cycle scheme is given in advance without considering the real data. In this research, we first determine the reasonable cycle scheme of the crew rostering plan (scilicet, the value of the planning horizon and the work days in the plan), which not only helps to reduce the number of crewmembers used but also ensures that the working time of the crewmembers satisfies the monthly standard. Then, the establishment of the crew rostering plan is carried out with the given cycle scheme. The works in the rota are accomplished by a group of crewmembers. Thus, the objective of the crew rostering plan is to find a partition of all crew routes. This partition ensures that the crew routes in each group can form a feasible rota by appropriate connections and that the working time and income are balanced with other rotas.
3. Optimization Model
3.1. Optimization Model
The number and the operation cost of staff have always been the main objectives for the staff scheduling and rostering problem. For the crew rostering problem on highspeed rail lines, the operation cost is composed of two parts: the cost for hiring the crewmembers and the cost for finishing the tasks. The fees paid to the crewmembers by the company for accomplishing the crew routes are proportional to the working time and the license type, which are constant and independent of the number of crewmembers. However, the cost for hiring the crewmembers is relevant to the number of crewmembers. The tasks in crew routes are usually different from each other, and their corresponding working times are also different. The fairness of the crew rostering plan will definitely be affected if we constantly assign crew routes with long working times to some crewmembers. Furthermore, our study of crew rostering problem on highspeed railway lines has the background that all crewmembers have different licenses. The income of the crewmember per unit time is different because the license needed for finishing a crew route may be different, resulting in the divergence of the total income. In summary, the fairness and reasonableness of the plan can be improved by maintaining the balance of the working time and the income between all crewmembers. Thus, the objectives considered when establishing the optimization model of our problem are as follows.(a)To minimize the number of crewmembers used in the plan: in our research, all crew routes are divided into several rotas, which need the same number of crewmembers. Therefore, the number of rotas will be minimized if the number of crewmembers is minimized.(b)To minimize the differences in working time of all rotas: the working time balance of the crew rostering plan is equal to the working time balance among all rotas because the crewmembers’ work in one rota is the same.(c)To minimize the differences in income of all rotas: the difference in license types is reflected by the income of the rotas because the assignment of crew routes to the fully trained crewmembers is not affected by the license type.
In working out the crew rostering plan, the following regulations and constraints should be satisfied.(a)A crew route should belong to one and only one rota.(b)For each rota, the number of tasks (crew route) contained in one day should not be more than one.(c)For each rota, the crew routes should not be more than the working days specified by the plan.(d)For each rota, the connection time between each two adjacent tasks must satisfy the connection standard set by the company.
According to the objectives and constraints analyzed above, the optimization model established in this paper is as follows: where is the total number of rotas in the crew rostering plan; is the total number of crew routes; is the planning horizon of the crew rostering plan; and is the working day of the plan; is a 01 decision variable equal to 1 if the th crew route in rota is crew route , and 0 otherwise; , , and represent the starting, ending, and working times of crew route , respectively; is the income per unit time corresponding to the level of the license needed by crew route ; is a large positive number to ensure the establishment of formula (5); and is the time standard that should be satisfied by each connection between two crew routes.
3.2. Model Analysis
3.2.1. Analysis of the Objective Functions
The established 01 integer programming model in our research consists of three objective functions. is the number of rotas that directly determines the number of crewmembers used in the crew rostering plan, while and are the objectives representing the fairness and reasonableness of the crew rostering plan, respectively. For a particular crew route, the income of a crewmember is proportional to its working time. For all crew routes, the crew route with long working time is not necessarily the one with high income, or vice versa, because of the difference in license type. Therefore, the optimal solutions of the objective functions and in the above model are hard to be achieved simultaneously. Objective function (working time equalization) can ensure that all the crewmembers have similar intensity of work at the planning horizon and good working status. Conversely, each crewmember hopes that her income is not below the average standard while her licenses and working time are the same as the others. Thus, the design of objective function helps maintain the stability of the crewmembers’ emotion. However, the resting time and the working status of crewmembers are still favorable even without the consideration of . Therefore, the organization of the crew rostering plan is not likely to be affected by . The above analysis indicates that the order of the importance of these objective functions in our model is shown as follows:
According to the approach for designing fitness function in Niu [25, 26], the model with multiobjectives in our research is transformed into a single objective optimization model according to the relationship between these objectives to evaluate the quality of the constructed solution. Objective function represents the number of rotas, which must be an integer. A new objective function can be designed instead of the original three objective functions by transforming and into a value between (0, 1): and are the maximum values of the latter two objective functions theoretically. and () are their weights in the new objective function . The value of should be greater than 0.5 because is more important than : where and are the longest and shortest working times of all crew routes, respectively, and and are the highest and lowest incomes of all crew routes.
3.2.2. Analysis of the Solving Algorithm
When only the working time of the crew routes is considered, the crew rostering problem described in our research is similar to a classical partitioning problem in complexity theory, regardless of the income and the connecting relationships between the crew routes. The partitioning problem is to find a partition of a set by satisfying the constraints , , and ( is the weight of and is the elements contained in subset ) to minimize the maximum weight of each subset.
When the constraint of is relaxed, the elements in each subset will be or. This problem is called cardinalityconstrained problem, which is NPhard [27].
The partitioning problem is commonly used in scheduling theory to minimize the maximum working time when assigning jobs that are independent of each other and no priority order to multiple processing systems [28]. An approximation algorithm used to solve this problem is the largest processing time (LPT) algorithm proposed by Graham. This algorithm initially sorts the tasks in descending order by their processing time and then assigns an unhandled task with the longest processing time to an idle processor. For a scheduling problem with processors, the performance ratio of LPT compared with the optimal algorithm is [29]. The partitioning problem is a special case of the cardinalityconstrained problem. The applicability of LPT to the cardinalityconstrained problem is proven by studies carried out by the followup scholars, and the worst performance ratio remains ( [30]. Although many scholars have studied the cardinalityconstrained problem, a unified and efficient algorithm for solving it has not yet been developed.
In this paper, the working time and income of crewmembers, as well as the connections between crew routes, are considered simultaneously in the optimization model, making this problem more complex than the cardinalityconstrained problem. Therefore, finding an optimal solution by directly solving the 01 integer programming model is difficult. The planner hopes that a feasible crew rostering plan can be obtained in a short time and that an optimal plan can be achieved by adjusting the feasible plan according to his/her working experience and other conditions. Therefore, a method that can rapidly generate a feasible plan is valuable.
4. Algorithms
The optimization objectives of our study are to minimize the number of crewmembers used and maintain the balance of working times and incomes among all crewmembers. A reasonable cycle scheme should be given before the establishment of crew rostering plan because the cycle schemes significantly affect the first objective. The method for deciding the cycle scheme and the method for working out the crew rostering plan under a given cycle scheme are represented as follows.
4.1. Calculating the Optimal Cycle Scheme
The monthly working time of the crewmembers is the foundation for deciding the cycle scheme, which means a reasonable proportion of working time and resting time in the cycle scheme is needed for crewmembers to finish the monthly working time. Meanwhile, the crewmembers were grouped in our research. Hence, the number of crewmembers is equal to the product of the number of rotas and the planning horizon of the plan. The crew routes in each rota should be as high as possible, which requires good proportions between the number of crew routes and the working days in the plan, to reduce the number of crewmembers used. Therefore, the optimal cycle scheme should be determined according to the number of crew routes, the average working time of crew routes, and the monthly working time standard.
By studying the relationship between the above factors, the method for deciding the optimal cycle scheme is designed as follows.
4.1.1. Preliminary Selection for the Reasonable Cycle Scheme
With the assumption that the number of crew routes is , the average working time is (min), the monthly working time standard is (h), and the number of days in a month is . Then, the reasonable cycle scheme should satisfy where the values of and are unknown. However, is a part of ; thus, the relationship between them can be represented as , given by
Under the standard of China railway, the value of monthly working time is set to h and the day in a month to d. Then, formula (11) can be converted as follows:
Considering that and represent the number of days, the values of and are integers and their proportion close to is a reasonable cycle scheme. Alternatively, we can let (or ) be an integer and then calculate the value of (or ) by formula (12). When the calculated result is close to an integer, this cycle scheme is also a reasonable cycle scheme. A set of reasonable cycle schemes of the crew rostering plan can be drawn from this method, and then further selection will be executed among these cycle schemes.
4.1.2. Further Selection for the Optimal Cycle Scheme
With the assumption that the planning horizon of cycle scheme is and the number of working days is , the number of crewmembers used in this crew rostering plan is calculated as follows:
The cycle scheme with the minimal crewmembers is the optimal one in all reasonable cycle schemes because the number of crewmembers used in the plan is the most important objective. Formula (13) assumes that a crew route can connect to any other route in a short time, resulting in an ideal one. A next day’s connection may exist between two crew routes because the connection time does not satisfy the regulations (which means adding 1440 min to their original connection time). This situation means that an empty crew route is added between two adjacent crew routes. When this situation occurs, the time in the plan cannot be used sufficiently and the optimal cycle scheme determined by formula (13) is improper. To fully consider the influence caused by the next day’s connections, formula (13) is rewritten as
4.2. Improved Ant Colony Algorithm
The method for solving the crew rostering problem in our research is then designed based on the adjustment of the ant colony algorithm with bipheromone and biheuristic information designed in the study by Tian and Niu [24]. The algorithm in this paper only differs in the design of heuristic information and evaluation function; thus, only these two parts will be described below. For the other parts of the ant colony algorithm, interested readers can learn the related contents in the studies by Dorigo and Gambardella [31] and Tian and Niu [24].
4.2.1. Calculation of Heuristic Information
When constructing a rota, the calculation method of the selection probability is different according to the location of the ant. When the construction of a rota is finished, the ant returns to the virtual node, and then the first crew route for next rota is chosen by the pheromone and heuristic information of all crew route nodes. Otherwise, the next crew route is chosen by the pheromone and heuristic information of the connecting arcs if the constructing process is still searching for a crew route for current rota.
The heuristic information of crew route nodes is calculated by its starting time and ending time:
The heuristic information of the connecting arcs between the crew routes should guide the ants finding a crew rostering plan that not only uses lower crewmembers but also keeps the balance of the working time and the income among all rotas. Therefore, the calculation of the heuristic information on arcs should contain the following parameters: (a) the connection time between crew routes, (b) the working time of the crew routes to be selected, and (c) the income of the crew routes to be selected.
When the connection time between two crew routes satisfies the regulations, the value of the time is as short as possible. Thus, the connection time is considered by its reciprocal in heuristic information. For the working time and income, we hope that the selection of the next crew route helps keep their balance in a final solution. Let and represent the working time and income of current crew route sequence, respectively, and is the number of days in current sequence. and are the average working time and average income, respectively. The expected working time and income are and , respectively. The expected working time and income after the connection of next crew route are and , respectively. Therefore, the expected working time and income of next crew route to be selected are represented by the following formulas:
When constructing the rota, a crew route is more likely to be selected if its working time and income are close to and . Therefore, the heuristic information for selecting next crew route from current crew route is represented as where the last two parts denote the proportion of the working time and income of the crew routes to be selected and is a nonzero positive number that ensures that the value of is meaningful when or .
4.2.2. Evaluation Function
The integrated optimization objective (8) is used as the criteria for evaluating the quality of the solution constructed by the ants. According to the weight and range of all objectives, the value of function (8) consists of two parts, in which the integer part represents the number of rotas in the crew rostering plan, whereas the decimal part indicates the equilibrium of the working time and income of the rotas.
5. Numerical Example
To verify the reasonableness of the model and the effectiveness of the algorithm, this paper generates 43 crew routes shown in Table 1 to work out the crew rostering plan. The earliest starting time of crew routes is 6:04, whereas the latest finishing time is 22:56; when represented by minute, they are 364 and 1376, respectively. The working time of a crew route is the time span between its starting time and ending time. In our study, three license types have incomes of 0.55, 0.65, and 0.75 yuan per minute. The weights of the equilibrium of working time and income are set as 0.6 and 0.4.

According to the given data, the average working time of our 43 crew routes is 427 min. Thus, the proportion of and is
To use the crewmembers more flexibly, the planning horizon of long period is not considered in our research. To determine the optimal value of and , we let be an integer and then calculate the value of . When belongs to , the values of calculated by are shown in Table 2, in which the bold figures mean that the values of are close to integer.

Furthermore, when taking the number of crew routes and the number of probable next day’s connection into account, the best cycle schemes are shown in Table 3.

We can conclude from Table 3 that the optimal cycle scheme varies with the number of the next day’s connection in the crew rostering plan, which causes the number of the crewmembers used in the plan to vary. The number of next day’s connection is unpredictable; thus, we choose the index of the cycle scheme by the order of 4129 while varies from 0 to 7, as shown in Table 3 with asterisks. If a crew rostering plan using 56 crewmembers can be obtained under the 4th (or 8th) value of and , we believe that the plan is already the best one. Otherwise, the next cycle scheme will be selected to work out the crew rostering plan again.
After adopting the fourth and eighth cycle schemes in Table 3, the optimal crew rostering plan shown in Tables 4 and 5 is obtained by the improved ant colony algorithm designed in 4.2. The parameters of the improved ant colony algorithm are set to , , and ; the number of ants is 30; and the iteration time is 100. The algorithm is programmed by Visual C# on a personal computer with 2.93G CPU and 1 G memory. The average operation times for the two different cycle schemes are 1.34 and 1.27 s.
 
Crewmembers used: 56, evaluation function: 4.0615, average working time: 4588.75 min, and average income: 6000.4 yuan. 
 
Crewmembers used: 56, evaluation function: 2.0035, average working time: 9177.5 min, and average income: 12000.8 yuan. 
Tables 4 and 5 show that the number of rotas is 4 when and and 2 when and . The numbers of crewmembers used in two plans are all 56, which reaches the lowest bound. The result shows that the two cycle schemes are optimal and helpful to reduce the number of crewmembers. The values of evaluation function of the two cycle schemes are shown in the tables.
6. Conclusions
With the development of China highspeed railway lines, new changes have occurred in the organization of operation plans. As an important part of CPP, the research of crew rostering problem is crucial for optimizing the use of crewmembers. In this paper, the multilicense crew rostering problem is studied by adopting the grouped rostering approach, which is helpful to the operation and management of the crewmembers. The optimization model aimed at minimizing the number of crewmembers used and keeping the balance of the working time and income of all crewmembers has been established. In our research, we found that the cycle scheme is the main factor that influences the number of crewmembers used in the plan. Then, the calculation method of the optimal cycle scheme is studied with the consideration of the number of crew routes, the average working time of crew routes, and the monthly working time standard of crewmembers. After the cycle scheme is selected, an ant colony algorithm with bipheromone and biheuristic information is designed to work out the crew rostering plan. In the solving process, the algorithm can dynamically calculate the expected working time and income for choosing the next crew route according to the accumulative working time and income of the partial solution of the constructed rota. In this way, the algorithm can select a reasonable crew route that meets the objective function of the optimization model. The designed numerical example showed that the designed algorithm can select an optimal cycle scheme, and the crew rostering plan weaved with this cycle scheme also met the optimization goals of the problem.
Conflict of Interests
The author declares that there is no conflict of interests regarding the publication of this paper.
Acknowledgment
This research work was supported by the National Natural Science Foundation of China (no. 71261014).
References
 N. Kohl and S. E. Karisch, “Airline crew rostering: problem types, modeling, and optimization,” Annals of Operations Research, vol. 127, no. 1–4, pp. 223–257, 2004. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 A. M. Cohn and C. Barnhart, “Improving crew scheduling by incorporating key maintenance routing decisions,” Operations Research, vol. 51, no. 3, pp. 387–396, 2003. View at: Google Scholar  Zentralblatt MATH  MathSciNet
 S. Jütte and U. W. Thonemann, “Divideandprice: a decomposition algorithm for solving large railway crew scheduling problems,” European Journal of Operational Research, vol. 219, no. 2, pp. 214–223, 2012. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 C. Barnhart, L. Hatay, and E. L. Johnson, “Deadhead selection for the longhaul crew pairing problem,” Operations Research, vol. 43, no. 3, pp. 491–495, 1995. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 G. W. Graves, R. D. McBride, I. Gershkoff, D. Anderson, and D. Mahidhara, “Flight crew scheduling,” Management Science, vol. 39, no. 6, pp. 736–745, 1993. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 A. T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier, “Staff scheduling and rostering: a review of applications, methods and models,” European Journal of Operational Research, vol. 153, no. 1, pp. 3–27, 2004. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 T. EmdenWeinert, H. Kotas, and U. Speer, “DISSYA Driver Scheduling System for Public Transport. Version 1.0,” 2001, http://wenku.baidu.com/view/4e960e0d76c66137ee06196d.html. View at: Google Scholar
 M. Gamache, F. Soumis, G. Marquis, and J. Desrosiers, “Column generation approach for largescale aircrew rostering problems,” Operations Research, vol. 47, no. 2, pp. 247–262, 1999. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 S. C. K. Chu, “Generating, scheduling and rostering of shift crewduties: applications at the Hong Kong International Airport,” European Journal of Operational Research, vol. 177, no. 3, pp. 1764–1778, 2007. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 J. Desrosiers, A. Lasry, D. McInnis, M. M. Solomon, and F. Soumis, “Air transat uses ALTITUDE to manage its aircraft routing, crew pairing, and work assignment,” Interfaces, vol. 30, no. 2, pp. 41–53, 2000. View at: Google Scholar
 B. Maenhout and M. Vanhoucke, “A hybrid scatter search heuristic for personalized crew rostering in the airline industry,” European Journal of Operational Research, vol. 206, no. 1, pp. 155–167, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 F.Y. Chu, Z.Q. Tian, and S.Q. Ni, “Model and algorithm for formulation of the single cycle crew rostering plans of highspeed railway,” Journal of the China Railway Society, vol. 34, no. 7, pp. 1–9, 2012. View at: Google Scholar
 A. Corominas, R. Pastor, and E. Rodríguez, “Rotational allocation of tasks to multifunctional workers in a service industry,” International Journal of Production Economics, vol. 103, no. 1, pp. 3–9, 2006. View at: Publisher Site  Google Scholar
 A. N. Avramidis, W. Chan, and P. L'Ecuyer, “Staffing multiskill call centers via search methods and a performance approximation,” IIE Transactions, vol. 41, no. 6, pp. 483–497, 2009. View at: Publisher Site  Google Scholar
 J. Buhr, “Four methods for monthly crew assignmenta comparison of efficiency,” in Proceedings of the AGIFORS Symposium, vol. 18, pp. 403–430, 1978. View at: Google Scholar
 N. Beaumont, “Using mixed integer programming to design employee rosters,” The Journal of the Operational Research Society, vol. 48, no. 6, pp. 585–590, 1997. View at: Google Scholar  Zentralblatt MATH
 D. M. Ryan, “The solution of massive generalized set partitioning problems in air crew rostering,” The Journal of the Operational Research Society, vol. 43, pp. 459–467, 1992. View at: Google Scholar
 D. Teodorović and P. Lučić, “A fuzzy set theory approach to the aircrew rostering problem,” Fuzzy Sets and Systems, vol. 95, no. 3, pp. 261–271, 1998. View at: Publisher Site  Google Scholar
 P. Lučić and D. Teodorović, “Simulated annealing for the multiobjective aircrew rostering problem,” Transportation Research A, vol. 33, pp. 19–45, 1999. View at: Google Scholar
 H. Dawid, J. König, and C. Strauss, “An enhanced rostering model for airline crews,” Computers and Operations Research, vol. 28, no. 7, pp. 671–688, 2001. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 A. Ernst, M. Krishnamoorthy, and D. Dowling, “Train crew rostering using simulated annealing,” in Proceedings of the International Conference on Optimization: Techniques and Applications (ICOTA '98), Perth, Australia, 1998. View at: Publisher Site  Google Scholar
 B. Santosa, A. Sunarto, and A. Rahman, “Using differential evolution method to solve crew rostering problem,” Applied Mathematics, vol. 1, no. 4, pp. 316–325, 2010. View at: Publisher Site  Google Scholar
 A. Monfroglio, “Hybrid genetic algorithms for a rostering problem,” Software Practices Expert, vol. 26, no. 7, pp. 851–862, 1996. View at: Google Scholar
 Z. Tian and H. Niu, “Modeling and algorithms of the crew rostering problem with given cycle on highspeed railway lines,” Mathematical Problems in Engineering, vol. 2012, Article ID 214607, 15 pages, 2012. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 H. Niu and M. Zhang, “An optimization to schedule train operations with phaseregular framework for intercity rail lines,” Discrete Dynamics in Nature and Society, vol. 2012, Article ID 549374, 13 pages, 2012. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 H. Niu and X. Zhou, “Optimizing urban rail timetable under timedependent demand and oversaturated conditions,” Transportation Research C, vol. 36, pp. 212–230, 2013. View at: Publisher Site  Google Scholar
 M. Dell'Amico and S. Martello, “Bounds for the cardinality constrained P∥C_{max} problem,” Journal of Scheduling, vol. 4, no. 3, pp. 123–138, 2001. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 K. R. Baker, Introduction to Sequencing and Scheduling, John Wiley & Sons, New York, NY, USA, 1974.
 R. L. Graham, “Bounds on multiprocessing timing anomalies,” SIAM Journal on Applied Mathematics, vol. 17, no. 2, pp. 416–429, 1969. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 H. Kellerer and G. Woeginger, “A tight bound for 3partitioning,” Discrete Applied Mathematics, vol. 45, no. 3, pp. 249–259, 1993. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 M. Dorigo and L. M. Gambardella, “Ant colonies for the travelling salesman problem,” BioSystems, vol. 43, no. 2, pp. 73–81, 1997. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2014 Zhiqiang Tian. 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.