Multiobjective genetic algorithm to solve the train crew scheduling problem

This paper presents a multiobjective genetic algorithm (MOGA)to solve the train crew pairing problem in railway companies. The proposed MOGA has several features, such as 1) A permutation-based model is proposed rather than the 0-1 set partition model. 2) Instead of pre-assigning a fixed group number of crewmembers, the proposed method can determine it by performing the evolutionary process. 3) The crossover and mutation operators are enhanced so that the duty time and the duty period can be integrated and considered during the evolutionary process. Experiments show that the proposed MOGA can find out optimal solution with exact group number of crewmembers instead of pre-assigning it so that the effective and efficient crew pairing can be yielded.

[1]  Jean-François Cordeau,et al.  A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem , 2003, Comput. Oper. Res..

[2]  Jacques Desrosiers,et al.  Crew Pairing at Air France , 1993 .

[3]  Christos Goumopoulos,et al.  Efficient trip generation with a rule modeling system for crew scheduling problems , 2004, J. Syst. Softw..

[4]  Thomas Emden-Weinert,et al.  Best Practice Simulated Annealing for the Airline Crew Scheduling Problem , 1999, J. Heuristics.

[5]  Srini Ramaswamy,et al.  Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching , 2001, Comput. Optim. Appl..

[6]  Ellis L. Johnson,et al.  Airline Crew Scheduling: State-of-the-Art , 2005, Ann. Oper. Res..

[7]  Cynthia Barnhart,et al.  An Approximate Model and Solution Approach for the Long-Haul Crew Pairing Problem , 1998, Transp. Sci..

[8]  Gerhard Reinelt,et al.  BoxStep methods for crew pairing problems , 2006 .

[9]  Michel Minoux,et al.  Modeling and solving a Crew Assignment Problem in air transportation , 2006, Eur. J. Oper. Res..

[10]  Jean-François Cordeau,et al.  Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..

[11]  Cynthia Barnhart,et al.  Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions , 2003 .

[12]  Leena Suhl,et al.  A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases , 2006, Eur. J. Oper. Res..

[13]  Shangyao Yan,et al.  Airline cockpit crew scheduling , 2002, Eur. J. Oper. Res..

[14]  Gang Yu,et al.  OPERATIONS RESEARCH IN THE AIRLINE INDUSTRY. , 1998 .

[15]  Kwang Ryel Ryu,et al.  Solving a Large-Scaled Crew Pairing Problem by Using a Genetic Algorithm , 2006, IEA/AIE.

[16]  Ellis L. Johnson,et al.  Solving Large Scale Crew Scheduling Problems , 1997 .

[17]  Shangyao Yan,et al.  A network model for airline cabin crew scheduling , 2002, Eur. J. Oper. Res..

[18]  Broderick Crawford,et al.  A Constructive Hybrid Algorithm for Crew Pairing Optimization , 2006, AIMSA.

[19]  J. P. Arabeyre,et al.  The Airline Crew Scheduling Problem: A Survey , 1969 .

[20]  Kwang Ryel Ryu,et al.  Crew pairing optimization by a genetic algorithm with unexpressed genes , 2006, J. Intell. Manuf..

[21]  Cynthia Barnhart,et al.  Deadhead Selection for the Long-Haul Crew Pairing Problem , 1995, Oper. Res..

[22]  Jing Hu,et al.  Computational results with a primal-dual subproblem simplex method , 1999, Oper. Res. Lett..

[23]  S. Yan,et al.  Optimal construction of airline individual crew pairings , 2002, Comput. Oper. Res..

[24]  M. Minoux,et al.  A new approach for crew pairing problems by column generation with an application to air transportation , 1988 .

[25]  Jacques Desrosiers,et al.  The Operational Airline Crew Scheduling Problem , 1997, Transp. Sci..