Abstract
The majority of this book has thus far focused on characterizing search methods rather than search problems. Search problems, when presented, have primarily been constrained to static optimization problems, in particular, through fitness measures that allow stochastic selection of a static problem. In Chapter 12, the question of alignment between search problems and solutions was prominently raised in the context of No Free Lunch; NFL itself was described as a type of search problem most closely aligned with blind random search.
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
© 2020 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
Lockett, A.J. (2020). The Optimization Game. In: General-Purpose Optimization Through Information Maximization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-62007-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-662-62007-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-62006-9
Online ISBN: 978-3-662-62007-6
eBook Packages: Computer ScienceComputer Science (R0)