Paper
22 November 2022 Research on university course timetabling problem based on divide and conquer
Li-Hui Zhang
Author Affiliations +
Proceedings Volume 12475, Second International Conference on Advanced Algorithms and Signal Image Processing (AASIP 2022); 124751B (2022) https://doi.org/10.1117/12.2659714
Event: Second International Conference on Advanced Algorithms and Signal Image Processing (AASIP 2022), 2022, Hulun Buir, China
Abstract
With the rapid expansion of the scale of the university, the demand for faculty, classrooms and courses has greatly increased, and the university course timetable plan has increased geometrically. This leads to the problem of combinatorial explosion in the course schedule. In this paper, a divide and conquer based course timetabling algorithm is proposed. By reducing the space vector of course arrangement, the number of course arrangement combination schemes can be effectively reduced, and the optimal solution can be found in a huge space, and effectively suppress the combinatorial explosion. Practice shows that the algorithm can adapt to the needs of dynamic large-scale class scheduling.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Li-Hui Zhang "Research on university course timetabling problem based on divide and conquer", Proc. SPIE 12475, Second International Conference on Advanced Algorithms and Signal Image Processing (AASIP 2022), 124751B (22 November 2022); https://doi.org/10.1117/12.2659714
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Mathematical modeling

Algorithm development

Information technology

Back to Top