Hybrid graph heuristics within a hyper-heuristic approach to exam timetabling problems

Edmund Burke, Moshe Dror, Sanja Petrovic, Rong Qu

Research output: Contribution to journalArticle

41 Citations (Scopus)

Abstract

This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyper-heuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic lists (of graph heuristics) for solving problems and investigated the heuristic lists found by employing knowledge discovery techniques. Two hybrid approaches (involving Saturation Degree and Largest Degree) including one which employs Case Based Reasoning are presented and discussed. Both the Tabu Search based hyper-heuristic and the hybrid approaches are tested on random and real-world exam timetabling problems. Experimental results are comparable with the best state-of-the-art approaches (as measured against established benchmark problems). The results also demonstrate an increased level of generality in our approach.

Original languageEnglish (US)
Pages (from-to)79-91
Number of pages13
JournalOperations Research/ Computer Science Interfaces Series
Volume29
StatePublished - 2005

Fingerprint

Tabu search
Case based reasoning
Coloring
Heuristic algorithms
Data mining
Timetabling
Heuristics
Graph

Keywords

  • Case based reasoning
  • Exam timetabling problems
  • Graph heuristics
  • Hyper-heuristics
  • Knowledge discovery
  • Tabu search

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Computer Science(all)

Cite this

Hybrid graph heuristics within a hyper-heuristic approach to exam timetabling problems. / Burke, Edmund; Dror, Moshe; Petrovic, Sanja; Qu, Rong.

In: Operations Research/ Computer Science Interfaces Series, Vol. 29, 2005, p. 79-91.

Research output: Contribution to journalArticle

@article{7a79b0a0b29646c7ad7fa99ac816d6f6,
title = "Hybrid graph heuristics within a hyper-heuristic approach to exam timetabling problems",
abstract = "This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyper-heuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic lists (of graph heuristics) for solving problems and investigated the heuristic lists found by employing knowledge discovery techniques. Two hybrid approaches (involving Saturation Degree and Largest Degree) including one which employs Case Based Reasoning are presented and discussed. Both the Tabu Search based hyper-heuristic and the hybrid approaches are tested on random and real-world exam timetabling problems. Experimental results are comparable with the best state-of-the-art approaches (as measured against established benchmark problems). The results also demonstrate an increased level of generality in our approach.",
keywords = "Case based reasoning, Exam timetabling problems, Graph heuristics, Hyper-heuristics, Knowledge discovery, Tabu search",
author = "Edmund Burke and Moshe Dror and Sanja Petrovic and Rong Qu",
year = "2005",
language = "English (US)",
volume = "29",
pages = "79--91",
journal = "Operations Research/ Computer Science Interfaces Series",
issn = "1387-666X",
publisher = "Springer Science + Business Media",

}

TY - JOUR

T1 - Hybrid graph heuristics within a hyper-heuristic approach to exam timetabling problems

AU - Burke, Edmund

AU - Dror, Moshe

AU - Petrovic, Sanja

AU - Qu, Rong

PY - 2005

Y1 - 2005

N2 - This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyper-heuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic lists (of graph heuristics) for solving problems and investigated the heuristic lists found by employing knowledge discovery techniques. Two hybrid approaches (involving Saturation Degree and Largest Degree) including one which employs Case Based Reasoning are presented and discussed. Both the Tabu Search based hyper-heuristic and the hybrid approaches are tested on random and real-world exam timetabling problems. Experimental results are comparable with the best state-of-the-art approaches (as measured against established benchmark problems). The results also demonstrate an increased level of generality in our approach.

AB - This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyper-heuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic lists (of graph heuristics) for solving problems and investigated the heuristic lists found by employing knowledge discovery techniques. Two hybrid approaches (involving Saturation Degree and Largest Degree) including one which employs Case Based Reasoning are presented and discussed. Both the Tabu Search based hyper-heuristic and the hybrid approaches are tested on random and real-world exam timetabling problems. Experimental results are comparable with the best state-of-the-art approaches (as measured against established benchmark problems). The results also demonstrate an increased level of generality in our approach.

KW - Case based reasoning

KW - Exam timetabling problems

KW - Graph heuristics

KW - Hyper-heuristics

KW - Knowledge discovery

KW - Tabu search

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

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

M3 - Article

AN - SCOPUS:84888603386

VL - 29

SP - 79

EP - 91

JO - Operations Research/ Computer Science Interfaces Series

JF - Operations Research/ Computer Science Interfaces Series

SN - 1387-666X

ER -