Abstract
The timetabling problem is well known to be an NP-complete combinatorial problem. The problem becomes even more complex when addressed to individual timetables of students. The core of dealing with the problem in this application is a timetable builder based on mixed direct–indirect encoding evolved by a genetic algorithm with a self-adaptation paradigm, where the parameters of the genetic algorithm are optimized during the same evolution cycle as the problem itself. The aim of this paper is to present an encoding for self-adaptation of genetic algorithms that is suitable for timetabling problems. Compared to previous approaches we designed the encoding for self-adaptation of not only one parameter or several ones but for all possible parameters of genetic algorithms at the same time. The proposed self-adaptive genetic algorithm is then applied for solving the real university timetabling problem and compared with a standard genetic algorithm. The main advantage of this approach is that it makes it possible to solve a wide range of timetabling and scheduling problems without setting parameters for each kind of problem in advance. Unlike common timetabling problems, the algorithm was applied to the problem in which each student has an individual timetable, so we also present and discuss the algorithm for optimized enrollment of students that minimizes the number of clashing constraints for students.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdullah, S., Burke, E.K., McCollum, B.: An investigation of variable neighborhood search for university course timetabling. In: MISTA. Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, pp. 413–427 (July 2005)
Abramson, D.: Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science 37, 98–113 (1991)
Aickelin, B.E.K., Li, J.: Improved squeaky wheel optimisation for driver scheduling. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) Parallel Problem Solving from Nature - PPSN IX. LNCS, vol. 4193, pp. 182–191. Springer, Heidelberg (2006)
Bacardit, J., Krasnogor, N.: Smart crossover operator with multiple parents for a Pittsburgh learning classifier system. In: GECCO 2006. Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1441–1448. ACM Press, New York (2006)
Bäck, T.: Self-adaptation in genetic algorithms. In: Proceedings of the 1st European Conference on Artificial Life, MIT Press, Cambridge, MA (1992)
Beyrouthy, C., Burke, E.K., Landa-Silva, D., McCullom, B., McMullan, P., Parkes, A.J.: The teaching space allocation problem with splitting. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 232–252. Springer, Heidelberg (2007)
Bufé, M., Fischer, T., Gubbels, H., Häcker, C., Hasprich, O., Scheibel, C., Karsten Weicker, K., Weicker, N., Wenig, M., Wolfangel, C.: Automated solution of a highly constrained school timetabling problem – preliminary results. In: Proceedings of the Evo Workshops, Como, Italy, Springer, Berlin (2001)
Burke, E.K., Newall, J.: Enhancing timetable solutions with local search methods. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 195–206. Springer, Heidelberg (2003)
Brailsford, S.C., Potts, C.N., Smith, B.M.: Constraint satisfaction problems: algorithms and applications. European Journal of Operational Research 119, 557–581 (1999)
De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. Ph.D. Thesis, University of Michigan (1975)
Di Gaspero, L., Schaerf, A.: Tabu search techniques for examination timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 104–117. Springer, Heidelberg (2001)
Even, S., Iati, A., Shamir, A.: On the complexity of timetabling and multicommodity flow problems. SIAM Journal of Computation 5, 691–703 (1976)
Fernandes, C., Caldeira, J.P., Melicio, F., Rosa, A.: High school weekly timetabling by evolutionary algorithms. In: Proceedings of the 14th Annual ACM Symposium on Applied Computing, San Antonio, TX (1999)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA (1989)
Kendall, G., Mohd, H.N.: Tabu search hyper-heuristic approach to the examination timetabling problem at University Technology MARA. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 199–217. Springer, Heidelberg (2005)
Legierski, W.: Search strategy for constraint-based class–teacher timetabling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 247–261. Springer, Heidelberg (2003)
Marsili, S.L., Alba, P.A.: Adaptive mutation in genetic algorithms. Soft Computing 4, 76–80 (2000)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, New York (1996)
Paechter, B., Rankin, R.C., Cumming, A., Fogarty, T.C.: Timetabling the classes of an entire university with an evolutionary algorithm. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN V. LNCS, vol. 1498, pp. 865–874. Springer, Heidelberg (1998)
Perzina, R.: Self-adaptation in genetic algorithms. In: SCI 2003. Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics, IIIS, Orlando, FL, pp. 234–238 (2003)
Perzina, R.: A self-adapting genetic algorithm for solving the university timetabling problem. In: SCI 2004. Proceedings of the 8th World Multiconference on Systemics, Cybernetics and Informatics, IIIS, Orlando, FL, pp. 284–288 (2004)
Perzina, R., Ramík, J.: A new portfolio selection model solved by genetic algorithms. In: Proceedings of the 20th International Conference of MME, VŠB TU, Ostrava, pp. 201–207 (2002)
Ross, P., Hart, E., Corne, D.: Some observations about ga-based exam timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 115–129. Springer, Heidelberg (1998)
Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review 13, 87–127 (1999)
Stefano, C.D., Tettamanazi, A.G.B.: An evolutionary algorithm for solving the school timetabling problem. In: Proceedings of the Evo Workshops 2001, Como, Italy, pp. 452–462. Springer, Berlin (2001)
Terashima-Marin, H., Ross, P., Valenzuela-Rendon, M.: Evolution of constraint satisfaction strategies in examination timetabling. In: GECCO 1999. Proceedings of the Genetic and Evolutionary Computation Conference, pp. 635–642. Morgan Kaufmann, San Mateo, CA (1999)
Thompson, J.M., Dowsland, K.A.: A robust simulated annealing based examination timetabling system. In: Computers and Operations Research, vol. 25, pp. 637–648. Elsevier, Oxford (1998)
White, G.M., Chan, P.W.: Towards the construction of optimal examination timetables. INFOR 17, 219–229 (1979)
Yang, J.M., Kao, C.Y.: Integrating adaptive mutations and family competition into genetic algorithms as function optimizer. Soft Computing 4, 89–102 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perzina, R. (2007). Solving the University Timetabling Problem with Optimized Enrollment of Students by a Self-adaptive Genetic Algorithm. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-77345-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77344-3
Online ISBN: 978-3-540-77345-0
eBook Packages: Computer ScienceComputer Science (R0)