An experimental study on hyper-heuristics and exam timetabling

Authors:
Burak Bilgin;Ender Özcan;Emin Erkan Korkmaz
Affiliations:
Artificial Intelligence Laboratory, Yeditepe University, Department of Computer Engineering, Kadiköy/Istanbul, Turkey;Artificial Intelligence Laboratory, Yeditepe University, Department of Computer Engineering, Kadiköy/Istanbul, Turkey;Artificial Intelligence Laboratory, Yeditepe University, Department of Computer Engineering, Kadiköy/Istanbul, Turkey
Venue:
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Year:
2006

Citing 7
Cited 20

Numerical Optimization of Computer Models

Numerical Optimization of Computer Models
A Memetic Algorithm for University Exam Timetabling

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Examination Timetabling in British Universities: A Survey

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
Case-based heuristic selection for timetabling problems

Journal of Scheduling
Distributed choice function hyper-heuristics for timetabling and scheduling

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling

A comprehensive analysis of hyper-heuristics

Intelligent Data Analysis
A survey of search methodologies and automated system development for examination timetabling

Journal of Scheduling
A multi-objective evolutionary algorithm for examination timetabling

Journal of Scheduling
Examination timetabling using late acceptance hyper-heuristics

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Scheduling English football fixtures over the holiday period using hyper-heuristics

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Scatter search technique for exam timetabling

Applied Intelligence
Frequency distribution based hyper-heuristic for the bin-packing problem

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Neural networks to guide the selection of heuristics within constraint satisfaction problems

MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
Hill climbers and mutational heuristics in hyperheuristics

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Solving effectively the school timetabling problem using particle swarm optimization

Expert Systems with Applications: An International Journal
The Interleaved Constructive Memetic Algorithm and its application to timetabling

Computers and Operations Research
On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems

Information Sciences: an International Journal
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice

Journal of Scheduling
A hyper-heuristic approach for the unit commitment problem

EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
One hyper-heuristic approach to two timetabling problems in health care

Journal of Heuristics
A hybrid particle swarm optimization based algorithm for high school timetabling problems

Applied Soft Computing
An improved choice function heuristic selection for cross domain heuristic search

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Learning vector quantization for variable ordering in constraint satisfaction problems

Pattern Recognition Letters
Parallel Scatter Search Algorithms for Exam Timetabling

International Journal of Applied Metaheuristic Computing
A comparative study of hyper-heuristics for solving the school timetabling problem

Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hyper-heuristics are proposed as a higher level of abstraction as compared to the metaheuristics. Hyper-heuristic methods deploy a set of simple heuristics and use only non-problem-specific data, such as fitness change or heuristic execution time. A typical iteration of a hyper-heuristic algorithm consists of two phases: the heuristic selection method and move acceptance. In this paper, heuristic selection mechanisms and move acceptance criteria in hyper-heuristics are analyzed in depth. Seven heuristic selection methods and five acceptance criteria are implemented. The performance of each selection and acceptance mechanism pair is evaluated on 14 well-known benchmark functions and 21 exam timetabling problem instances.