The bees algorithm for a practical university timetabling problem in Vietnam

University timetabling problem refers to the assignment of a set of courses to appropriate periods and rooms within a working week subject to a variety of hard and soft constraints. In this paper, the Bees algorithm is applied to solve a highly constrained real-world university timetabling problem i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 IEEE International Conference on Computer Science and Automation Engineering Ročník 4; s. 42 - 47
Hlavní autoři: Nguyen Tan Tran Minh Khang, Nguyen Ba Phuc, Tran Thi Hue Nuong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2011
Témata:
Artificial intelligence
Availability
Bismuth
Buildings
course timetabling
curriculum-based course timetabling
Educational institutions
exploitation
exploration
metaheuristic
Optimization
Search problems
the bees algorithm
university school timetabling
ISBN:9781424487271, 1424487277
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:University timetabling problem refers to the assignment of a set of courses to appropriate periods and rooms within a working week subject to a variety of hard and soft constraints. In this paper, the Bees algorithm is applied to solve a highly constrained real-world university timetabling problem in Vietnam. The algorithm is tested on nine real-world instances. Results obtained from the proposed algorithm are superior to the handmade timetables currently used in practice.
ISBN:9781424487271
1424487277
DOI:10.1109/CSAE.2011.5952800