Solving Timetabling Problem Using Genetic and Heuristic Algorithms

Authors:
Nguyen Duc Thanh
Affiliations:
Nong Lam University, Vietnam
Venue:
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
Year:
2007

Citing 0
Cited 1

Pipelining Memetic Algorithms, Constraint Satisfaction, and Local Search for Course Timetabling

MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a hybrid algorithm that combines genetic and heuristic approach. By using this method, solving timetabling problem is converted to finding the optimal arrangement of elements on a 2D matrix. This algorithm was implemented and tested with the synthetic and real data of Nong Lam University of HCM City, Vietnam. The experimental results reveal the usability and potential of the proposed algorithm in solving timetabling problems.