The bees algorithm for a practical university timetabling problem in Vietnam

Author

Khang, Nguyen Tan Tran Minh ; Phuc, Nguyen Ba ; Nuong, Tran Thi Hue

Author_Institution

Fac. of Inf., Univ. of Sci., Ho Chi Minh City, Vietnam

Volume

4

fYear

2011

fDate

10-12 June 2011

Firstpage

42

Lastpage

47

Abstract

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.

Keywords

educational courses; educational institutions; Vietnam; bees algorithm; curriculum-based course timetabling; university timetabling problem; Artificial intelligence; Availability; Bismuth; Buildings; Educational institutions; Optimization; Search problems; course timetabling; curriculum-based course timetabling; exploitation; exploration; metaheuristic; the bees algorithm; university school timetabling;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-8727-1

Type

conf

DOI

10.1109/CSAE.2011.5952800

Filename

5952800