A New Hybrid GA-Bees Algorithm for a Real-world University Timetabling Problem
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.