论文信息 - GraGA: a graph based genetic algorithm for airline crew scheduling

GraGA: a graph based genetic algorithm for airline crew scheduling

Crew scheduling is an NP-hard constrained combinatorial optimization problem, which is very important for the airline industry. We propose a genetic algorithm, GraGA, to solve this problem. A new graph based representation utilizes memory effectively, and provides a framework in which we can easily develop various genetic operators.

Chilukuri K. Mohan | Hasan Timucin Ozdemir | C. Mohan | H. Ozdemir

[1] Paul C. H. Chu,et al. A genetic algorithm approach for combinatorial optimisation problems , 1997 .

[2] J. Beasley,et al. A genetic algorithm for the set covering problem , 1996 .

[3] Eric Gelman,et al. Recent Advances in Crew-Pairing Optimization at American Airlines , 1991 .

[4] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[5] David Levine,et al. Application of a hybrid genetic algorithm to airline crew scheduling , 1996, Comput. Oper. Res..

[6] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.

[7] David M. Levine,et al. A Genetic Algorithm for the Set Partitioning Problem , 1993, International Conference on Genetic Algorithms.

[8] SchoolImperial CollegeLondon. A Genetic Algorithm for the Set Partitioning Problem , 1995 .

[9] Thomas Bäck,et al. A Comparative Study of a Penalty Function, a Repair Heuristic and Stochastic Operators with the Set-Covering Problem , 1995, Artificial Evolution.