用禁忌搜索算法自动求解现实世界大学排课问题

Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies Pub Date : 2010-11-11 DOI:10.1109/RIVF.2010.5632720

Khang Nguyen, Dang Nguyen, Khon Trieu, Nuong Tran

{"title":"用禁忌搜索算法自动求解现实世界大学排课问题","authors":"Khang Nguyen, Dang Nguyen, Khon Trieu, Nuong Tran","doi":"10.1109/RIVF.2010.5632720","DOIUrl":null,"url":null,"abstract":"University timetabling problem is hard combinatorial optimization problem that has been considered by several metaheuristics researchers. This paper applies Tabu Search algorithm, which is one of the most popular metaheuristics that have efficiently solved many hard combinatorial problem like timetabling, to a real-world university timetabling problem in Vietnam. The algorithm is tested on nine real-world instances and experimental results are generally better than handmade timetables being used in practice","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Automating a Real-World University Timetabling Problem with Tabu Search Algorithm\",\"authors\":\"Khang Nguyen, Dang Nguyen, Khon Trieu, Nuong Tran\",\"doi\":\"10.1109/RIVF.2010.5632720\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"University timetabling problem is hard combinatorial optimization problem that has been considered by several metaheuristics researchers. This paper applies Tabu Search algorithm, which is one of the most popular metaheuristics that have efficiently solved many hard combinatorial problem like timetabling, to a real-world university timetabling problem in Vietnam. The algorithm is tested on nine real-world instances and experimental results are generally better than handmade timetables being used in practice\",\"PeriodicalId\":171525,\"journal\":{\"name\":\"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF.2010.5632720\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2010.5632720","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

大学排课问题是一个难的组合优化问题，已被许多元启发式学者所研究。本文将禁忌搜索算法(Tabu Search algorithm)作为最流行的元启发式算法之一，有效地解决了排课等许多困难的组合问题，并应用于越南的一个现实世界的大学排课问题。该算法在9个实际实例上进行了测试，实验结果普遍优于实际使用的手工时间表

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Automating a Real-World University Timetabling Problem with Tabu Search Algorithm

University timetabling problem is hard combinatorial optimization problem that has been considered by several metaheuristics researchers. This paper applies Tabu Search algorithm, which is one of the most popular metaheuristics that have efficiently solved many hard combinatorial problem like timetabling, to a real-world university timetabling problem in Vietnam. The algorithm is tested on nine real-world instances and experimental results are generally better than handmade timetables being used in practice

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies

自引率

0.00%

发文量