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

Cruz-Chávez, Marco Antonio; Flores-Pichardo, Mireya; Martinez-Oropeza, Alina; Moreno-Bernal, Pedro; Cruz-Rosales, Martín H.

doi:10.1155/2016/7194864

Cited by 7 publications

(3 citation statements)

References 17 publications

(49 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The UCTP is a problem of combinatorial optimization of the NP-hard type [8]. In this problem a set of courses must be assigned to a set of classrooms during a period of time, considering a series of restrictions predefined by the institution.…”

Section: Introductionmentioning

confidence: 99%

A solution to the university course timetabling problem using a hybrid method based on genetic algorithms

Arias-Osorio

Mora-Esquivel

2020

DYNA

View full text Add to dashboard Cite

In this study, we address the current issues that usually manifest during the programming of university courses, classified as University Course Timetabling Problem, which is considered as a NP-hard problem due to the high computational demand that it requires.To solve the problem, a Mixed Integer Linear Programming model is proposed, which serves as a reference when dimensioning the problem and the restrictions that must be considered. Next, a hybrid metaheuristic method is designed based on the HGATS algorithm, Hybrid Genetic Algorithm Tabu Search Approach, developed by [16], which combines the diversification capacity of the Genetic Algorithm with the strategy of intensification of the Tabu Search Algorithm. Finally, the validation of the proposed algorithm is performed using the data from the programming of the classes from the academic periods 2018-1 and 2018-2 for the academic program of Industrial Engineering at the Industrial University of Santander, obtaining interesting solutions in a reasonable computational time, being that the process of organizing the schedule by the coordinator can last from hours to days, depending on your ability.

show abstract

Section: Introductionmentioning

confidence: 99%

A solution to the university course timetabling problem using a hybrid method based on genetic algorithms

Arias-Osorio

Mora-Esquivel

2020

DYNA

View full text Add to dashboard Cite

show abstract

“…In [33], a practical case of UCTP is presented. A constructive heuristic is proposed to find solutions for a real-life instance, for the Faculty of Chemical Sciences and Engineering of the Autonomous University of the Morelos state, in Mexico City.…”

mentioning

confidence: 99%

“…To generate this feasible solution, the Constructive Approach Algorithm is used. This is presented in [33]; this solution is passed to SA. 6.…”

mentioning

confidence: 99%

Metaheuristic with Cooperative Processes for the University Course Timetabling Problem

et al. 2022

Self Cite

View full text Add to dashboard Cite

This work presents a metaheuristic with distributed processing that finds solutions for an optimization model of the university course timetabling problem, where collective communication and point-to-point communication are applied, which are used to generate cooperation between processes. The metaheuristic performs the optimization process with simulated annealing within each solution that each process works. The highlight of this work is presented in the algorithmic design for optimizing the problem by applying cooperative processes. In each iteration of the proposed heuristics, collective communication allows the master process to identify the process with the best solution and point-to-point communication allows the best solution to be sent to the master process so that it can be distributed to all the processes in progress in order to direct the search toward a space of solutions which is close to the best solution found at the time. This search is performed by applying simulated annealing. On the other hand, the mathematical representation of an optimization model present in the literature of the university course timing problem is performed. The results obtained in this work show that the proposed metaheuristics improves the results of other metaheuristics for all test instances. Statistical analysis shows that the proposed metaheuristic presents a different behavior from the other metaheuristics with which it is compared.

show abstract

A Review of Metaheuristic Techniques for Solving University Course Timetabling Problem

Kaur

Saini

2020

Advances in Information Communication Technology and Computing

View full text Add to dashboard Cite

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

Cited by 7 publications

References 17 publications

A solution to the university course timetabling problem using a hybrid method based on genetic algorithms

A solution to the university course timetabling problem using a hybrid method based on genetic algorithms

Metaheuristic with Cooperative Processes for the University Course Timetabling Problem

A Review of Metaheuristic Techniques for Solving University Course Timetabling Problem

Contact Info

Product

Resources

About