Performance of selection hyper-heuristics on the extended HyFlex domains

Almutairi, Alhanof, Özcan, Ender, Kheiri, Ahmed ORCID: https://orcid.org/0000-0002-6716-2130 and Jackson, Warren G. 2016. Performance of selection hyper-heuristics on the extended HyFlex domains. Czachórski, Tadeusz, Gelenbe, Erol, Grochla, Krzysztof and Lent, Ricardo, eds. Computer and Information Sciences, Vol. 659. Communications in Computer and Information Science, Cham: Springer, pp. 154-162. (10.1007/978-3-319-47217-1_17)

Preview

PDF - Accepted Post-Print Version Available under License Creative Commons Attribution. Download (109kB) | Preview

Abstract

Selection hyper-heuristics perform search over the space of heuristics by mixing and controlling a predefined set of low level heuristics for solving computationally hard combinatorial optimisation problems. Being reusable methods, they are expected to be applicable to multiple problem domains, hence performing well in cross-domain search. HyFlex is a general purpose heuristic search API which separates the high level search control from the domain details enabling rapid development and performance comparison of heuristic search methods, particularly hyper-heuristics. In this study, the performance of six previously proposed selection hyper-heuristics are evaluated on three recently introduced extended HyFlex problem domains, namely 0–1 Knapsack, Quadratic Assignment and Max-Cut. The empirical results indicate the strong generalising capability of two adaptive selection hyper-heuristics which perform well across the ‘unseen’ problems in addition to the six standard HyFlex problem domains.

Item Type:	Book Section
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Publisher:	Springer
ISBN:	978-3-319-47217-1
ISSN:	1865-0929
Date of First Compliant Deposit:	6 October 2016
Last Modified:	15 Nov 2023 08:35
URI:	https://orca.cardiff.ac.uk/id/eprint/95180

Citation Data

Cited 5 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item