By Topic

Comments on "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. I. Basic properties of selection and mutation" [with reply]

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)
Yong Gao ; Inst. for Inf. & Syst. Sci., Xi'an Jiaotong Univ., China ; Xiaofeng Qi ; Palmieri, F.

In this paper, Gao points out two crucial errors in the proof of the theorem on the convergence of genetic algorithms (GAs) in the above paper by Qi-Palmieri (ibid., vol.5 (1994)). He presents two counter examples and comments that the errors may cause misleading on the convergence nature of GAs. He demonstrates that the sequence of mutation probabilities that increases the probability mass of the average set does not necessarily increase the mean fitness. In reply, Qi-Palmieri points out that the Theorem 3 simply states that it is possible to find a sequence of mutation densities that still guarantees convergence. The proof of Theorem 3 may be incomplete, but the result is unquestionably solid. They conclude that Gao's counterexamples may not add much insight into the nature of the problem, and they would rather encourage constructive contributions to the difficult, still open problems of the evolutionary paradigm.

Published in:

Neural Networks, IEEE Transactions on  (Volume:9 ,  Issue: 2 )