By Topic

Comparative Evaluations of Evolutionary Computation with Elite Obtained in Reduced Dimensional Spaces

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)
Yan Pei ; Grad. Sch. of Design, Kyushu Univ., Fukuoka, Japan ; Hideyuki Takagi

We propose an elite synthesis optimization strategy for accelerating evolutionary computation (EC) searches using elites obtained from a lower dimensional space. The method projects individuals onto n one-dimensional spaces corresponding to each of the n searching parameter axes, approximates each landscape using Lagrange polynomial interpolation or power function least squares approximation, finds the best coordinate for the approximated shape, obtains the elite by combining the best n found coordinates, and uses the elite for the next generation of the EC. The advantage of this method is that the elite may be easily obtained thanks to their projection onto each one-dimensional space and that there is a higher possibility that the elite will be located near the global optimum. We conduct experimental tests to compare our proposed approaches with previous acceleration approaches using differential evolution and ten benchmark functions. The results demonstrate that the proposed method accelerates EC convergence significantly, especially in early generations.

Published in:

Intelligent Networking and Collaborative Systems (INCoS), 2011 Third International Conference on

Date of Conference:

Nov. 30 2011-Dec. 2 2011