Abstract
Abstract Although structural topology optimization, as a discrete optimization problem, has been successfully solved several times in the literature using evolutionary algorithms (EAs), the two key difficulties lie in generating geometrically feasible structures and handling a high computation time. These two challenges are addressed in this paper by adopting triangular representation for two-dimensional continuum structures, related crossover and mutation operators, and by performing computations in parallel on the graphics processing unit (GPU). Two case studies are solved on the GPU that show 5× of speedup over CPU implementation. The parametric study on the population size of EA shows that the approximate Pareto-optimal solutions can be evolved using a small population with the proposed EA operators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
