All Outputs (3)

Hybrid Variable Neighborhood HyperHeuristicsfor Exam Timetabling Problems (2005)
Presentation / Conference Contribution
Qu, R., & Burke, E. (2005, August). Hybrid Variable Neighborhood HyperHeuristicsfor Exam Timetabling Problems. Paper presented at The Sixth Metaheuristics International Conference 2005, Vienna, Austria

This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual solu... Read More about Hybrid Variable Neighborhood HyperHeuristicsfor Exam Timetabling Problems.

A Decomposition, Construction and Post-Processing Approach for Nurse Rostering (2005)
Presentation / Conference Contribution
Brucker, P., Qu, R., Burke, E., & Post, G. (2005). A Decomposition, Construction and Post-Processing Approach for Nurse Rostering.

This paper presents our work on decomposing a specific nurse rostering problem by cyclically assigning blocks of shifts, which are designed considering both hard and soft constraints, to groups of nurses. The rest of the shifts are then assigned to t... Read More about A Decomposition, Construction and Post-Processing Approach for Nurse Rostering.

Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems (2005)
Book Chapter
Burke, E., Dror, M., Petrovic, S., & Qu, R. (2005). Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The Next Wave in Computing, Optimization, and Decision Technologies. Springer

This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which inte... Read More about Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems.