By Topic

Understand behavior and performance of Real Coded Optimization Algorithms via NK-linkage model

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)
Yu Wang ; Nature Inspired Computation and Applications Laboratory, University of Science and Technology of China, Hefei, Anhui 230027, China ; Bin Li

Classical NK-landcape model was designed for analyzing optimization and evolution process in binary solution space, so it can not be used to analyze real coded optimization algorithms (RCOAs) directly, which work in continuous solution space directly. In this paper, the concept of NK-landscape model is extended to the continuous space, and a new NK-landscape model with continuous space is proposed. The new model is powerful and comprehensive with simple structure and flexible formula. Therefore, it can be used to construct test functions of various types of linkages for analyzing various performances of RCOAs. The feasibility of the proposed model is testified via experiments with 3 well-known RCOAs, ( i.e. covariance matrix adapting evolutionary strategy (CMA-ES), differential evolution (DE), neighborhood search differential evolution (NSDE)). The results show that the new model can reveal the merits and demerits of RCOAs effectively.

Published in:

2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)

Date of Conference:

1-6 June 2008