Roulette wheel graph colouring for solving examination timetabling problems

Nasser R. Sabar, Masri Ayob, Graham Kendall, Rong Qu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages463-470
Number of pages8
Volume5573 LNCS
DOIs
Publication statusPublished - 2009
Event3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009 - Huangshan
Duration: 10 Jun 200912 Jun 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5573 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009
CityHuangshan
Period10/6/0912/6/09

Fingerprint

Roulette
Timetabling
Graph Coloring
Coloring
Wheel
Wheels
Heuristics
Random number
Simple Graph
Scheduling
Benchmark
Conflict

Keywords

  • Examination timetabling
  • Graph colouring heuristics
  • Roulette wheel selection
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Sabar, N. R., Ayob, M., Kendall, G., & Qu, R. (2009). Roulette wheel graph colouring for solving examination timetabling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5573 LNCS, pp. 463-470). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5573 LNCS). https://doi.org/10.1007/978-3-642-02026-1_44

Roulette wheel graph colouring for solving examination timetabling problems. / Sabar, Nasser R.; Ayob, Masri; Kendall, Graham; Qu, Rong.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5573 LNCS 2009. p. 463-470 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5573 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sabar, NR, Ayob, M, Kendall, G & Qu, R 2009, Roulette wheel graph colouring for solving examination timetabling problems. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5573 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5573 LNCS, pp. 463-470, 3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009, Huangshan, 10/6/09. https://doi.org/10.1007/978-3-642-02026-1_44
Sabar NR, Ayob M, Kendall G, Qu R. Roulette wheel graph colouring for solving examination timetabling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5573 LNCS. 2009. p. 463-470. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-02026-1_44
Sabar, Nasser R. ; Ayob, Masri ; Kendall, Graham ; Qu, Rong. / Roulette wheel graph colouring for solving examination timetabling problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5573 LNCS 2009. pp. 463-470 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bae6f2f7e85e45cc895f6027d35f8c34,
title = "Roulette wheel graph colouring for solving examination timetabling problems",
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.",
keywords = "Examination timetabling, Graph colouring heuristics, Roulette wheel selection, Scheduling",
author = "Sabar, {Nasser R.} and Masri Ayob and Graham Kendall and Rong Qu",
year = "2009",
doi = "10.1007/978-3-642-02026-1_44",
language = "English",
isbn = "3642020259",
volume = "5573 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "463--470",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Roulette wheel graph colouring for solving examination timetabling problems

AU - Sabar, Nasser R.

AU - Ayob, Masri

AU - Kendall, Graham

AU - Qu, Rong

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Examination timetabling

KW - Graph colouring heuristics

KW - Roulette wheel selection

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=70350654243&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350654243&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02026-1_44

DO - 10.1007/978-3-642-02026-1_44

M3 - Conference contribution

AN - SCOPUS:70350654243

SN - 3642020259

SN - 9783642020254

VL - 5573 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 463

EP - 470

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -