Hybrid multi-objective shape design optimization using Taguchi's method and genetic algorithm


Yildiz A. R., Ozturk N., KAYA N., ÖZTÜRK F.

STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, cilt.34, sa.4, ss.317-332, 2007 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 34 Sayı: 4
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1007/s00158-006-0079-x
  • Dergi Adı: STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.317-332
  • Anahtar Kelimeler: shape optimization, Taguchi's method, genetic algorithms, multi-objective optimization, TOPOLOGY OPTIMIZATION, STRUCTURAL OPTIMIZATION, NEURAL-NETWORK, SEARCH
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

This research is based on a new hybrid approach, which deals with the improvement of shape optimization process. The objective is to contribute to the development of more efficient shape optimization approaches in an integrated optimal topology and shape optimization area with the help of genetic algorithms and robustness issues. An improved genetic algorithm is introduced to solve multi-objective shape design optimization problems. The specific issue of this research is to overcome the limitations caused by larger population of solutions in the pure multi-objective genetic algorithm. The combination of genetic algorithm with robust parameter design through a smaller population of individuals results in a solution that leads to better parameter values for design optimization problems. The effectiveness of the proposed hybrid approach is illustrated and evaluated with test problems taken from literature. It is also shown that the proposed approach can be used as first stage in other multi-objective genetic algorithms to enhance the performance of genetic algorithms. Finally, the shape optimization of a vehicle component is presented to illustrate how the present approach can be applied for solving multi-objective shape design optimization problems.