1[1]Garey M R,Johnson D S.Compute and Intractability: A Guide to the theory of NP completeness [M].San francisco:W.H, Freeman Co.,1979.
2[2]Chu P C,Beasley J E.A genetic algorithm for the generalized assignment problem [J].European Journal of Operational Research,1995.
3[3]Safaai D,Sigeru O.Incorporating constraint propagation in genetic algorithm for university timetable planning [J].Engineering Applications of Artificial Intelligence,1999, 241～253.
4[4]Luan F,Yao X.Solving real-world lecture room assignment problems by genetic algorithms,Complexity International [J].An Electronic Journal of Complex System Research,1996(3).
5[5]Colorni A,Dorigo marco,Maniezzo V.Metaheuristics for high school timetabling [J]Computational Optimization and Applications,1998,(9):275～298.
6Cheng R W，Proc 16th Int Conf Computer Industrial Enginering，1994年，7卷，568页
3Mitchell M. An introduction to genetic algorithms [M]. Cambridge:MIT Press, 1996.
4Limyungcharoen S, Annakkage U D. Effects of unified power flow controllers on transient stability [ Z ].[S. l. ] :IEEE Proccdings online 2001:182 - 188.
5Zhang J, Chung H S H. Clustering - Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms [ J]. IEEE Transactions on Evolutionary Computation, 2006,1 (3) : 326 - 335.
6Himerding R, Michalewicz Z, Eiben A. Adaptation in evolutionary computation: a survey [ C ]//Proceedings of IEEE International Conference on Evolutionary Computation. Piscataway: [ s. n. ], 1997 : 65 - 69.
