...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Philippine Information Technology >Genetic Algorithm: An Implementation to Class Scheduler System
【24h】

Genetic Algorithm: An Implementation to Class Scheduler System

机译：遗传算法：类调度器系统的实现

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper discusses the applicability of Genetic Algorithm as a solution in developing an automated class scheduler system for Silliman University. Constraints like time conflicts, room conflicts, and professor information were organized, considered and solved in the study. Three types of iterations were done to investigate how much looping the algorithm would need to get the lowest amount of conflicts possible. For the 500 iterations, there was an average of 10.43 conflicts. These conflicts were the total of conflicts from the faculty and the room. For the 1000 iterations, an average of 9.28 conflicts, and the 1500 iterations resulted in an average of 12.78 conflicts. These findings suggest that the higher the iteration rate, the more conflict is acquired. The same occurrence has happened on an iteration that is too low. Thus, an iteration of 1000 is embedded since it has the lowest conflict rate among the three tests. The resulting schedules varied since the data was generated randomly. Also, there wasn’t an occurrence when both of the faculty and room did not have a conflict at the same time. This just proves that for a college with many courses to generate, a 100% conflict-free schedule may not be possible.
机译：本文讨论了遗传算法作为开发Silliman大学自动化班级调度系统的一种解决方案的适用性。在研究中组织，考虑和解决了诸如时间冲突，房间冲突和教授信息之类的约束。进行了三种类型的迭代，以研究该算法需要多少循环才能获得尽可能少的冲突。对于500次迭代，平均有10.43个冲突。这些冲突是来自教职员工和教室的全部冲突。对于1000次迭代，平均冲突为9.28，而1500次迭代的冲突平均为12.78。这些发现表明，迭代率越高，冲突越多。同样的情况发生在迭代次数太低的情况下。因此，嵌入了1000的迭代，因为它在三个测试中具有最低的冲突率。由于数据是随机生成的，因此生成的时间表有所不同。另外，教职员工和房间都没有同时发生冲突的情况也没有发生。这只是证明，对于一所拥有许多课程的大学而言，不可能实现100％无冲突的进度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号