The university course timetabling problem (UCTP) arises every academic year and must be
solved by academic staff with/without a course timetabling tool. A Hybrid Self-adaptive …

Academic institutions may be edging towards a global uncertainty, recession, and a string of
financial difficulties. An effective course timetabling is one of managerial strategies to …

Cuttlefish algorithm (CFA) is a metaheuristic bio-inspired algorithm that mimics the color-
changing behavior by the cuttlefish. It is produced by light reflected from different layers of …

This paper addresses the curriculum-based course timetabling problem (CB-CCT) with extra
travelling distance constraints using an improved simulated annealing algorithm. The …

Social distancing during COVID-19 has become one of the most important measures in
reducing the risks of the spread of the virus. Implementing these measures at universities is …

Simulated Annealing (SA) is a common meta-heuristic algorithm that has been widely used
to solve complex optimization problems. This is due to its ease of implementation and …

Method: The Simulated Annealing (SA) algorithm is a meta-heuristic search for global
optimization problems; the overall objective of such algorithms is to find a good …

Simulated Annealing (SA) is a common meta-heuristic algorithm that has been widely used
to solve complex optimization problems. This work proposes a hybrid SA with EMC to divert …

This paper summarizes our work towards developing a solution to the Curriculum Based
Timetabling Problem (CB-TTP) at a Mexican university and providing significant insights into …

Introducción: En ocasiones, los problemas de Optimización Combinatoria (COP), tal como el
Problema de Calendarización de horarios (CTTP), se puede resolver utilizando técnicas …