Table of Contents Author Guidelines Submit a Manuscript
Journal of Optimization
Volume 2017 (2017), Article ID 5723239, 11 pages
Research Article

A NNIA Scheme for Timetabling Problems

School of Electronics and Information, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, China

Correspondence should be addressed to Yu Lei

Received 29 December 2016; Revised 6 March 2017; Accepted 16 March 2017; Published 30 May 2017

Academic Editor: Linqiang Pan

Copyright © 2017 Yu Lei and Jiao Shi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.