Call for Paper - August 2019 Edition
IJCA solicits original research papers for the August 2019 Edition. Last date of manuscript submission is July 20, 2019. Read More

Course Timetabling via Genetic Algorithms: A Real Case

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2015
Authors:
Ricardo T.A. De Oliveira, Filippo C´esar G. R´egis, Paulo Renato A. Firmino, Tiago A.E. Ferreira
10.5120/ijca2015907400

Ricardo De T A Oliveira, Filippo C´esar G R´egis, Paulo Renato A Firmino and Tiago A E Ferreira. Article: Course Timetabling via Genetic Algorithms: A Real Case. International Journal of Computer Applications 131(10):1-5, December 2015. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

@article{key:article,
	author = {Ricardo T.A. De Oliveira and Filippo C´esar G. R´egis and Paulo Renato A. Firmino and Tiago A.E. Ferreira},
	title = {Article: Course Timetabling via Genetic Algorithms: A Real Case},
	journal = {International Journal of Computer Applications},
	year = {2015},
	volume = {131},
	number = {10},
	pages = {1-5},
	month = {December},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}
}

Abstract

Courses timetabling has been one of the main problems for planning, maintaining and optimizing educational institutions. However, the intriguing mathematical problem which usually result from the attempt of promoting optimal courses timetabling has prevented a widely dedication of education managers to this area. The present paper aims to summarize the usefulness of approximate techniques (e:g: genetic algorithms) for dealing with courses timetabling. In particular, the successful application of the resulting algorithm in a Brazilian university center is highlighted.

References

  1. J. V. D. Broek, C. Hurkens, and G. Woeginger. Timetabling problems at the tu eindhoven. European Journal of Operational Research, 196(3):877–885, 2009.
  2. E.K. Burke, A.J. Eckersley, B. McCollum, S. Petrovic, and R. Qu. Hybrid variable neighbourhood approaches to university exam timetabling. European Journal of Operational Research, 206(1):46 – 53, 2010.
  3. David A. Coley. An introduction to genetic algorithms for scientists and engineers. World Scientific, 1999.
  4. Daniel Costa. A tabu search algorithm for computing an operational timetable. European Journal of Operational Research, 76(1):98 – 110, 1994.
  5. S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, 5(4):691 – 703, 1976.
  6. Tabitha James, Mark Vroblefski, and Quinton Nottingham. A hybrid grouping genetic algorithm for the registration area planning problem. Computer Communications, 30(10):2180 – 2190, 2007.
  7. Zhipeng L and Jin-Kao Hao. Adaptive tabu search for course timetabling. European Journal of Operational Research, 200(1):235 – 244, 2010.
  8. Nashat Mansour, Vatche Isahakian, and Iman Ghalayini. Scatter search technique for exam timetabling. Applied Intelligence, 34(2):299–310, 2011.
  9. Danial Qaurooni and Mohammad-R. Akbarzadeh-T. Course timetabling using evolutionary operators. Applied Soft Computing, 13(5):2504 – 2514, 2013.
  10. Rong Qu, Edmund K. Burke, and Barry McCollum. Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems. European Journal of Operational Research, 198(2):392 – 404, 2009.
  11. Colin R Reeves and Jonathan E Rowe. Genetic algorithmsprinciples and perspectives: a guide to GA theory, volume 20. Kluwer Academic Pub, 2002.
  12. Haroldo G. Santos, Luiz S. Ochi, and Marcone J.F. Souza. A tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem. J. Exp. Algorithmics, 10, December 2005.

Keywords

Timetabling, Genetic Algorithms, Scheduling Problem