Research Repository

Tailoring hyper-heuristics to specific instances of a scheduling problem using affinity and competence functions

Salhi, A and Vázquez Rodríguez, JA (2014) 'Tailoring hyper-heuristics to specific instances of a scheduling problem using affinity and competence functions.' Memetic Computing, 6 (2). 77 - 84. ISSN 1865-9284

[img]
Preview
Text
MEME-Paper-with-Reference (2).pdf - Accepted Version

Download (167kB) | Preview

Abstract

Hyper-heuristics are high level heuristics which coordinate lower level ones to solve a given problem. Low level heuristics, however, are not all as competent/good as each other at solving the given problem and some do not work together as well as others. Hence the idea of measuring how good they are (competence) at solving the problem and how well they work together (their affinity). Models of the affinity and competence properties are suggested and evaluated using previous information on the performance of the simple low level heuristics. The resulting model values are used to improve the performance of the hyper-heuristic by tailoring it not only to the specific problem but the specific instance being solved. The test case is a hard combinatorial problem, namely the Hybrid Flow Shop scheduling problem. Numerical results on randomly generated as well as real-world instances are included. © 2013 Springer-Verlag Berlin Heidelberg.

Item Type: Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Jim Jamieson
Date Deposited: 06 Aug 2013 10:50
Last Modified: 30 Jan 2019 16:18
URI: http://repository.essex.ac.uk/id/eprint/7255

Actions (login required)

View Item View Item