Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems

Authors:
Nasser R. Sabar;Masri Ayob;Graham Kendall;Rong Qu
Affiliations:
Jabatan Sains Komputer, Fakulti Teknologi dan Sains Maklumat, Universiti Kebangsaan Malaysia, Bangi Selangor, 43600 UKM;Jabatan Sains Komputer, Fakulti Teknologi dan Sains Maklumat, Universiti Kebangsaan Malaysia, Bangi Selangor, 43600 UKM;ASAP Research Group, School of Computer Science, The University of Nottingham, Nottingham, UK NG8 1BB;ASAP Research Group, School of Computer Science, The University of Nottingham, Nottingham, UK NG8 1BB
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 16
Cited 1

Reducing bias and inefficiency in the selection algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
A robust simulated annealing based examination timetabling system

Computers and Operations Research
A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems

Proceedings of the 6th International Conference on Genetic Algorithms
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 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
Tabu Search Techniques for Examination Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
New Algorithms for Examination Timetabling

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Timetable Scheduling Using Particle Swarm Optimization

ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 3
A survey of search methodologies and automated system development for examination timetabling

Journal of Scheduling
Ant algorithms for the university course timetabling problem with regard to the state-of-the-art

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Ant algorithms for the exam timetabling problem

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
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 new neural network based construction heuristic for the examination timetabling problem

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA university of technology

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving exam timetabling problems. We arrange exams in non-increasing order of the number of conflicts (degree) that they have with other exams. The difficulty of each exam to be scheduled is estimated based on the degree of exams in conflict. The degree determines the size of a segment in a roulette wheel, with a larger degree giving a larger segment. The roulette wheel selection mechanism selects an exam if the generated random number falls within the exam's segment. This overcomes the problem of repeatedly choosing and scheduling the same sequence of exams. We utilise the proposed Roulette Wheel Graph Colouring heuristic on the un-capacitated Carter's benchmark datasets. Results showed that this simple heuristic is capable of producing feasible solutions for all 13 instances.