By Topic

A general evolutionary algorithm and its property analysis

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

2 Author(s)
Gang Li ; Coll. of Comput., Shanghai Univ., China ; Fu Tong

EP (evolutionary programming), ES (evolutionary strategy) and GA (genetic algorithm) are three approaches of optimization inspired by the natural evolution process; they are essentially much more in common in terms of computing models and algorithms. A general evolutionary algorithm is proposed and its convergence properties are analyzed. It is claimed that if there exist some quasi-stable states under a design strategy, the algorithm will definitely converge on one of those states.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:2 )

Date of Conference:

14-17 May 2000