By Topic

A continuous age model of genetic algorithms applicable to optimization problems with uncertainties

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

4 Author(s)
Tanooka, K. ; Graduate Sch. of Sci. & Technol., Kobe Univ., Japan ; Tamaki, H. ; Abe, S. ; Kitamura, S.

We study a method of optimum seeking in an uncertain environment by extending the conventional genetic algorithms. So far, we have extended genetic algorithms by introducing an age structure, where the key point is to evaluate an individual not directly by an objective value of a corresponding solution currently observed, but by accumulating values which have been observed at preceding generations. We newly introduce a continuous age model of genetic algorithms to accumulate the values adequately. Then, the effectiveness of the proposed method is investigated through some computational experiments. As a result, it has been shown that the stability is higher and the possibility of falling into local optimum is lower in using the new age model than in using the former one

Published in:

Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on  (Volume:1 )

Date of Conference: