Implementing The Multi Expression Programming, Nonlinear Regression, Artificial Neural Network, and M5P-Tree Models to Predict The Long-Term of Compressive Strength of Cement- Mortar Modified With Fly Ash

In the recent decade, supplementary cementing ingredients have become an essential part of various strength ranges of concrete and cement-mortar mix design. Examples are natural materials, by-products, industrial wastes, and materials that require less energy and time to generate. Fly ash is one of the most widely utilized additional cementing ingredients. Fly ash is a by-product substance produced by coal combustion. It's being used in cement mortar and concrete as a pozzolanic substance. It has demonstrated significant influence in improving liquid and solid properties of cement mortar, such as compressive strength. Multi Expression Programming (MEP) is employed in this study to estimate the compressive strength (CS) of cement mortar modified with fly ash. The outcomes of this model were compared and evaluated with several other models such as the Nonlinear Regression model (NLR), Artificial Neural Network (ANN), and M5P-tree models that have been used in the construction fields. The input parameters included water/cement ratio (w/c), curing time (t days), and fly ash content (FA %), while the target property was compressive strength up to 360 days of curing. Four hundred fifty (450) data are collected from previous literature on modifying cement mortar with fly ash for that purpose. The water/cement ratio ranged from 0.24 to 1.2, and the fly ash was used to replace cement up to 55% (%wt. of dry cement). Based on the Coefficient of Determination (R2), Root Mean Squared Error (RMSE), Scatter Index (SI), Objective (OBJ), Mean Absolute Error (MAE), t-test value, the uncertainty of 95%, Performance Index (ρ), and boxplot for actual and predicted compressive strength. The MEP model performed better than other developed models according to evaluation tools. The compressive strength was also correlated with flexural and splitting tensile strengths using different nonlinear models.

Forecasting Strength of CFRP Confined Concrete Using Multi Expression Programming

This study provides the application of a machine learning-based algorithm approach names “Multi Expression Programming” (MEP) to forecast the compressive strength of carbon fiber-reinforced polymer (CFRP) confined concrete. The suggested computational Multiphysics model is based on previously reported experimental results. However, critical parameters comprise both the geometrical and mechanical properties, including the height and diameter of the specimen, the modulus of elasticity of CFRP, unconfined strength of concrete, and CFRP overall layer thickness. A detailed statistical analysis is done to evaluate the model performance. Then the validation of the soft computational model is made by drawing a comparison with experimental results and other external validation criteria. Moreover, the results and predictions of the presented soft computing model are verified by incorporating a parametric analysis, and the reliability of the model is compared with available models in the literature by an experimental versus theoretical comparison. Based on the findings, the valuation and performance of the proposed model is assessed with other strength models provided in the literature using the collated database. Thus the proposed model outperformed other existing models in term of accuracy and predictability. Both parametric and statistical analysis demonstrate that the proposed model is well trained to efficiently forecast strength of CFRP wrapped structural members. The presented study will promote its utilization in rehabilitation and retrofitting and contribute towards sustainable construction material.

Multi Expression Programming

Multi Expression Programming (MEP) is a new evolutionary paradigm intended for solving computationally difficult problems. MEP individuals are linear entities that encode complex computer programs. MEP chromosomes are represented in the same way as C or Pascal compilers translate mathematical expressions into machine code. MEP is used for solving some difficult problems like symbolic regression and game strategy discovering. MEP is compared with Gene Expression Programming (GEP) and Cartesian Genetic Programming (CGP) by using several well-known test problems. For the considered problems MEP outperforms GEP and CGP. For these examples MEP is two magnitude orders better than CGP.

Multi Expression Programming - an in-depth description

Multi Expression Programming (MEP) is a Genetic Programming variant that uses a linear representation of chromosomes. MEP individuals are strings of genes encoding complex computer programs. When MEP individuals encode expressions, their representation is similar to the way in which compilers translate C or Pascal expressions into machine code. A unique MEP feature is the ability to store multiple solutions to a problem in a single chromosome. Usually, the best solution is chosen for fitness assignment. When solving symbolic regression or classification problems (or any other problems for which the training set is known before the problem is solved) MEP has the same complexity as other techniques storing a single solution in a chromosome (such as GP, CGP, GEP, or GE). Evaluation of the expressions encoded into an MEP individual can be performed by a single parsing of the chromosome. Offspring obtained by crossover and mutation is always syntactically correct MEP individuals (computer programs). Thus, no extra processing for repairing newly obtained individuals is needed.

Multi Expression Programming

Multi Expression Programming (MEP) is a new evolutionary paradigm intended for solving computationally difficult problems. MEP individuals are linear entities that encode complex computer programs. MEP chromosomes are represented in the same way as C or Pascal compilers translate mathematical expressions into machine code. MEP is used for solving some difficult problems like symbolic regression and game strategy discovering. MEP is compared with Gene Expression Programming (GEP) and Cartesian Genetic Programming (CGP) by using several well-known test problems. For the considered problems MEP outperforms GEP and CGP. For these examples MEP is two magnitude orders better than CGP.

Regresión Simbólica aplicada a la Predicción del Consumo Eléctrico a Corto Plazo en el Nivel de Subestación

El modelado de datos es un problema fundamental en diversas áreas del conocimiento. La Regresión Simbólica es una técnica que permite encontrar una relación matemática para describir un conjunto de datos experimentales. A diferencia de los métodos tradicionales de modelado, la Programación Genética permite encontrar una expresión matemática susceptible de ser analizada e interpretada. Multi-Expression Programming es una variante de Programación Genética, que presenta múltiples ventajas, haciéndola apta para su uso en casos reales. En este trabajo proponemos aplicar dicha variante para descubrir modelos de predicción, un día hacia adelante, del consumo eléctrico de subestación transformadora en Tucumán, Argentina. Para analizar el comportamiento del algoritmo y ajustar parámetros, se realizaron pruebas utilizando Benchmarks conocidos. Se concluye que Multi-Expression Programming es adecuada para encontrar modelos en problemas complejos, y en el caso de predicción de consumo eléctrico se logró un nivel de error similar al obtenido con otras técnicas.