16 Genetic Algorithms for Optimum Design

Upon completion of this chapter, you will be able to:

9 Explain basic concepts and terminology associated with genetic algorithms
9 Explain basic steps of a genetic algorithm
9 Use a software based on genetic algorithm to solve your optimum design problem

Genetic algorithms (GA) belong to the class of stochastic search optimization methods,
such as simulated annealing method described in Chapter 15. As you get to know basics of
the algorithms, you will see that decisions made in most computational steps of the algo-
rithms are based on random number generation. The algorithms use only the function values
in the search process to make progress toward a solution without regard to how the functions
are evaluated. Continuity or differentiability of the problem functions is neither required nor
used in calculations of the algorithms. Therefore, the algorithms are very general and can be
applied to all kinds of problems--discrete, continuous, and nondifferentiable. In addition,
the methods determine global optimum solutions as opposed to the local solutions determined
by a continuous variable optimization algorithm. The methods are easy to use and program
since they do not require use of gradients of cost or constraint functions. Drawbacks of the
algorithms are that (1) they require a large amount of calculation for even reasonable size
problems, or for problems where evaluation of functions itself requires massive calculation,
and (2) there is no absolute guarantee that a global solution has been obtained. The first draw-
back can be overcome to some extent by the use of massively parallel computers. The second
drawback can be overcome to some extent by executing the algorithm several times and
allowing it to run longer.
In the remaining sections of this chapter, concepts and terminology associated with genetic
algorithms are defined and explained. Fundamentals of the algorithm are presented and
explained. Although the algorithm can be used for continuous problems, our focus will be
on discrete variable optimization problems. Various steps of a genetic algorithm are described
that can be implemented in different ways. Most of the material for this chapter is derived
from the work of the author and his coworkers and is introductory in nature (Arora et al.,
1994; Huang and Arora, 1997; Huang et al., 1997; Arora, 2002). Numerous other good ref-

531