By Topic

Using genetic algorithms to solve the South African school timetabling problem

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

2 Author(s)
Raghavjee, R. ; Sch. of Inf. Syst., Univ. of KwaZulu-Natal, Pietermaritzburg, South Africa ; Pillay, N.

The study presented in this paper applies a genetic algorithm to solve the school timetabling problem for a South African primary school and high school. The overall algorithm makes use of domain knowledge in the form of low-level heuristics to guide the search. The genetic algorithm employed to solve the problems uses tournament selection and mutation operators for the purposes of parent selection and recreation respectively. The algorithm has produced a better quality timetable for the high school problem than that generated by a previous genetic algorithm used to solve this problem. Furthermore, the genetic algorithm has induced a timetable for the primary school that is of better quality than the timetable produced by the system currently used by the school.

Published in:

Nature and Biologically Inspired Computing (NaBIC), 2010 Second World Congress on

Date of Conference:

15-17 Dec. 2010