Examination timetabling by computer
Computers and Operations Research
A survey of practical applications of examination timetabling algorithms
Operations Research
Solving the maximum clique problem using a tabu search approach
Annals of Operations Research - Special issue on Tabu search
Journal of Computational Physics
Case-based reasoning
Artificial Intelligence - Special volume on planning and scheduling
Case-Based Reasoning: Experiences, Lessons and Future Directions
Case-Based Reasoning: Experiences, Lessons and Future Directions
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Recent Developments in Practical Examination Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Memetic Algorithm for University Exam Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Examination Timetabling in British Universities: A Survey
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Tabu Search Techniques for Examination Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
Case-based heuristic selection for timetabling problems
Journal of Scheduling
Initialization strategies and diversity in evolutionary timetabling
Evolutionary Computation
Computers and Operations Research
A multi-objective evolutionary algorithm for examination timetabling
Journal of Scheduling
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Grasp and Guided Local Search for the examination timetabling problem
International Journal of Artificial Intelligence and Soft Computing
EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
A novel fuzzy approach to evaluate the quality of examination timetabling
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Ant algorithms for the exam timetabling problem
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Selection mechanisms in memory consideration for examination timetabling with harmony search
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A tabu-based memetic approach for examination timetabling problems
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
A hybrid fish swarm optimisation algorithm for solving examination timetabling problems
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Examination timetabling with fuzzy constraints
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Fuzzy multiple heuristic orderings for examination timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A graph coloring constructive hyper-heuristic for examination timetabling problems
Applied Intelligence
Hi-index | 0.00 |
Metaheuristic approaches to examination timetabling problems are usually split into two phases: an initialisation phase in which a sequential graph colouring heuristic is employed to construct an initial solution and an improvement phase in which the initial solution is gradually improved. Different hybridisations of metaheuristics with sequential heuristics are known to lead to solutions of different quality. A Case Based Reasoning (CBR) methodology has been developed for selecting an appropriate sequential construction heuristic for hybridisation with the Great Deluge metaheuristic. In this paper we propose a new similarity measure between two timetabling problems that is based on fuzzy sets. The experiments were performed on a number of real-world benchmark problems and the results were also compared with other state-of-the-art methods. The results obtained show the effectiveness of the developed CBR system.