Abstract

In modern architecture, the structural safety of buildings largely depends on the compressive strength of high-performance concrete (HPC), which is determined by the complex nonlinear relationships between its components. In order to more accurately forecast HPC’s compressive strength, this paper proposes a prediction model based on an improved dung beetle optimization algorithm (OTDBO)-optimized backpropagation neural network (BPNN). Extreme Gradient Boosting (XGBoost) is employed to determine the inputs for the BPNN, enhancing the computational efficiency under high-dimensional data feature conditions. To address the issues of local optima entrapment and slow convergence in the dung beetle optimization algorithm (DBO), four improvements were made to enhance its performance. In the initial population generation stage, the optimal Latin hypercube method was used to increase the population diversity. In the rolling stage, the osprey optimization algorithm’s global exploration strategy was introduced to improve the global search capability. The variable spiral search strategy was employed in the reproduction stage, and an adaptive t-distribution perturbation strategy was combined in the foraging stage to enhance the algorithm’s adaptability and search efficiency. The improved dung beetle optimization algorithm (OTDBO) outperformed other algorithms in performance tests on the CEC2017 benchmark functions. In terms of predicting the compressive strength of HPC, the XG-OTDBO-BP model developed in this study outperformed models optimized by other algorithms in terms of fitting outcomes and prediction accuracy. These findings support the XG-OTDBO-BP model’s superiority in the compressive strength of HPC prediction.

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 call

Disclaimer: 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.