Journal of Computational Physics
A tabu search heuristic for the vehicle routing problem
Management Science
Computers and Operations Research
A robust simulated annealing based examination timetabling system
Computers and Operations Research
Coloration neighborhood structures for general graph coloring
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
A Memetic Algorithm for University Exam Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Examination Timetables and Tabu Search with Longer-Term Memory
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A Multicriteria Approach to Examination Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Tabu Search Techniques for Examination Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Selected Papers from AISB Workshop on Evolutionary Computing
New Algorithms for Examination Timetabling
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Fuzzy multiple heuristic orderings for examination timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A Developmental Approach to the Uncapacitated Examination Timetabling Problem
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
The revised developmental approach to the uncapacitated examination timetabling problem
Proceedings of the 2009 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
An informed genetic algorithm for the examination timetabling problem
Applied Soft Computing
Examination timetabling using late acceptance hyper-heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
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
Solving a practical examination timetabling problem: a case study
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
A tabu-based memetic approach for examination timetabling problems
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Neighborhood analysis: a case study on curriculum-based course timetabling
Journal of Heuristics
Scatter search technique for exam timetabling
Applied Intelligence
A wide-ranging computational comparison of high-performance graph colouring algorithms
Computers and Operations Research
Information Sciences: an International Journal
A hybrid fish swarm optimisation algorithm for solving examination timetabling problems
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Parallel Scatter Search Algorithms for Exam Timetabling
International Journal of Applied Metaheuristic Computing
Hi-index | 0.00 |
A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the traditional genetic recombination operators. One of the search operators is designed to repair unfeasible timetables produced by the initialization procedure and the mutation operator. The other search operator implements a simplified Variable Neighborhood Descent meta-heuristic and its role is to improve the proximity cost. The resulting non dominated timetables are compared with those produced by other optimization methods using 15 public domain datasets. Without special fine-tuning, the hybrid algorithm was able to produce timetables with good rankings in nine of the 15 datasets.