ADVANCES OF GENETIC ALGORITHMS IN STRUCTURAL OPTIMIZATION

As a newly developed algorithm, the genetic algorithm, arose from the theory of evolution and genetics. It is of globalconvergence and parallelism. Now it has become an important partof computation intelligence. The paper briefly introduces the procedure of simple genetic algorithm and its mathematical foundation. Some developments and evaluations of encoding, convergence and operators are discussed in details. The constraint handling and the choice of fitness function are analyzed. Some suggestions for further research are given.