Abstract
This chapter studies the influence of population on evolutionary algorithms. We show that, on one hand, population is unexpected for simple functions such as OneMax and LeadningOnes by derving the lower running time bound, and on the other hand, in the presence of noise, using population can enhance the robustness against noise.
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). Population. In: Evolutionary Learning: Advances in Theories and Algorithms. Springer, Singapore. https://doi.org/10.1007/978-981-13-5956-9_11
Download citation
DOI: https://doi.org/10.1007/978-981-13-5956-9_11
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)