Numerical and artificial intelligence based investigation on the development of design guidelines for pultruded GFRP RHS profiles subjected to web crippling

Abstract

Abstract This article presents a numerical and artificial intelligence (AI) based investigation on the web crippling performance of pultruded glass fiber reinforced polymers’ (GFRP) rectangular hollow section (RHS) profiles subjected to interior-one-flange (IOF) loading conditions. To achieve the desired research objectives, a finite element based computational model was developed using one of the popular simulating software ABAQUS CAE. This model was then validated by utilizing the results reported in experimental investigation-based article of Chen and Wang. Once the finite element model was validated, an extensive parametric study was conducted to investigate the aforementioned phenomenon on the basis of which a comprehensive, universal, and coherent database was assembled. This database was then used to formulate the design guidelines for the web crippling design of pultruded GFRP RHS profiles by employing AI based gene expression programming (GEP). Based on the findings of numerical investigation, the web crippling capacity of abovementioned structural profiles subjected to IOF loading conditions was found to be directly related to that of section thickness and bearing length whereas inversely related to that of section width, section height, section’s corner radii, and profile length. On the basis of the findings of AI based investigation, the modified design rules proposed by this research were found to be accurately predicting the web crippling capacity of aforesaid structural profiles. This research is a significant contribution to the literature on the development of design guidelines for pultruded GFRP RHS profiles subjected to web crippling, however, there is still a lot to be done in this regard before getting to the ultimate conclusions.

Keywords

• Design guidelines
• Web crippling
• Pultruded GFRP RHS
• Numerical investigation
• Gene expression programming