By Topic

Genetic algorithms. Simulating nature's methods of evolving the best design solution

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
$33 $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)
C. Z. Janikow ; Missouri Univ., St. Louis, MO, USA ; D. St. Clair

Gradually, problem solving becoming dynamic agents interacting with the surrounding world rather than by isolated operations. Some methods are coming from nature, where organisms both cooperate and compete for environmental resources. This has led to the design of algorithms which simulate these natural processes. The genetic algorithm (GA) represents one of the most successful approaches. Genetic algorithms are adaptive search methods that simulate natural processes such as: selection, information inheritance, random mutation, and population dynamics. At first, GAs were most applicable to numerical parameter optimizations due to an easy mapping from the problem to representation space. Today they find more and more general applications thanks to: (1) understanding better the necessary properties of the required mapping, and (2) new ways to process problem constraints

Published in:

IEEE Potentials  (Volume:14 ,  Issue: 1 )