Abstract
The curriculum-based course timetabling problem is a subset of the university course timetabling problem which is often regarded as both an NP-hard and NP-complete problem. The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution. The curriculum-based course timetabling problem confronts the problem of a multi-dimensional search space and matrices of high conflict-density, thus impeding the task to search for an improved solution. In this paper, the authors propose an arbitrary heuristic room matching algorithm which attempts to improve the initial seed of the curriculum-based course timetabling problem. The objective is to provide a reasonably advantageous search point to perform any subsequent improvement phase and the results obtained indicate that the proposed matching algorithm is able to provide very promising results as the fitness score of the solution is significantly enhanced within a short period of time.
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
Similar content being viewed by others
References
Abdullah, S., Turabieh, H.: On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems. Inf. Sci. 191, 146–168 (2012)
Agustín-Blas, L.E., Salcedo-Sanz, S., Ortiz-García, E.G., Portilla-Figueras, A., Pérez-Bellido, Á.M.: A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups. Expert Syst. Appl. 36, 7234–7241 (2009)
Alvarez-Valdes, R., Crespo, E., Tamarit, J.M.: Design and implementation of a course scheduling system using Tabu search. Eur. J. Oper. Res. 137, 512–523 (2002)
Aycan, E., Ayav, T.: Solving the course scheduling problem using simulated annealing. In: 2009 IEEE International Advance Computing Conference (IACC), pp. 6–7 (2009)
Bardadym, V.A.: Practice and theory of automated timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 22–25. Springer, Heidelberg (1996)
Brownlee, J.: Clever Algorithms. Nature-Inspired Programming Recipes, Lulu Enterprises, pp. 401–402 (2011)
Burke, E.K., Elliman, D.G., Weare, R.F.: A hybrid genetic algorithm for highly constrained timetabling problems. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 605–610 (1995)
Caldeira, J.P., Rosa, A.C.: School timetabling using genetic search. In: Proceedings of the 2nd International Conference on the Practice and Theory of Automated Timetabling, Toronto, pp. 115–122 (1997)
Chiarandini, M., Birattari, M., Socha, K., Rossi-Doria, O.: An effective hybrid algorithm for university course timetabling. J. Sched. 9(5), 403–432 (2006)
Frausto-Solís, J., Alonso-Pecina, F., Mora-Vargas, J.: An efficient simulated annealing algorithm for feasible solutions of course timetabling. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 675–685. Springer, Heidelberg (2008)
Gaspero, L., Di Mccollum, B., Schaerf, A.: The Second International Timetabling Competition (ITC-2007): Curriculum-Based Course Timetabling (Track 3), pp. 1–12 (2007)
Ismayilova, N.A., Sağir, M., Gasimov, R.N.: A multiobjective faculty–course–time slot assignment problem with preferences. Math. Comput. Model. 46(7–8), 1017–1029 (2007)
Jain, A., Jain, S., Chande, P.K.: Formulation of genetic algorithm to generate good quality course timetable 1(3), 248–251 (2010)
Kohshori, M., Abadeh, M.: Hybrid genetic algorithms for university course timetabling. Int. J. Comput. Sci. 9(2), 446–455 (2012)
Lü, Z., Hao, J.K.: Adaptive Tabu search for course timetabling. Eur. J. Oper. Res. 200(1), 235–244 (2010)
Lutuksin, T., Pongcharoen, P.: Best-worst ant colony system parameter investigation by using experimental design and analysis for course timetabling problem. In: 2010 Second International Conference on Computer and Network Technology, pp. 467–471 (2010)
Qarouni-Fard, D., Najafi-Ardabili, A., Moeinzadeh, M.-H.: Finding feasible timetables with particle swarm optimization. In: 4th International Conference on Innovations in Information Technology, IIT 2007, pp. 387–391 (2007)
Rizam, M., Bakar, A.: Selecting quality initial random seed for metaheuristic approaches : a case of timetabling problem. Int. J. Comput. Internet Manage. 16(1), 38–45 (2008)
Rossi-Doria, O., et al.: A comparison of the performance of different metaheuristics on the timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 329–351. Springer, Heidelberg (2003)
Shiau, D.F.: A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences. Expert Syst. Appl. 38(1), 235–248 (2011)
Suyanto, S.: An informed genetic algorithm for university course and student timetabling problems. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2010, Part II. LNCS, vol. 6114, pp. 229–236. Springer, Heidelberg (2010)
Tassopoulos, I.X., Beligiannis, G.N.: Solving effectively the school timetabling problem using particle swarm optimization. Expert Syst. Appl. 39(5), 6029–6040 (2012)
Thepphakorn, T., Hicks, C., Pongcharoen, P.: An ant colony based timetabling tool. Int. J. Prod. Econ. 149, 131–144 (2009)
Zhang, D., Liu, Y., M’Hallah, R., Leung, S.C.H.H.: A Simulated Annealing with a new neighborhood structure based algorithm for high school timetabling problems. Eur. J. Oper. Res. 203(3), 550–558 (2010)
Acknowledgement
The authors would like to express their gratitude to Universiti Teknologi Malaysia and Ministry of Higher Education (MOHE) Malaysia for the myBrain scholarship and the FRGS Grant, number R.J130000.7828.4F497. In addition, the authors would also like to thank the Research Management Center (RMC) – UTM for supporting this research project.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Keat, T.C., Haron, H., Wibowo, A., Salihin Ngadiman, M. (2015). An Arbitrary Heuristic Room Matching Algorithm in Obtaining an Enhanced Initial Seed for the University Course Timetabling Problem. In: Fujita, H., Guizzi, G. (eds) Intelligent Software Methodologies, Tools and Techniques. SoMeT 2015. Communications in Computer and Information Science, vol 532. Springer, Cham. https://doi.org/10.1007/978-3-319-22689-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-22689-7_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22688-0
Online ISBN: 978-3-319-22689-7
eBook Packages: Computer ScienceComputer Science (R0)