一种优化考试排班的调节算法

C. Klüver, J. Klüver
{"title":"一种优化考试排班的调节算法","authors":"C. Klüver, J. Klüver","doi":"10.1109/SSCI.2016.7850284","DOIUrl":null,"url":null,"abstract":"We describe the regulatory algorithm (RGA), a two dimensional extension of standard evolutionary algorithms. Its possibilities are shown by an application to the problem of optimizing timetabling for exams with real data from the University Duisburg-Essen (Germany). The results of the RGA application show that the room allocation problem for written exams can be satisfactory solved in a few minutes. In addition we compared the RGA with a standard GA. The RGA was significantly better in all experiments; in particular the GA could not fulfill all distribution demands in contrast to the RGA.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A regulatory algorithm (RGA) for optimizing examination timetabling\",\"authors\":\"C. Klüver, J. Klüver\",\"doi\":\"10.1109/SSCI.2016.7850284\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe the regulatory algorithm (RGA), a two dimensional extension of standard evolutionary algorithms. Its possibilities are shown by an application to the problem of optimizing timetabling for exams with real data from the University Duisburg-Essen (Germany). The results of the RGA application show that the room allocation problem for written exams can be satisfactory solved in a few minutes. In addition we compared the RGA with a standard GA. The RGA was significantly better in all experiments; in particular the GA could not fulfill all distribution demands in contrast to the RGA.\",\"PeriodicalId\":120288,\"journal\":{\"name\":\"2016 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSCI.2016.7850284\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI.2016.7850284","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们描述了调节算法(RGA),它是标准进化算法的二维扩展。它的可能性通过一个应用程序来优化考试时间表的问题,来自杜伊斯堡-埃森大学(德国)的真实数据。应用RGA的结果表明,在几分钟内就能很好地解决笔试考场的分配问题。此外,我们还将RGA与标准遗传算法进行了比较。RGA在所有实验中均显著优于RGA;特别是与RGA相比,遗传算法不能满足所有的分布需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A regulatory algorithm (RGA) for optimizing examination timetabling
We describe the regulatory algorithm (RGA), a two dimensional extension of standard evolutionary algorithms. Its possibilities are shown by an application to the problem of optimizing timetabling for exams with real data from the University Duisburg-Essen (Germany). The results of the RGA application show that the room allocation problem for written exams can be satisfactory solved in a few minutes. In addition we compared the RGA with a standard GA. The RGA was significantly better in all experiments; in particular the GA could not fulfill all distribution demands in contrast to the RGA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolutionary dynamic optimisation of airport security lane schedules Variable Neighbourhood Search: A case study for a highly-constrained workforce scheduling problem Local modes-based free-shape data partitioning A dynamic truck dispatching problem in marine container terminal Spaceplane trajectory optimisation with evolutionary-based initialisation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1