By Topic

Introduction to evolutionary computing techniques

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

There is a tremendous interest in the development of the theory and applications of evolutionary computing techniques both in industry and universities. Evolutionary computation is the name given to collection of algorithms based on the evolution of a population towards a solution of a certain problem. These algorithms are used successfully in many applications requiring the optimization of a certain multidimensional function. The population of possible solutions evolves from one generation to the next, ultimately arriving at a satisfactory solution to the problem. These algorithms differ in the way a new population is generated from the present one and in the way the members are represented within the algorithm. Three types of evolutionary computing techniques are widely reported recently. These are genetic algorithms (GAs), genetic programming (GP) and evolutionary algorithms (EAs). The EAs can be divided into evolutionary strategies (ES) and evolutionary programming (EP). All three of these algorithms in some way are modelled after the evolutionary processes occurring in nature

Published in:

Electronic Technology Directions to the Year 2000, 1995. Proceedings.

Date of Conference:

23-25 May 1995