A grouping hyper-heuristic framework: application on graph colouring

Elhag, Anas and Özcan, Ender (2015) A grouping hyper-heuristic framework: application on graph colouring. Expert Systems with Applications, 42 (13). pp. 5491-5507. ISSN 0957-4174

Full text not available from this repository.


Grouping problems are hard to solve combinatorial optimisation problems which require partitioning of objects into a minimum number of subsets while a given objective is simultaneously optimised. Selection hyper-heuristics are high level general purpose search methodologies that operate on a space formed by a set of low level heuristics rather than solutions. Most of the recently proposed selection hyper-heuristics are iterative and make use of two key methods which are employed successively; heuristic selection and move acceptance. In this study, we present a novel generic selection hyper-heuristic framework containing a fixed set of reusable grouping low level heuristics and an unconventional move acceptance mechanism for solving grouping problems. This framework deals with one solution at a time at any given decision point during the search process. Also, a set of high quality solutions, capturing the trade-off between the number of groups and the additional objective for the given grouping problem, is maintained. The move acceptance mechanism embeds a local search approach which is capable of progressing improvements on those trade-off solutions. The performance of different selection hyper-heuristics with various components under the proposed framework is investigated on graph colouring as a representative grouping problem. Then, the top performing hyper-heuristics are applied to a benchmark of examination timetabling instances. The empirical results indicate the effectiveness and generality of the proposed framework enabling grouping hyper-heuristics to achieve high quality solutions in both domains. ©2015 Elsevier Ltd. All rights reserved.

Item Type: Article
RIS ID: https://nottingham-repository.worktribe.com/output/755552
Keywords: Combinatorial optimization; Computer software reusability; Economic and social effects; Graph theory; Iterative methods; Optimization; Problem solving; Scheduling, Examination timetabling; Graph colouring; Grouping problem; Heuristic selections; High-quality solutions; Hyper-heuristics; Timetabling; Tradeoff solution, Heuristic methods
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1016/j.eswa.2015.01.038
Depositing User: Ozcan, Dr Ender
Date Deposited: 10 Mar 2016 10:26
Last Modified: 04 May 2020 17:11
URI: https://eprints.nottingham.ac.uk/id/eprint/32183

Actions (Archive Staff Only)

Edit View Edit View