Abstract
When stochastic search heuristics are used for optimisation they are often stopped after some time has passed and the best search point they have found at this point is used as the solution. Fixed-budget analysis is an analytical perspective that delivers results about the expected quality of the solution in this situation. It allows the comparison of different stochastic search heuristics when only a fixed computational budget is available and it offers a very different perspective from runtime analysis. This chapter introduces and motivates this approach to the theoretical analysis of stochastic search heuristics. It provides basic results, describes a general technique to derive such results from runtime results, covers analytical methods that have been applied and describes a range of different results that have been obtained so far.
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
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Jansen, T. (2020). Analysing Stochastic Search Heuristics Operating on a Fixed Budget. In: Doerr, B., Neumann, F. (eds) Theory of Evolutionary Computation. Natural Computing Series. Springer, Cham. https://doi.org/10.1007/978-3-030-29414-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-29414-4_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29413-7
Online ISBN: 978-3-030-29414-4
eBook Packages: Computer ScienceComputer Science (R0)