By Topic

Performance evaluation of an advanced local search evolutionary algorithm

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)
Auger, A. ; CoLab Computational Lab., ETH, Zurich, Switzerland ; Hansen, N.

One natural question when testing performance of global optimization algorithm is: how performances compare to a restart local search algorithm. One purpose of this paper is to provide results for such comparisons. To this end, the performances of a restart (advanced) local-search strategy, the CMA-ES with small initial step-size, are investigated on the 25 functions of the CEC 2005 real-parameter optimization test suit. The second aim is to clarify the theoretical background of the performance criterion proposed to quantitatively compare the search algorithms. The theoretical analysis allows us to generalize the criterion proposed and to define a new criterion that can be applied more appropriate in a different context.

Published in:

Evolutionary Computation, 2005. The 2005 IEEE Congress on  (Volume:2 )

Date of Conference:

2-5 Sept. 2005