id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_xao5rk2nyrdc3o6b4lxdaao2aa	Anas Elhag	A grouping hyper-heuristic framework: Application on graph colouring	2015	26	.pdf	application/pdf	14233	1703	76	Keywords: hyper-heuristics, grouping problems, graph colouring, timetabling type of high level search methods that mix and control a pre-defined set of low level perturbative heuristics (operators) processing complete solutions at each step under a single-point based In this study, we describe a selection hyper-heuristic framework for grouping problems. each different problem domain, in our proposed framework the set of low level heuristics is fixed We have investigated the performance of the framework using different selection hyperheuristic components on a set of well known graph colouring benchmark instances 1. Additionally, we applied the same hyper-heuristic without any modification to a benchmark of examination timetabling instances in order to examine the generality of the framework. In this study, we describe a single-point based selection hyper-heuristic framework for grouping problems that keeps track of the non-dominated solutions, inspired from the multi-objective Algorithm 1 Hyper-heuristic framework for grouping problems	./cache/work_xao5rk2nyrdc3o6b4lxdaao2aa.pdf	./txt/work_xao5rk2nyrdc3o6b4lxdaao2aa.txt