By Topic

Global optimisation by evolutionary algorithms

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

1 Author(s)
Xin Yao ; Sch. of Comput. Sci., New South Wales Univ., Canberra, ACT, Australia

Evolutionary algorithms (EAs) are a class of stochastic search algorithms which are applicable to a wide range of problems in learning and optimisation. They have been applied to numerous problems in combinatorial optimisation, function optimisation, artificial neural network learning, fuzzy logic system learning, etc. This paper first introduces EAs and their basic operators. Then, an overview of three major branches of EAs, i.e. genetic algorithms (GAs), evolutionary programming (EP) and evolution strategies (ESs), is given. Different search operators and selection mechanisms are described. The emphasis of the discussion is on global optimisation by EAs. The paper also presents three simple models for parallel EAs. Finally, some open issues and future research directions in evolutionary optimisation and evolutionary computation in general are discussed

Published in:

Parallel Algorithms/Architecture Synthesis, 1997. Proceedings., Second Aizu International Symposium

Date of Conference:

17-21 Mar 1997