Solving an Uncapacitated Exam Timetabling Problem Instance using a Hybrid NSGA-II

Nuno Leite, Rui Neves, Nuno Horta, Fernando Melício, Agostinho Rosa

2012

Abstract

This paper describes the construction of an university examination timetable using a hybrid multi-objective evolutionary algorithm. The problem instance that is considered is the timetable of the Electrical, Telecommunications and Computer Department at the Lisbon Polytechnic Institute, which comprises three bachelor degree programs and two master degree programs, having about 80 courses offered and 1200 students enrolled. The task of manually construct the exam timetable for this instance is a complex one due essentially to the high number of combined degree courses. This manual process takes, considering a two-person team, about one week long. A hybrid multi-objective evolutionary algorithm, based on the Non-dominated Sorting Genetic Algorithm-II (NSGA-II), is proposed for solving this problem instance, incorporating two distinct objectives: one concerning the minimization of the number of occurrences of students having to take exams in consecutive days, and a second one concerning the minimization of the timetable length. The computational results show that the automatic algorithm achieves better results compared to the manual solution, and in negligible time.

References

  1. Burke, E., Bykov, Y., and Petrovic, S. (2001). A multicriteria approach to examination timetabling. In Burke, E. and Erben, W., editors, Practice and Theory of Automated Timetabling III, volume 2079 of Lecture Notes in Computer Science, pages 118-131. Springer Berlin / Heidelberg.
  2. Burke, E. and Landa Silva, J. (2005). The design of memetic algorithms for scheduling and timetabling problems. In Hart, W., Smith, J., and Krasnogor, N., editors, Recent Advances in Memetic Algorithms, volume 166 of Studies in Fuzziness and Soft Computing, pages 289-311. Springer Berlin / Heidelberg.
  3. Burke, E. K., Newall, J. P., and Weare, R. F. (1996). A memetic algorithm for university exam timetabling. In (Eds.), E. K. B. . P. R., editor, Lecture notes in computer science: Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995, volume 1153, pages 241- 250, Edinburgh, Scotland. Berlin: Springer.
  4. Cheong, C., Tan, K., and Veeravalli, B. (2009). A multi-objective evolutionary algorithm for examination timetabling. Journal of Scheduling, 12:121-146.
  5. Coˆté, P., Wong, T., and Sabourin, R. (2004). Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. In eds): Proceedings of the 5th International Conference on Practice and Theory of Automated Timetabling (PATAT 2004), pages 151-167.
  6. Deb, K. D. (2001). Multi-objective optimization using evolutionary algorithms. Chichester: Wiley.
  7. Deb, K. D., Pratap, A., Agarwal, S., and Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm : NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182-197.
  8. Ehrgott, M. and Gandibleux, X. (2008). Hybrid metaheuristics for multi-objective combinatorial optimization. In Blum, C., Aguilera, M., Roli, A., and Sampels, M., editors, Hybrid Metaheuristics, volume 114 of Studies in Computational Intelligence, pages 221- 259. Springer Berlin / Heidelberg.
  9. Moscato, P. and Norman, M. G. (1992). A ”memetic” approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems. In Proceedings of the International Conference on Parallel Computing and Transputer Applications, pages 177- 186. IOS Press.
  10. Mumford, C. (2010). A multiobjective framework for heavily constrained examination timetabling problems. Annals of Operations Research, 180:3-31.
  11. Petrovic, S. and Bykov, Y. (2003). A multiobjective optimisation technique for exam timetabling based on trajectories. In Burke, E. and Causmaecker, P., editors, Practice and Theory of Automated Timetabling IV, volume 2740 of Lecture Notes in Computer Science, pages 181-194. Springer Berlin Heidelberg.
  12. Qu, R., Burke, E. K., McCollum, B., Merlot, L. T. G., and Lee, S. Y. (2009). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12:55-89.
  13. Raidl, G. R. (2006). A unified view on hybrid metaheuristics. In Hybrid Metaheuristics, pages 1-12.
  14. Wong, T., Coˆté, P., and Sabourin, R. (2004). A hybrid MOEA for the capacitated exam proximity problem. In Congress on Evolutionary Computation, 2004. CEC2004., volume 2, pages 1495 - 1501 Vol.2.
Download


Paper Citation


in Harvard Style

Leite N., Neves R., Horta N., Melício F. and Rosa A. (2012). Solving an Uncapacitated Exam Timetabling Problem Instance using a Hybrid NSGA-II . In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 106-115. DOI: 10.5220/0004166001060115


in Bibtex Style

@conference{ecta12,
author={Nuno Leite and Rui Neves and Nuno Horta and Fernando Melício and Agostinho Rosa},
title={Solving an Uncapacitated Exam Timetabling Problem Instance using a Hybrid NSGA-II},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)},
year={2012},
pages={106-115},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004166001060115},
isbn={978-989-8565-33-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)
TI - Solving an Uncapacitated Exam Timetabling Problem Instance using a Hybrid NSGA-II
SN - 978-989-8565-33-4
AU - Leite N.
AU - Neves R.
AU - Horta N.
AU - Melício F.
AU - Rosa A.
PY - 2012
SP - 106
EP - 115
DO - 10.5220/0004166001060115