Abstract
Hyper-heuristics aim to provide heuristic algorithms of a higher level of generality that produce good results for all problems in a domain rather than just for one or two problem instances but poor results for the others. Cross-domain hyper-heuristics extend this scope of generality across domains. These hyper-heuristics aim at producing good results across problems for different domains rather than for one domain and poor results for another domain. This research has essentially focused on solving discrete combinatorial optimization problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Pillay, N., Qu, R. (2018). Cross-Domain Hyper-Heuristics. In: Hyper-Heuristics: Theory and Applications. Natural Computing Series. Springer, Cham. https://doi.org/10.1007/978-3-319-96514-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-96514-7_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96513-0
Online ISBN: 978-3-319-96514-7
eBook Packages: Computer ScienceComputer Science (R0)