Generating University Course Timetable Using Genetic Algorithms and Local Search

Authors:
Salwani Abdullah;Hamza Turabieh
Affiliations:
-;-
Venue:
ICCIT '08 Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 01
Year:
2008

Citing 0
Cited 9

Electromagnetism-like Mechanism with Force Decay Rate Great Deluge for the Course Timetabling Problem

RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Solving University Course Timetabling Problems by a Novel Genetic Algorithm Based on Flow

WISM '09 Proceedings of the International Conference on Web Information Systems and Mining
A tabu-based memetic approach for examination timetabling problems

RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Fish swarm intelligent algorithm for the course timetabling problem

RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
A hybrid metaheuristic approach to the university course timetabling problem

Journal of Heuristics
On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems

Information Sciences: an International Journal
Dual sequence simulated annealing with round-robin approach for university course timetabling

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Population based Local Search for university course timetabling problems

Applied Intelligence
On the performance of Scatter Search for post-enrolment course timetabling problems

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we establish a new algorithm based on Genetic Algorithms (GA) and sequential local search to solve course timetabling problem. Universities are challenged to arise in number of complexity, their resources and events are becoming harder to schedule. Timetabling is a kind of problem in which events (classes, exams, courses, etc) have to be arranged into a number of timeslots such that conflicts in using a given set of resources are avoided. We perform preliminary experiments on standard benchmark course timetable problems and able to produce promising results.