scholarly journals Solving a Real Constraint Satisfaction Model for the University Course Timetabling Problem: A Case Study

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Marco Antonio Cruz-Chávez ◽  
Mireya Flores-Pichardo ◽  
Alina Martínez-Oropeza ◽  
Pedro Moreno-Bernal ◽  
Martín H. Cruz-Rosales
Keyword(s):  
Constraint Satisfaction ◽  
Timetabling Problem ◽  
University Course Timetabling ◽  
Proposed Model ◽  
Course Timetabling Problem ◽  
University Course ◽  
The University ◽  
Classroom Use ◽  
Satisfaction Model

This paper proposes a real mathematical constraint satisfaction model which defines the timetabling problem in the Faculty of Chemical Sciences and Engineering (FCSE) at the Autonomous University of Morelos State, Mexico. A Constructive Approach Algorithm (CAA) is used to obtain solutions in the proposed model. A comparison is made between the CAA’s results and the schedule generated by the FCSE administration. Using the constraint satisfaction model, it is possible to improve the allocation of class hours in the FCSE so that classroom use is more efficient.

scholarly journals Solving University Course Timetabling Problem Using Multi-Depth Genetic Algorithm

2020 ◽  
Vol 77 ◽  
pp. 01001
Author(s):  
Alfian Akbar Gozali ◽  
Shigeru Fujimura
Keyword(s):  
Genetic Algorithm ◽  
Individual Student ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
Search Spaces ◽  
University Course Timetabling ◽  
Course Timetabling Problem ◽  
University Course ◽  
The University ◽  
Additional Constraints

The University Course Timetabling Problem (UCTP) is a scheduling problem of assigning teaching event in certain time and room by considering the constraints of university stakeholders such as students, lecturers, and departments. The constraints could be hard (encouraged to be satisfied) or soft (better to be fulfilled). This problem becomes complicated for universities which have an immense number of students and lecturers. Moreover, several universities are implementing student sectioning which is a problem of assigning students to classes of a subject while respecting individual student requests along with additional constraints. Such implementation enables students to choose a set of preference classes first then the system will create a timetable depend on their preferences. Subsequently, student sectioning significantly increases the problem complexity. As a result, the number of search spaces grows hugely multiplied by the expansion of students, other variables, and involvement of their constraints. However, current and generic solvers failed to meet scalability requirement for student sectioning UCTP. In this paper, we introduce the Multi-Depth Genetic Algorithm (MDGA) to solve student sectioning UCTP. MDGA uses the multiple stages of GA computation including multi-level mutation and multi-depth constraint consideration. Our research shows that MDGA could produce a feasible timetable for student sectioning problem and get better results than previous works and current UCTP solver. Furthermore, our experiment also shows that MDGA could compete with other UCTP solvers albeit not the best one for the ITC-2007 benchmark dataset.

scholarly journals Developing a Model for the University Course Timetabling Problem: A Case Study

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Mozhgan Mokhtari ◽  
Majid Vaziri Sarashk ◽  
Milad Asadpour ◽  
Nadia Saeidi ◽  
Omid Boyer
Keyword(s):  
Programming Model ◽  
Mixed Integer ◽  
University Course Timetabling ◽  
Proposed Model ◽  
Engineering Department ◽  
Academic Settings ◽  
Teachers And Students ◽  
Course Timetabling Problem ◽  
University Course ◽  
The University

Over recent years, timetable programming in academic settings has become particularly challenging due to such factors as the growing number of students, the variety of lectures, the inadequacy of educational facilities in some areas, and the incorporation of teachers and students’ preferences into the schedule. Many researchers, therefore, have been formulating the problem of timetabling lectures using different methods. In this research, a multiobjective mixed-integer programming model was developed to provide a timetable for the postgraduate courses at the Industrial Engineering Department of Islamic Azad University, Najafabad Branch (IAUN). The proposed model minimized the violation of the lecturers and educational priorities, the student travel time between classes, and the classes’ surplus capacity. To convert the multiobjective model into a single one, the ε-constraint method was adopted, and the model’s accuracy and feasibility were examined through a real example solved by the CPLEX solver of GAMS software. The results approved the efficiency of this model in preparing a timetable for university lectures.

Sign in / Sign up

Export Citation Format

Share Document