Skip to main content

Research Repository

Advanced Search

Hyper-heuristics: a survey of the state of the art

Burke, Edmund; Gendreau, Michel; Hyde, Matthew; Kendall, Graham; Ocha, Gabriela; �zcan, Ender; Qu, Rong

Hyper-heuristics: a survey of the state of the art Thumbnail


Authors

Edmund Burke

Michel Gendreau

Matthew Hyde

Graham Kendall

Gabriela Ocha

Ender �zcan

Profile Image

RONG QU rong.qu@nottingham.ac.uk
Professor of Computer Science



Abstract

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the goal of automating the design of heuristic methods to solve hard computational search problems. An underlying strategic research challenge is to develop more generally applicable search methodologies. The term hyper-heuristic is relatively new; it was first used in 2000 to describe heuristics to choose heuristics in the context of combinatorial optimisation. However, the idea of automating the design of heuristics is not new; it can be traced back to the 1960s. The definition of hyper-heuristics has been recently extended to refer to a search method or learning mechanism for selecting or generating heuristics to solve computational search problems. Two main hyper-heuristic categories can be considered: heuristic selection and heuristic generation. The distinguishing feature of hyper-heuristics is that they operate on a search space of heuristics (or heuristic components) rather than directly on the search space of solutions to the underlying problem that is being addressed. This paper presents a critical discussion of the scientific literature on hyper-heuristics including their origin and intellectual roots, a detailed account of the main types of approaches, and an overview of some related areas. Current research trends and directions for future research are also discussed.

Citation

Burke, E., Gendreau, M., Hyde, M., Kendall, G., Ocha, G., Özcan, E., & Qu, R. (2013). Hyper-heuristics: a survey of the state of the art. Journal of the Operational Research Society, 64, https://doi.org/10.1057/jors.2013.71

Journal Article Type Article
Publication Date Dec 1, 2013
Deposit Date Feb 26, 2015
Publicly Available Date Feb 26, 2015
Journal Journal of the Operational Research Society
Print ISSN 0160-5682
Electronic ISSN 0160-5682
Publisher Taylor & Francis Open
Peer Reviewed Peer Reviewed
Volume 64
DOI https://doi.org/10.1057/jors.2013.71
Keywords Hyper-heuristics; evolutionary computation; metaheuristics; machine learning; combinatorial optimisation; scheduling
Public URL https://nottingham-repository.worktribe.com/output/1000431
Publisher URL http://www.palgrave-journals.com/jors/journal/v64/n12/full/jors201371a.html
Additional Information This is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version, Journal of the Operational Research Society (2013) 64, 1695–1724 doi:10.1057/jors.2013.71 is available online at: http://www.palgrave-journals.com/jors/journal/v64/n12/full/jors201371a.html

Files





You might also like



Downloadable Citations