Abstract

Tournament selection is a versatile method of selection and replacement used in evolutionary computation. Normally tournaments are chosen uniformly at random. This study demonstrates the effectiveness of planning tournaments in advance to control information flow within a population being evolved for optimization. Tests are performed on a variety of evolutionary test problems, finding that different planned tournament schemes yield significant differences in performance. the correct type of planned tournament is found to be problem dependent. in addition to a linear-function scheme for planning tournaments, this study also introduces a technique called multi-deme planned tournaments selection which permits simpler cases of a problem to be automatically used to reduce the time required to solve more complex cases. © 2011 Springer Science Business Media, LLC.

Department(s)

Engineering Management and Systems Engineering

Comments

Natural Sciences and Engineering Research Council of Canada, Grant DE-AC02-07CH11358

Keywords and Phrases

Optimization; Spatially structured algorithms; Test problems; Theory of evolutionary computation

International Standard Serial Number (ISSN)

1573-2924; 1389-4420

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Springer, All rights reserved.

Publication Date

01 Sep 2011

Download

Full Text Link

Share

 
COinS