[HTML][HTML] Meta-heuristic approaches for the university course timetabling problem
Course timetabling is an ongoing challenge that universities face all around the world. This
combinatorial optimization task involves allocating a set of events into finite time slots and …
combinatorial optimization task involves allocating a set of events into finite time slots and …
[PDF][PDF] Effective solution of university course timetabling using particle swarm optimizer based hyper heuristic approach
The university course timetable problem (UCTP) is typically a combinatorial optimization
problem. Manually achieving a useful timetable requires many days of effort, and the results …
problem. Manually achieving a useful timetable requires many days of effort, and the results …
Comparison of metaheuristic algorithms with a methodology of design for the evaluation of hard constraints over the course timetabling problem
Abstract The Course Timetabling problem is one of the most difficult and common problems
inside an university. The main objective of this problem is to obtain a timetabling with the …
inside an university. The main objective of this problem is to obtain a timetabling with the …
Methodology of design: A novel generic approach applied to the course timetabling problem
Abstract The Course Timetabling problem is one of the most difficult and common problems
inside a university. The main objective of this problem is to obtain a timetabling with the …
inside a university. The main objective of this problem is to obtain a timetabling with the …
[PDF][PDF] Intelligent Systems with Applications
S Abdipoor, R Yaakob, SL Goh, S Abdullah - researchgate.net
Course timetabling is an ongoing challenge that universities face all around the world. This
combinatorial optimization task involves allocating a set of events into finite time slots and …
combinatorial optimization task involves allocating a set of events into finite time slots and …