首页> 外文会议>Annual Applied Science and Engineering Conference >Analysis of Artificial Bee Colony algorithm for optimizing lecture schedule based on willingness of teaching submission
【24h】

Analysis of Artificial Bee Colony algorithm for optimizing lecture schedule based on willingness of teaching submission

机译:基于教学意愿意愿优化讲座时间表的人工蜂殖民算法分析

获取原文
获取外文期刊封面目录资料

摘要

Scheduling is one of important activity,especially in universities.Many activities of lecturers make a lecturers submit a willingness of teaching schedule.This allows greater opportunities for conflicting schedules.In this research,we use Artificial Bee Colony(ABC)algorithm for optimizing lecture schedule based on willingness of teaching schedule submission.With ABC algorithm is expected to reduce conflicting schedules and optimize the schedule according to the willingness of lecturer to teach.In this paper explain the analysis and pattern(encoded)of ABC algorithm that have ready to be implemented.The result of analysis shows that ABC can be applied for optimizing schedule.Then,we describe about several scenarios of experiment which can be used for testing the performance or accuracy of ABC algorithm for optimizing schedule based on willingness teaching submission
机译:调度是重要的活动之一,特别是大学。讲师的Many活动使讲师提交教学时间表的意愿。这使得更多的机会适应冲突的时间表。在这项研究中,我们使用人工蜂殖民地(ABC)算法来优化讲座时间表基于教学计划提交的意愿。预计ABC算法将减少冲突的时间表并根据讲师的意愿优化时间表。本文解释了已准备实施的ABC算法的分析和模式(编码) 。分析结果表明,ABC可以应用于优化时间表。该方案,我们描述了几种实验场景,可用于测试ABC算法的性能或准确性,以根据意愿教学提交优化时间表

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号