z-logo
open-access-imgOpen Access
Prediction of the Compressive Strength of Concrete Admixed with Metakaolin Using Gene Expression Programming
Author(s) -
Oluwatobi O. Akin,
Amana Ocholi,
Olugbenga Samuel Abejide,
Johnson A. Obari
Publication year - 2020
Publication title -
advances in civil engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.379
H-Index - 25
eISSN - 1687-8094
pISSN - 1687-8086
DOI - 10.1155/2020/8883412
Subject(s) - metakaolin , gene expression programming , compressive strength , curing (chemistry) , aggregate (composite) , materials science , cement , genetic programming , composite material , mathematics , structural engineering , computer science , engineering , machine learning
One of the problems of optimization of concrete is to formulate a mathematical equation that shows the relationship between the various constituents of concrete and its properties. In this work, modelling of the compressive strength of concrete admixed with metakaolin was carried out using the Gene Expression Programming (GEP) algorithm. The dataset from laboratory experimentation was used for the analysis. The mixture proportions were made of three different water/binder ratios (0.4, 0.5, and 0.6), and the grades of concrete produced were grade M15 and M20. The compressive strength of the concrete was determined after 28 days of curing. The parameters used in the GEP algorithm are the input variables which include cement content, water, metakaolin content, and fine and coarse aggregate, while the response was designated as the compressive strength. The model was trained and tested using the parameters. The R-square value from the GEP algorithm was compared with the use of conventional stepwise regression analysis. With a coefficient of determination (R-square value) of 0.95, the GEP algorithm has shown to be a good alternative for modelling concrete compressive strength.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here