By Topic

Knowledge learning based evolutionary algorithm for unconstrained optimization problem

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

3 Author(s)
Zhiwen Yu ; Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong ; Dingwen Wang ; Hau-San Wong

In this paper, we propose a new evolutionary algorithm called nearest neighbor evolutionary algorithm (NNE) to solve the unconstrained optimization problem. Specifically, NNE consists of two major steps: coarse nearest neighbor evolutionary and fine nearest neighbor evolutionary. The coarse nearest neighbor evolutionary step pays more attention to searching the optimal solutions in the global way, while the fine nearest neighbor evolutionary step focuses on searching the best solutions in the local way. NNE repeats two major steps until the terminate condition is reached. NNE not only adopts the elitist strategy and maintains the best individuals for the next generation, but also considers the knowledge obtained in the searching process. The experiments demonstrate that (1) NNE achieves good performance in most of numerical optimization problems; (2) NNE outperforms most of state-of-art evolutionary algorithms, such as traditional genetic algorithm (GA), the jumping gene genetic algorithm (JGGA).

Published in:

Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on

Date of Conference:

1-6 June 2008