A survey of approaches for university course timetabling problem
H Babaei, J Karimpour, A Hadidi - Computers & Industrial Engineering, 2015 - Elsevier
Scheduling is one of the problems which so many researches have been conducted on it
over the years. The university course timetabling problem which is an NP-hard problem is a …
over the years. The university course timetabling problem which is an NP-hard problem is a …
A survey of the state-of-the-art of optimisation methodologies in school timetabling problems
Educational timetabling is an ongoing challenging administrative task that is required in
most academic institutions. This is mainly due to a large number of constraints and …
most academic institutions. This is mainly due to a large number of constraints and …
The university course timetabling problem with a three-phase approach
P Kostuch - International Conference on the Practice and Theory of …, 2004 - Springer
This paper describes the University Course Timetabling Problem (UCTP) used in the
International Timetabling Competition 2003 organized by the Metaheuristics Network and …
International Timetabling Competition 2003 organized by the Metaheuristics Network and …
Hybrid heuristics for examination timetabling problem
ZN Azimi - Applied Mathematics and Computation, 2005 - Elsevier
Simulated Annealing (SA), Tabu Search (TS), Genetic Algorithm (GA), and Ant Colony
System (ACS) are four of the main algorithms for solving challenging problems of intelligent …
System (ACS) are four of the main algorithms for solving challenging problems of intelligent …
Solution approaches to the course timetabling problem
SA MirHassani, F Habibi - Artificial Intelligence Review, 2013 - Springer
University course timetabling is one of the most important administrative activities that take
place in all academic institutions. In this work, we go over the main points of recent papers …
place in all academic institutions. In this work, we go over the main points of recent papers …
[PDF][PDF] Fuzzy genetic heuristic for university course timetable problem
A Chaudhuri, K De - Int. J. Advance. Soft Comput. Appl, 2010 - researchgate.net
Abstract University Course Timetable Problem is NP-Hard combinatorial optimization
problem which lacks analytical solution methods. It has received tremendous attention from …
problem which lacks analytical solution methods. It has received tremendous attention from …
A hybrid simulated annealing with kempe chain neighborhood for the university timetabling problem
This paper addresses the problem of finding a feasible solution for the university course
timetabling problem (UCTP), ie a solution that satisfies all the so-called hard constraints. The …
timetabling problem (UCTP), ie a solution that satisfies all the so-called hard constraints. The …
Developing novel meta-heuristic, hyper-heuristic and cooperative search for course timetabling problems
J Henry Obit - 2010 - eprints.nottingham.ac.uk
The research presented in this PhD thesis focuses on the problem of university course
timetabling, and examines the various ways in which metaheuristics, hyperheuristics and …
timetabling, and examines the various ways in which metaheuristics, hyperheuristics and …
Comparison of metaheuristic algorithms for examination timetabling problem
ZN Azimi - Journal of Applied Mathematics and computing, 2004 - Springer
Abstract SA, TS, GA and ACS are four of the main algorithms for solving challenging
problems of intelligent systems. In this paper we consider Examination Timetabling Problem …
problems of intelligent systems. In this paper we consider Examination Timetabling Problem …
Using B and ProB for data validation projects
D Hansen, D Schneider, M Leuschel - … State Machines, Alloy, B, TLA, VDM …, 2016 - Springer
Constraint satisfaction and data validation problems can be expressed very elegantly in
state-based formal methods such as B. However, is B suited for developing larger …
state-based formal methods such as B. However, is B suited for developing larger …