Abstract
This chapter studies the relationship among different analysis approaches for running time complexity of evolutionary algorithms, through the defined reducibility relation between two approaches. Consequently, we find that switch analysis can serve as a unified analysis approach, as other approaches can be reduced to switch analysis. This unification also provides a perspective to understand different approaches.
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
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Zhou, ZH., Yu, Y., Qian, C. (2019). Running Time Analysis: Comparison and Unification. In: Evolutionary Learning: Advances in Theories and Algorithms. Springer, Singapore. https://doi.org/10.1007/978-981-13-5956-9_5
Download citation
DOI: https://doi.org/10.1007/978-981-13-5956-9_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-5955-2
Online ISBN: 978-981-13-5956-9
eBook Packages: Computer ScienceComputer Science (R0)