🤖 AI Summary
This study addresses the high computational cost and low search efficiency commonly encountered in truss topology optimization by proposing an enhanced firefly algorithm integrated with a statistical hypothesis testing mechanism. The method leverages historical movement information of individual solutions to statistically evaluate and select potentially effective search directions, thereby avoiding redundant structural reanalyses. Without altering the original algorithmic framework, this approach significantly reduces computational overhead. Experimental results on multiple classical truss benchmark problems demonstrate that the proposed method achieves comparable solution quality while substantially decreasing the number of objective function evaluations, leading to markedly improved optimization efficiency.
📝 Abstract
This study proposes an algorithm titled a statistical firefly algorithm (SFA) for truss topology optimization. In the proposed algorithm, historical results of fireflies'motions are used in hypothesis testing to limit the motions of fireflies that are suggested by current information exchanges between fireflies only to those that are potentially useful. Hypothesis testing is applied to the mechanism of an ordinary firefly algorithm (FA) without changing its structure. As a result, the implementation of the proposed algorithm is simple and straightforward. Limiting the motions of fireflies to those that are potential useful results in reduction of firefly evaluations, and, subsequently, reduction of computational efforts. To test the validity and efficiency of the proposed algorithm, it is used to solve several truss topology optimization problems, including some benchmark problems. It is found that the added statistical strategy in the SFA significantly enhances the performance of the original FA in terms of computational efforts while still maintains the quality of the obtained results.