Khang Nguyen, Tung Pham, Nga Le, Nguyen Dang, Nuong Tran
{"title":"现实世界中学课程表问题的模拟退火算法","authors":"Khang Nguyen, Tung Pham, Nga Le, Nguyen Dang, Nuong Tran","doi":"10.1109/KSE.2010.31","DOIUrl":null,"url":null,"abstract":"Educational timetabling is known to be hard combinatorial optimization problem. In this paper, a Simulated Annealing - based algorithm with an intensification strategy is applied to a real world high school timetabling problem. The obtained results are better than the Tabu Search algorithm's results published before and the handmade timetables created by experts.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Simulated Annealing-Based Algorithm for a Real-World High School Timetabling Problem\",\"authors\":\"Khang Nguyen, Tung Pham, Nga Le, Nguyen Dang, Nuong Tran\",\"doi\":\"10.1109/KSE.2010.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Educational timetabling is known to be hard combinatorial optimization problem. In this paper, a Simulated Annealing - based algorithm with an intensification strategy is applied to a real world high school timetabling problem. The obtained results are better than the Tabu Search algorithm's results published before and the handmade timetables created by experts.\",\"PeriodicalId\":158823,\"journal\":{\"name\":\"2010 Second International Conference on Knowledge and Systems Engineering\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Knowledge and Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KSE.2010.31\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Knowledge and Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE.2010.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simulated Annealing-Based Algorithm for a Real-World High School Timetabling Problem
Educational timetabling is known to be hard combinatorial optimization problem. In this paper, a Simulated Annealing - based algorithm with an intensification strategy is applied to a real world high school timetabling problem. The obtained results are better than the Tabu Search algorithm's results published before and the handmade timetables created by experts.