{"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}
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.