Abstract
Since the University Course Timetabling Problem (UCTP) is a typical sort of combinatorial issues, many conventional methods turn out to be unavailable when confronted with this complex problem where lots of constraints need to be satisfied especially with the class-flow between floors added. Considering the supreme density of students between classes, this paper proposes a novel algorithm integrating Simulated Annealing (SA) into the Genetic Algorithm (GA) for solving the UCTP with respect to the class-flow where SA is incorporated into the competition and selection strategy of GA and concerning the class-flow caused by the assigned timetable, a modified fitness function is presented that determines the survival of generations. Moreover, via the exchange of lecturing classrooms the timetable with minimum class-flow is eventually derived with the values of defined fitness function. Finally, in terms of the definitions above, a simulation of virtual situation is implemented and the experimental results indicate that the proposed model of classroom arrangement in the paper maintains a high efficiency.
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
Ghaemi, S., Vakili, M.T., Aghagolzadeh, A.: Using genetic algorithm Optimizer to Solve University Timetable Scheduling Problem. In: Proc. of the 2007 IEEE (2007)
Jat, S.N., Yang, S.: A Memetic Algorthm for the University Course Timetabling Problem. In: Proc. of the 2008 IEEE International Conference on Tools with Artificial Intelligence (2008)
Abramson, D., Abela, J.: A Parallel Genetic Algorithm Solving the School Timetabling Problem. Appeared in 15 Australian Computer Science Conference, Hobart, February 1992, pp. 1–11 (1992)
Abdullah, S., Turabieh, H.: Generating University Course Timetable Using Genetic Algorithm and Local Search. In: Proc. of the 2008 IEEE International Conference on Convergence and Hybrid Information Technology (2008)
Weare, R., Burke, E., Elliman, D.: A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems. Computer Science Technical Report No. NOTTCS-TR-1995-8
Rahoual, M., Saad, R.: Solving Timetabling Problem by Hybridizing Genetic Algorithm and Tabu Search. In: PATAT 2006, pp. 467–472 (2006) ISBN 80-210-3726-1
Blöchliger, I.: Modeling Staff Scheduling Problems. European Journal of Operational Research 158, 533–542 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yue, Z., Li, S., Xiao, L. (2009). Solving University Course Timetabling Problems by a Novel Genetic Algorithm Based on Flow. In: Liu, W., Luo, X., Wang, F.L., Lei, J. (eds) Web Information Systems and Mining. WISM 2009. Lecture Notes in Computer Science, vol 5854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05250-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-05250-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05249-1
Online ISBN: 978-3-642-05250-7
eBook Packages: Computer ScienceComputer Science (R0)