Journal of Northeastern University ›› 2004, Vol. 25 ›› Issue (7): 689-691.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Genetic algorithm in compound form for structural optimization with discrete variables

Zhu, Chao-Yan (1); Liu, Bin (1); Zhang, Yan-Nian (1); Guo, Peng-Fei (2)   

  1. (1) Sch. of Resources and Civil Eng., Northeastern Univ., Shenyang 110004, China; (2) Dept. of Civil Eng., Liaoning Inst. of Technol., Jinzhou 121001, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2004-07-15 Published:2013-06-24
  • Contact: Zhu, C.-Y.
  • About author:-
  • Supported by:
    -

Abstract: An approach for the generation of initial point is proposed for discrete compound form. In view of the theory of imitative full-stress, the optimization results of discrete compound form are searched further, so as to improve fully the local searching capability of discrete compound form. A compound form operator is imbedded in genetic algorithm so as to improve the local searching capability of genetic algorithm to make up for the shortage of genetic algorithm. The operation of standard genetic algorithm is also improved, e.g., a high cross rate is taken in the early stage of evolution to pick out the best individual as fast as possible with a high mutation rate taken for the worst individual to approach to optimal solution. A hybrid genetic algorithm is set up for structural optimization with discrete variables. The results by exemplification show that the hybrid genetic algorithm, as an efficient optimal method having the advantages of both standard genetic algorithm and improved compound form approach without their disadvantages, is superior to either one.

CLC Number: