A New Hybrid GA-Bees Algorithm for a Real-world University Timetabling Problem

Author

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

Author_Institution

Fac. of Electron. & Inf., Cao Thang Tech. Coll., Ho Chi Minh City, Vietnam

fYear

2011

fDate

14-17 Dec. 2011

Firstpage

321

Lastpage

326

Abstract

University course timetabling problems are well-studies combinatorial optimization problems. In this paper, we present a new hybrid GA - Bees algorithm for solving a real-world university timetabling problem in Vietnam. This hybrid method approach is tested and compared with previous works. The result obtained confirm that our appoach is able to produce better high quality solutions to the university course timetabling problem.

Keywords

combinatorial mathematics; computational complexity; educational courses; educational institutions; genetic algorithms; NP-complete; Vietnam; combinatorial optimization problems; hybrid GA-bees algorithm; real-world university course timetabling problems; Biological cells; Bismuth; Buildings; Educational institutions; Genetic algorithms; Genetics; Optimization; course timetabling; curriculum-based course timetabling; exploitation; exploration; genetic algorithm; hybrid heuristics; metaheuristic; the bees algorithm; university school timetabling;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Computation and Bio-Medical Instrumentation (ICBMI), 2011 International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-1-4577-1152-7

Type

conf

DOI

10.1109/ICBMI.2011.33

Filename

6131772