A NNIA Scheme for Timetabling Problems

This paper presents a memetic multiobjective optimization algorithm based on NNIA for examination timetabling problems. In this paper, the examination timetabling problem is considered as a two-objective optimization problem while it is modeled as a single-objective optimization problem generally. Within the NNIA framework, the special crossover operator is utilized to search in the solution space; two local search techniques are employed to optimize these two objectives and a diversity-keeping strategy which consists of an elitism group operator and an extension optimization operator to ensure a sufficient number of solutions in the pareto front. The proposed algorithm was tested on the most widely used uncapacitated Carter benchmarks. Experimental results prove that the proposed algorithm is a competitive algorithm.