.png){kind=icon}
.png){kind=icon}
Return
Heuristic particle elimination algorithm for efficient structural optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.compstruc.2025.107782.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This research introduces and evaluates the Heuristic Particle Elimination Optimization algorithm, a novel approach to structural design problems. The elimination strategy in this method distinguishes it from other meta-heuristic algorithms. By systematically discarding solutions with higher objective values, the algorithm focuses its search on the most promising regions of the solution space. This targeted approach proves advantageous in discrete optimization problems, where the solution space consists of predefined discrete values. Focusing on optimizing cross-sectional areas of structural elements, the algorithm minimizes structural weight while adhering to constraints on deflections, stresses, and permissible sections. Five benchmark examples, including both planar and spatial truss structures with varying numbers of bars, serve as comprehensive test cases. Through rigorous comparative analyses with established optimization methods, the results highlight the algorithm's efficiency in achieving optimal solutions, emphasizing its convergence speed and solution accuracy. Its adaptability to both discrete and continuous variable scenarios makes it a promising tool for real-world structural design challenges.
Keywords:
Discrete optimization
Structural optimization
Metaheuristic algorithms
Truss structures
Optimization algorithms
Constrained optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.8
Papers:
6.2K
Citations:
1.7W