PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 2, 2026Archives of Civil and Mechanical Engineering0 citationsOpen Access

Structural topology optimization using an enhanced and robust genetic algorithm

View Full Paper
XWXingjian WangCNClay J. NaitoJFJohn T. Fox

Key Points

  • The aim is to enhance the performance of topology optimization using a refined genetic algorithm to produce more stable and efficient results.
  • Proposed an enhanced genetic algorithm tailored for topology optimization.
  • Introduced a strong shape constraint to filter out impractical topologies early.
  • Utilized finite element analyses in multiple-input genetic operators to inform mutation and reproduction.
  • Achieved high robustness with a negligible probability of convergence to impractical shapes.
  • Reduced computational cost by 50% compared to traditional methods.
  • Expedited convergence rates leading to refined shapes suitable for manufacturing.

Abstract

Abstract Topology optimization (TO) with genetic algorithm (GA) is a bio-inspired heuristic optimization technique. In practical applications, it suffers from unstable results, a large number of redundant computations, and low convergence rates. To address this issue, an improved GA, specifically tailored to TO by introducing a strong shape constraint and enriched information obtained from the embedded finite element analyses, is proposed in this study. The strong shape constraint adds a filter to all the individuals at the beginning of each iteration to prevent the analysis of topologies that would not lead to feasible structures. Meanwhile, multiple-input genetic operators leverage additional information from the finite element analyses to guide the mutation and reproduction process, accelerating the convergence rate to the optimal shape. Three case studies present the contributions of the proposed algorithm in terms of robustness, efficiency, and refinement compared to conventional GAs and the Solid Isotropic Material with Penalization (SIMP) method. The results show that the proposed algorithm achieves high robustness and the probability of convergence to impractical shapes is negligible, the computational cost is reduced to one half, the convergence is expedited (compared to conventional GAs), and a refined shape can be obtained and manufactured.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Wang et al. (2026) studied this question.

synapsesocial.com/papers/6980fecbc1c9540dea811328https://doi.org/10.1007/s43452-025-01400-6
Ask AI
Helpful
Bookmark
Share
View Full Paper