By Topic

On the performance of evolutionary algorithms with life-time adaptation in dynamic fitness landscapes

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
$33 $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)
R. Eriksson ; Dept. of Comput. Sci., Skovde Univ., Sweden ; B. Olsson

This work demonstrates how the efficiency of evolutionary algorithms in dynamic environments can be improved by use of life-time adaptation. Our results contradict the hypothesis that there would be a tradeoff between designing and tuning EAs for static and dynamic environments, in which improved efficiency in one type of environment would decrease the efficiency in the other. In contrast, we show that the inclusion of life-time adaptation can result in EAs that outperform traditional EAs in both static and dynamic environments. Since the performance of EAs with life-time adaptation in dynamic environments are currently poorly understood at best, we conduct an extensive evaluation of the performance of these EAs on combinatorial and continuous dynamic global optimization problems with well-defined characteristics. In doing so, we propose improved benchmark dynamic fitness functions for both the combinatorial and continuous domains, which we have termed random dynamics NK-landscapes and structured moving peaks landscapes, respectively.

Published in:

Evolutionary Computation, 2004. CEC2004. Congress on  (Volume:2 )

Date of Conference:

19-23 June 2004