By Topic

The bees algorithm for a practical university timetabling problem in Vietnam

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nguyen Tan Tran Minh Khang ; Fac. of Inf., Univ. of Sci., Ho Chi Minh City, Vietnam ; Nguyen Ba Phuc ; Tran Thi Hue Nuong

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.

Published in:

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

Date of Conference:

10-12 June 2011