A Diversity Keeping Strategy for the Multi-objective Examination Timetabling Problem

This paper presents a diversity keeping strategy 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, 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 un-capacitated Carter benchmarks. Experimental results prove that the proposed algorithm is a competitive algorithm.