On steady-state evolutionary algorithms and selective pressure: Why inverse rank-based allocation of reproductive trials is best

Corus, D., Lissovoi, A., Oliveto, P. et al. (1 more author) (2021) On steady-state evolutionary algorithms and selective pressure: Why inverse rank-based allocation of reproductive trials is best. ACM Transactions on Evolutionary Learning and Optimization, 1 (1). 2. ISSN 2688-299X

Abstract

Metadata

Authors/Creators:
  • Corus, D.
  • Lissovoi, A.
  • Oliveto, P.
  • Witt, C.
Copyright, Publisher and Additional Information: © 2021 Association for Computing Machinery. This is an author-produced version of a paper subsequently published in ACM Transactions on Evolutionary Learning and Optimization. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: randomised search heuristics; (µ+1) EA; parent selection; diversity; TwoMax
Dates:
  • Accepted: 29 September 2020
  • Published (online): 26 April 2021
  • Published: June 2021
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Funding Information:
FunderGrant number
ENGINEERING AND PHYSICAL SCIENCE RESEARCH COUNCILEP/M004252/1
Depositing User: Symplectic Sheffield
Date Deposited: 03 Nov 2020 16:28
Last Modified: 15 Jul 2021 14:49
Status: Published
Publisher: Association for Computing Machinery
Refereed: Yes
Identification Number: https://doi.org/10.1145/3427474

Share / Export

Statistics