Scribd
Upload
20 views1 page

Radar 4

Uploaded by

Sanju
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views1 page

Radar 4

Uploaded by

Sanju
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

The GA is a search optimization tool.

Given some objective function, it will search for possible


solutions to a problem that come as close as possible to your objective. The GA is inspired by nature and
is based on the biological aspect of reproduction and survival of the fittest. This genetic modeling of
the problem with a population of possible solutions that produces subsequent generations of solutions
can eventually arrive at a highly optimized result. GAs are very flexible in that they can handle highly
non-linear systems and generally are not constrained by the type of problem they are trying to solve
(although the there may be constraints on the solutions they produce). This allows them to work pretty
well for a wide range of problems.
The genetic algorithm itself is highly customizable, and numerous approaches for the different
algorithm components have been developed over the years. These approaches include algorithms for
initialization, selection, crossover, mutation and termination. One of the most important aspects of
the GA is the objective function, which is used to evaluate how well a particular solution performs.
This function is unique to the problem being solved, because it is in effect the definition of the
problem. While it is possible to treat a GA as a black box and use whatever the default algorithms are,
the objective function must be defined by the user. This is reflected in many of the articles presented
here where a large amount of detail was given for the objective function, but much less was provided
for how the rest of the GA was configured. Other more advanced options such as elitism and hall of
fame ensure that the best solutions found during the progression of the algorithm persist until the end.
As a local optimization tool, the genetic algorithm has been utilized in large variety of applications.
In architectural design, GAs have been applied to evaluate and predict the energy consumption of
designs [9] and optimize designs with regards to energy rating [10]. GAs have been used in molecular
modeling to understand receptor sites to improve drug design [11] and to determine the structure of
an atomic cluster, which has the lowest energy [12]. GAs have even been applied to their biological
inspiration to analyze phylogenetic trees [13].

You might also like