By Topic

Fitness landscape analysis of differential evolution algorithms

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)
Uludag, G. ; Inf. Inst., Istanbul Tech. Univ., Istanbul, Turkey ; Uyar, A.S.

Fitness landscape analysis in evolutionary algorithms is commonly done on problems represented as bit strings with Hamming distance based random walks on the landscape. In this study, we aim to do a preliminary fitness landscape analysis of the differential evolution algorithm, which works on continuous search spaces. To the authors' best knowledge, no such fitness landscape analysis has been conducted in literature on continuous problems where search is performed through differential evolution. To achieve this aim, we first propose a suitable neighborhood definition through which a vector-based random walk on the landscape is possible. Then we use this neighborhood definition to conduct a fitness distance correlation and a correlation length analysis on a series of benchmark functions.

Published in:

Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control, 2009. ICSCCW 2009. Fifth International Conference on

Date of Conference:

2-4 Sept. 2009