Abstract

PurposeThis study aims to propose a more precise method for robust design optimization of mechanical structures with black-box problems, while also considering the efficiency of uncertainty analysis.Design/methodology/approachThe method first introduces a dual adaptive chaotic flower pollination algorithm (DACFPA) to overcome the shortcomings of the original flower pollination algorithm (FPA), such as its susceptibility to poor accuracy and convergence efficiency when dealing with complex optimization problems. Furthermore, a DACFPA-Kriging model is developed by optimizing the relevant parameter of Kriging model via DACFPA. Finally, the dual Kriging model is constructed to improve the efficiency of uncertainty analysis, and a robust design optimization method based on DACFPA-Dual-Kriging is proposed.FindingsThe DACFPA outperforms the FPA, particle swarm optimization and gray wolf optimization algorithms in terms of solution accuracy, convergence speed and capacity to avoid local optimal solutions. Additionally, the DACFPA-Kriging model exhibits superior prediction accuracy and robustness contrasted with the original Kriging and FPA-Kriging. The proposed method for robust design optimization based on DACFPA-Dual-Kriging is applied to the motor hanger of the electric multiple units as an engineering case study, and the results confirm a significant reduction in the fluctuation of the maximum equivalent stress.Originality/valueThis study represents the initial attempt to enhance the prediction accuracy of the Kriging model using the improved FPA and to combine the dual Kriging model for uncertainty analysis, providing an idea for the robust optimization design of mechanical structure with black-box problem.

Full Text
Paper version not known

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.