Title: Design of GAmut-Lssahc: a solver for course timetabling problem

Authors: M. Nandhini, S. Kanmani

Addresses: Research and Development Centre, Bharathiar University, Coimbatore 46, Tamil Nadu, India. ' Department of Information Technology, Pondicherry Engineering College, Puducherry 14, India

Abstract: In this paper, the problem of course timetabling is studied extensively and its constraints are represented using mathematical representation. Analysing the existing GA-based methodologies for solving University Course Timetabling problem, a new method has been proposed probably, which has not yet been attempted for this problem. It employs GA with a variety of proposed MUTation operators (Random-Selection; Adaptive; Goal-Directed) and Local Search of Steepest Ascent Hill Climbing (GAmut-LSsahc) to increase the fitness value and could produce optimal course timetable at the earliest. It was experimentally proved that goal-directed converges 6% faster than adaptive and 10% faster than random-selection mutation.

Keywords: combinatorial problems; feasibility; genetic algorithms; GAs; mutation; optimisation; steepest ascent hill climbing; course timetabling; course timetables.

DOI: 10.1504/IJMOR.2011.043012

International Journal of Mathematics in Operational Research, 2011 Vol.3 No.6, pp.595 - 618

Published online: 12 Feb 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article