期刊文献+

求解多校区排课问题的基因对交叉遗传算法 被引量:8

Genetic algorithm of genetic-couple cross for curriculum scheduling in multi-campus
在线阅读 下载PDF
导出
摘要 国内很多高校或中学都建设了新校区,形成了多校区同时运行的格局。为了更好地解决多校区排课时的冲突问题,通过改进编码、交叉、变异算子,改进适应度函数设计,使遗传算法更好地适用于多校区的排课环境。提出的算法采用了二维资源片十进制编码方式,既方便初始种群产生和检测冲突,又减小时间复杂度。通过采用基于基因对交叉和资源变异算子,保证了每次的交叉、变异都有实际意义,以减小交叉、变异后产生硬性冲突的概率,提高进化效率,缩短进化时间。以某高校为例,使用C#和Mat-lab7.0等工具,通过编码、初始种群的生成、适应度函数设计与计算和遗传进化,实现了对多校区排课系统进行优化。实验结果表明,改进后的遗传算法提高了在排课应用中的可行性,更能适用于多校区排课。 Many colleges or high schools have built new campuses,and they may run at the same time.In order to resolve con-flicts of the multi-campus course-arranging,the encoding,crossover,mutation operators and fitness function design should be improved.It is necessary to apply the genetic algorithm into the multi-campus class-scheduling environment.This paper uses decimal encoding method based on two-dimensional resource-piece.It not only conveniently initializes population and tests the conflict,but reduces the complexity of time.The using of gene-based crossover and mutation of resources ensures that the each cross and variation has practical meaning.It can reduce the probability of hard conflict after cross and variation,and improve the efficiency of evolution.Taking a certain college for example,the C # and Matlab7.0 tools will be used.The multi-campus class-scheduling system can be optimized through the coding,generation of initial population,designing of fitness function and genetic evolution.The result indicates that the reformed genetic algorithms can improve feasibility in the class-scheduling application and be more ap-plicable to the multi-campus course arrangement.
出处 《计算机工程与应用》 CSCD 北大核心 2010年第18期240-243,共4页 Computer Engineering and Applications
基金 江西省教育科学"十五"规划重点项目No.04ZD085 江西省教育厅科技计划项目No.2006-161~~
关键词 遗传算法 基因对交叉 排课 多校区 genetic algorithm genes exchange timetable multi-campus
  • 相关文献

参考文献4

  • 1滕姿,邓辉文,杨久俊.基于遗传算法的排课系统的设计与实现[J].计算机应用,2007,27(B12):199-201. 被引量:27
  • 2Glibovets N N,Medvid S A.Genetic algorithms used to solve scheduling problems[J].Cybernetics and Systems Analysis,2003,39( 1 ) :81-90.
  • 3Perzina R.Solving the university timetabling problem with optimized enrollment of students by a self-adaptive genetic algorithm[J].Practice and Theory of Automated Timetabling VI,2007,3867:248-263.
  • 4李建喜,舒远仲,陈文生.多校区排课遗传算法设计[J].南昌航空工业学院学报,2006,20(2):61-64. 被引量:6

二级参考文献20

  • 1朱冠宇,王乘,席大春.利用遗传算法求解中学课表安排问题[J].计算机工程与应用,2004,40(27):215-218. 被引量:9
  • 2刘弘,李向阳,孙天磷.用人工智能原理实现大学课程表编排的探索[J].山东师范大学学报(自然科学版),1995,10(4):377-380. 被引量:4
  • 3肖俊.遗传算法的工程应用[J].计算机科学,2005,32(11):247-248. 被引量:11
  • 4江齐,兰竞.遗传算法在排课问题中的运用[J].重庆大学学报(自然科学版),2005,28(11):58-61. 被引量:11
  • 5Marco P.Carrasco.A Multiobjective Genetic Algorithm for the Class/Teacher Timetabling Problem[J].Lecture Notes in Computer Science,2001,2079:3~17
  • 6Alicia Grech and Julie Main.A Case-Based Reasoning Approach to Formulating University Timetables Using Genetic Algorithms[J].Lecture Notes in Computer Science,2005,3681:76-83
  • 7GAREY M R, JOHNSON D S. Compute and Intractability: A guide to the theory of NP completeness [ M]. Sanfrancisco: W. H. Freeman & Co Ltd, 1979.
  • 8CHU P C, BEASLEY J E. A genetic algorithm for the generalized assignment problem[ J]. European Journal of Operational Research, 1997, 24(1): 17-23.
  • 9SAFAAI D, SIGERU O. Incorporating constraint propagation in genetic algorithm for university timetable planning[ J]. Engineering Applications of Artificial Intelligence, 1999, 12(3) : 241 -253.
  • 10LUAN 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).

共引文献31

同被引文献30

引证文献8

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部