By Topic

Performance analysis of evolutionary optimization with cumulative step length adaptation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Arnold, D.V. ; Fac. of Comput. Sci., Dalhousie Univ., Halifax, NS, Canada ; Beyer, H.-G.

Iterative algorithms for continuous numerical optimization typically need to adapt their step lengths in the course of the search. While some strategies employ fixed schedules, others attempt to adapt dynamically in response to the outcome of trial steps or the history of the search process. Evolutionary algorithms are of the latter kind. A control strategy that is commonly used in evolution strategies is the cumulative step length adaptation approach. This paper presents a theoretical analysis of that adaptation strategy. The analysis includes the practically relevant case of noise interfering in the optimization process. Recommendations are made with respect to choosing appropriate population sizes.

Published in:

Automatic Control, IEEE Transactions on  (Volume:49 ,  Issue: 4 )