通过使用仅突变的遗传算法来平衡学术课程

Kadri Sylejmani, Arbnor Halili, Arbnor Rexhepi
{"title":"通过使用仅突变的遗传算法来平衡学术课程","authors":"Kadri Sylejmani, Arbnor Halili, Arbnor Rexhepi","doi":"10.23919/MIPRO.2017.7973604","DOIUrl":null,"url":null,"abstract":"In universities, the academic programs are organized in a number of periods, usually in six or ten semesters, for a bachelor or a master degree, respectively. It usually happens that a given semester is much loaded with courses than the others. This makes it hard for the students to comprehend and deal with a high volume of learning material per certain semesters. This problem is difficult, because some courses have prerequisites (e.g. Math2 should be taught after Math1), and this means that course correlation mast be taken into account. Therefore, in this paper, we present an intelligent method that is based on genetic algorithms to optimize the academic curricula of a given program, by trying to dispatch the courses over the available semesters, so that the load of individual semesters, in terms of course credits, is balanced as much as possible. The proposed genetic algorithm explores the search space by means of two mutation operators, which swap or shift courses between the semesters. The algorithm performance is fine-tuned and evaluated by using three state of art instances from the literature. The results show that the proposed algorithm is comparable with the state of the art solutions for the problem at hand.","PeriodicalId":203046,"journal":{"name":"2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Balancing academic curricula by using a mutation-only genetic algorithm\",\"authors\":\"Kadri Sylejmani, Arbnor Halili, Arbnor Rexhepi\",\"doi\":\"10.23919/MIPRO.2017.7973604\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In universities, the academic programs are organized in a number of periods, usually in six or ten semesters, for a bachelor or a master degree, respectively. It usually happens that a given semester is much loaded with courses than the others. This makes it hard for the students to comprehend and deal with a high volume of learning material per certain semesters. This problem is difficult, because some courses have prerequisites (e.g. Math2 should be taught after Math1), and this means that course correlation mast be taken into account. Therefore, in this paper, we present an intelligent method that is based on genetic algorithms to optimize the academic curricula of a given program, by trying to dispatch the courses over the available semesters, so that the load of individual semesters, in terms of course credits, is balanced as much as possible. The proposed genetic algorithm explores the search space by means of two mutation operators, which swap or shift courses between the semesters. The algorithm performance is fine-tuned and evaluated by using three state of art instances from the literature. The results show that the proposed algorithm is comparable with the state of the art solutions for the problem at hand.\",\"PeriodicalId\":203046,\"journal\":{\"name\":\"2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/MIPRO.2017.7973604\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/MIPRO.2017.7973604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在大学里,学术课程分为几个阶段,通常是六个或十个学期,分别为学士学位或硕士学位。通常情况下,一个学期的课程比其他学期要多。这使得学生很难理解和处理每学期大量的学习材料。这个问题很困难,因为有些课程有先决条件(例如Math2应该在Math1之后教授),这意味着必须考虑课程相关性。因此,在本文中,我们提出了一种基于遗传算法的智能方法,通过尝试在可用的学期中分配课程来优化给定项目的学术课程,以便在课程学分方面尽可能平衡各个学期的负荷。提出的遗传算法通过两个突变算子在学期之间交换或转移课程来探索搜索空间。算法性能被微调,并通过使用三个最先进的实例从文献中评估。结果表明,所提出的算法可与当前问题的最先进解决方案相媲美。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Balancing academic curricula by using a mutation-only genetic algorithm
In universities, the academic programs are organized in a number of periods, usually in six or ten semesters, for a bachelor or a master degree, respectively. It usually happens that a given semester is much loaded with courses than the others. This makes it hard for the students to comprehend and deal with a high volume of learning material per certain semesters. This problem is difficult, because some courses have prerequisites (e.g. Math2 should be taught after Math1), and this means that course correlation mast be taken into account. Therefore, in this paper, we present an intelligent method that is based on genetic algorithms to optimize the academic curricula of a given program, by trying to dispatch the courses over the available semesters, so that the load of individual semesters, in terms of course credits, is balanced as much as possible. The proposed genetic algorithm explores the search space by means of two mutation operators, which swap or shift courses between the semesters. The algorithm performance is fine-tuned and evaluated by using three state of art instances from the literature. The results show that the proposed algorithm is comparable with the state of the art solutions for the problem at hand.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信