Rapid Prototype Development Approach for Genetic Programming

Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of genetic operators, evolutionary controls and implementations of heuristic strategy, evaluations and other mechanisms. When designing genetic operators, it is necessary to consider the possible limitations of encoding methods of individuals. And when selecting evolutionary control strategies, it is also necessary to balance search efficiency and diversity based on representation characteristics as well as the problem itself. More importantly, all of these matters, among others, have to be implemented through tedious coding work. Therefore, GP development is both complex and time-consuming. To overcome some of these difficulties that hinder the enhancement of GP development efficiency, we explore the feasibility of mutual assistance among GP variants, and then propose a rapid GP prototyping development method based on πGrammatical Evolution (πGE). It is demonstrated through regression analysis experiments that not only is this method beneficial for the GP developers to get rid of some tedious implementations, but also enables them to concentrate on the essence of the referred problem, such as individual representation, decoding means and evaluation. Additionally, it provides new insights into the roles of individual delineations in phenotypes and semantic research of individuals.

Application of numerical modeling and genetic programming to estimate rock mass modulus of deformation

Estimation of the rock mass modulus of deformation(Em)is one of the most important design parameters in designing many structures in and on rock.This parameter can be obtained by in situ tests,empirical relations between deformation modulus and rock mass classifcation,and estimating from laboratory tests results.In this paper,a back analysis calculation is performed to present an equation for estimation of the rock mass modulus of deformation using genetic programming(GP)and numerical modeling.A database of 40,960 datasets,including vertical stress(rz),horizontal to vertical stresses ratio(k),Poisson’s ratio(m),radius of circular tunnel(r)and wall displacement of circular tunnel on the horizontal diameter(d)for input parameters and modulus of deformation for output,was established.The selected parameters are easy to determine and rock mass modulus of deformation can be obtained from instrumentation data of any size circular galleries.The resulting RMSE of 0.86 and correlation coeffcient of97%of the proposed equation demonstrated the capability of the computer program(CP)generated by GP.

Linear-in-Parameter Models Based on Parsimonious Genetic Programming Algorithm and Its Application to Aero-Engine Start Modeling

A novel Parsimonious Genetic Programming （PGP） algorithm together with a novel aero-engine optimum data-driven dynamic start process model based on PGP is proposed. In application of this method, first, the traditional Genetic Programming（GP） is used to generate the nonlinear input-output models that are represented in a binary tree structure; then, the Orthogonal Least Squares algorithm （OLS） is used to estimate the contribution of the branches of the tree （refer to basic function term that cannot be decomposed anymore according to special rule） to the accuracy of the model, which contributes to eliminate complex redundant subtrees and enhance GP＇s convergence speed; and finally, a simple, reliable and exact linear-in-parameter nonlinear model via GP evolution is obtained. The real aero-engine start process test data simulation and the comparisons with Support Vector Machines （SVM） validate that the proposed method can generate more applicable, interpretable models and achieve comparable, even superior results to SVM.

Genetic Programming Approach for Predicting Surface Subsidence Induced by Mining

The surface subsidence induced by mining is a complex problem, which is related with many complex and uncertain factors. Genetic programming （GP） has a good ability to deal with complex and nonlinear problems, therefore genetic programming approach is propesed to predict mining induced surface subsidence in this article. First genetic programming technique is introduced, second, surface subsidence genetic programming model is set up by selecting its main affective factors and training relating to practical engineering data, and finally, predictions are made by the testing of data, whose results show that the relative error is approximately less than 10%, which can meet the engineering needs, and therefore, this proposed approach is valid and applicable in predicting mining induced surface subsidence. The model offers a novel method to predict surface subsidence in mining.

A High Precision Comprehensive Evaluation Method for Flood Disaster Loss Based on Improved Genetic Programming

Precise comprehensive evaluation of flood disaster loss is significant for the prevention and mitigation of flood disasters. Here, one of the difficulties involved is how to establish a model capable of describing the complex relation between the input and output data of the system of flood disaster loss. Genetic programming (GP) solves problems by using ideas from genetic algorithm and generates computer programs automatically. In this study a new method named the evaluation of the grade of flood disaster loss (EGFD) on the basis of improved genetic programming (IGP) is presented (IGP-EGFD). The flood disaster area and the direct economic loss are taken as the evaluation indexes of flood disaster loss. Obviously that the larger the evaluation index value, the larger the corresponding value of the grade of flood disaster loss is. Consequently the IGP code is designed to make the value of the grade of flood disaster be an increasing function of the index value. The result of the application of the IGP-EGFD model to Henan Province shows that a good function expression can be obtained within a bigger searched function space; and the model is of high precision and considerable practical significance. Thus, IGP-EGFD can be widely used in automatic modeling and other evaluation systems.

A predictive equation for residual strength using a hybrid of subset selection of maximum dissimilarity method with Pareto optimal multi-gene genetic programming

More accurate and reliable estimation of residual strength friction angle(/r)of clay is crucial in many geotechnical engineering applications,including riverbank stability analysis,design,and assessment of earthen dam slope stabilities.However,a general predictive equation for/r,with applicability in a wide range of effective parameters,remains an important research gap.The goal of this study is to develop a more accurate equation for/r using the Pareto Optimal Multi-gene Genetic Programming(POMGGP)approach by evaluating a comprehensive dataset of 290 experiments compiled from published literature databases worldwide.A new framework for integrated equation derivation proposed that hybridizes the Subset Selection of Maximum Dissimilarity Method(SSMD)with Multi-gene Genetic Programming(MGP)and Pareto-optimality(PO)to find an accurate equation for/r with wide range applicability.The final predictive equation resulted from POMGGP modeling was assessed in comparison with some previously published machine learning-based equations using statistical error analysis criteria,Taylor diagram,revised discrepancy ratio(RDR),and scatter plots.Base on the results,the POMGGP has the lowest uncertainty with U95=2.25,when compared with Artificial Neural Network(ANN)(U95=2.3),Bayesian Regularization Neural Network(BRNN)(U95=2.94),Levenberg-Marquardt Neural Network(LMNN)(U95=3.3),and Differential Evolution Neural Network(DENN)(U95=2.37).The more reliable results in estimation of/r derived by POMGGP with reliability 59.3%,and resiliency 60%in comparison with ANN(reliability=30.23%,resiliency=28.33%),BRNN(reliability=10.47%,resiliency=10.39%),LMNN(reliability=19.77%,resiliency=20.29%)and DENN(reliability=27.91%,resiliency=24.19%).Besides the simplicity and ease of application of the new POMGGP equation to a broad range of conditions,using the uncertainty,reliability,and resilience analysis confirmed that the derived equation for/r significantly outperformed other existing machine learning methods,including the ANN,BRNN,LMNN,and DENN equations。

Defocus Blur Segmentation Using Genetic Programming and Adaptive Threshold

Detection and classification of the blurred and the non-blurred regions in images is a challenging task due to the limited available information about blur type,scenarios and level of blurriness.In this paper,we propose an effective method for blur detection and segmentation based on transfer learning concept.The proposed method consists of two separate steps.In the first step,genetic programming(GP)model is developed that quantify the amount of blur for each pixel in the image.The GP model method uses the multiresolution features of the image and it provides an improved blur map.In the second phase,the blur map is segmented into blurred and non-blurred regions by using an adaptive threshold.A model based on support vector machine(SVM)is developed to compute adaptive threshold for the input blur map.The performance of the proposed method is evaluated using two different datasets and compared with various state-of-the-art methods.The comparative analysis reveals that the proposed method performs better against the state-of-the-art techniques.

Genetic programming-based chaotic time series modeling

This paper proposes a Genetic Programming-Based Modeling (GPM) algorithm on chaotic time series. GP is used here to search for appropriate model structures in function space, and the Particle Swarm Optimization (PSO) algorithm is used for Nonlinear Parameter Estimation (NPE) of dynamic model structures. In addition, GPM integrates the results of Nonlinear Time Series Analysis (NTSA) to adjust the parameters and takes them as the criteria of established models. Experiments showed the effectiveness of such improvements on chaotic time series modeling.

Efficient Graph-based Genetic Programming Representation with Multiple Outputs

In this work, we explore and study the implication of having more than one output on a genetic programming （GP） graph-representation. This approach, called multiple interactive outputs in a single tree （MIOST）, is based on two ideas. First, we defined an approach, called interactivity within an individual （IWI）, which is based on a graph-GP representation. Second, we add to the individuals created with the IWI approach multiple outputs in their structures and as a result of this, we have MIOST. As a first step, we analyze the effects of IWI by using only mutations and analyze its implications （i.e., presence of neutrality）. Then, we continue testing the effectiveness of IWI by allowing mutations and the standard GP crossover in the evolutionary process. Finally, we tested the effectiveness of MIOST by using mutations and crossover and conducted extensive empirical results on different evolvable problems of different complexity taken from the literature. The results reported in this paper indicate that the proposed approach has a better overall performance in terms of consistency reaching feasible solutions.

Multi-gene genetic programming extension of AASHTO M-E for design oflow-volume concrete pavements

The American Association of State Highway and Transportation Officials Mechanistic-Empirical Pavement DesignGuide (AASHTO M-E) offers an opportunity to design more economical and sustainable high-volume rigid pavementscompared to conventional design guidelines. It is achieved through optimizing pavement structural andthickness design under specified climate and traffic conditions using advanced M-E principles, thereby minimizingeconomic costs and environmental impact. However, the implementation of AASHTO M-E design for low-volumeconcrete pavements using AASHTOWare Pavement ME Design (Pavement ME) software is often overly conservative.This is because Pavement ME specifies the minimum design thickness of concrete slab as 152.4 mm (6 in.). Thispaper introduces a novel extension of the AASHTO M-E framework for the design of low-volume joint plain concretepavements (JPCPs) without modification of Pavement ME. It utilizes multi-gene genetic programming (MGGP)-based computational models to obtain rapid solutions for JPCP damage accumulation and long-term performanceanalyses. The developed MGGP models simulate the fatigue damage and differential energy accumulations. Thispermits the prediction of transverse cracking and joint faulting for a wide range of design input parameters and axlespectrum. The developed MGGP-based models match Pavement ME-predicted cracking and faulting for rigidpavements with conventional concrete slab thicknesses and enable rational extrapolation of performance predictionfor thinner JPCPs. This paper demonstrates how the developed computational model enables sustainable lowvolumepavement design using optimized ME solutions for Pittsburgh, PA, conditions.

Point-Tree Structure Genetic Programming Method for Discontinuous Function's Regression

A new point-tree data structure genetic programming (PTGP) method is proposed. For the discontinuous function regression problem, the proposed method is able to identify both the function structure and discontinuities points simultaneously. It is also easy to be used to solve the continuous function's regression problems. The numerical experiment results demonstrate that the point-tree GP is an efficient alternative way to the complex function identification problems.

Modeling Dynamic Systems by Using the Nonlinear Difference Equations Based on Genetic Programming

When acquaintances of a model are little or the model is too complicate to build by using traditional time series methods, it is convenient for us to take advantage of genetic programming (GP) to build the model. Considering the complexity of nonlinear dynamic systems, this paper proposes modeling dynamic systems by using the nonlinear difference e-quation based on GP technique. First it gives the method, criteria and evaluation of modeling. Then it describes the modeling algorithm using GP. Finally two typical examples of time series are used to perform the numerical experiments. The result shows that this algorithm can successfully establish the difference equation model of dynamic systems and its predictive result is also satisfactory.

Evolutionary Design of Fault-Tolerant Digital Circuit Based on Cartesian Genetic Programming

In many areas, reliability of the digital circuits has become the key factor to restrict circuit development. Fault-tolerant design is the commonly used method to improve the reliability of digital circuits. The current fault-tolerant design methods are based on triple modular redundancy( TMR) or multiple modular redundancy( MMR). These redundancy designs rely on the experience of the designers,and the designed circuits have poor adaptabilities to a complex environment. However, evolutionary design of digital circuits does not rely on prior knowledge. During the evolution, some novel and optimal circuit topologies can be found, and the evolved circuits can feature strong adaptive capacities. Based on Cartesian genetic programming( CGP), a novel method for designing fault-tolerant digital circuits by evolution is proposed,key steps of the evolution are introduced,influences of function sets on evolution are investigated,and as a preliminary result,an evolved full adder with high fault-tolerance is shown.

Application of Genetic Programming in Predicting Infinite Dilution Activity Coefficients of Organic Compounds in Water

In this paper, we calculated 37 structural descriptors of 174 organic compounds. The 154 molecules were used to derive quantitative structure - infinite dilution activity confficient relationship by genetic programming, the other 20 compounds were used to test the model. The result showed that molecular partition property and three-dimensional structural descriptors have significant influence on the infinite dilution activity coefficients.

Estimation of hydraulic jump on corrugated bed using artificial neural networks and genetic programming

Artificial neural networks （ANNs） and genetic programming （GP） have recently been used for the estimation of hydraulic data. In this study, they were used as alternative tools to estimate the characteristics of hydraulic jumps, such as the free surface location and energy dissipation. The dimensionless hydraulic parameters, including jump depth, jump length, and energy dissipation, were determined as functions of the Froude number and the height and length of corrugations. The estimations of the ANN and GP models were found to be in good agreement with the measured data. The results of the ANN model were compared with those of the GP model, showing that the proposed ANN models are much more accurate than the GP models.

Use of Context Blocks in Genetic Programming for Evolution of Robot Morphology

The paper explores applications of genetic programming to co-evolution of morphology and low-level control. In most reasonably difficult tasks, facilitation provided by modularity has proved to be vital for successful application of genetic programming. However, the need for sharing data among nodes in the syntactic tree becomes especially acute when evolving modular programs. It has been shown before that it may be beneficial that modules themselves be node-attached. The paper presents extensions to standard genetic programming （the so-called contexts and context blocks） that allow for straight-forward storage, retrieval, transfer, and modification of data stored in the context of a syntactic tree, and shared by multiple nodes. Framework is thus provided for both： data sharing and node-attached modules. Finally, using context blocks, a genetic algorithm has been embedded within genetic programming to evolve values of constants. In genetic programming evolution of constants has been a long-standing problem. The paper shows how context blocks can be utilized to provide a more granular and flexible approach to their evolution. As shown in previous works, node-attached modules perform favorably when compared with existing approaches. Concerning evolution of context block constants, it is shown here that they too perform favorably when compared with ephemeral constants.

Screen-printed graphite electrode on polyvinyl chloride and parchment strips integrated with genetic programming for in situ nitrate sensing of aquaponic pond water

Nitrate is the primary water-soluble macronutrient essential for plant growth that is converted from excess fish feeds,fish effluents,and degrading biomaterials on the aquaponic pond floor,and when aquacultural malpractices occur,large amounts of it retain in the water system causing increase rate in eutrophication and toxifies fish and aquaculture plants.Recent nitrate sensor prototypes still require performing the additional steps of water sample deionization and dilution and were constructed with expensive materials.In response to the challenge of sensor enhancement and aquaponic water quality monitoring,this study developed sensitive,repeatable,and reproducible screen-printed graphite electrodes on polyvinyl chloride and parchment paper substrates with silver as electrode material and 60:40 graphite powder:nail polish formulated conductive ink for electrical traces,integrated with 9-gene genetic expression model as a function of peak anodic current and electrochemical test time for nitrate concentration prediction that is embedded into low-power Arduino ESP32 for in situ nitrate sensing in aquaponic pond water.Five SPE electrical traces were designed on the two types of substrates.Scanning electron microscopy with energy dispersive X-ray confirmed the electrode surface morphology.Electrochemical cyclic voltammetry using 10 to 100 mg/L KNO3 and water from three-depth regions of the actual pond established the electrochemical test time(10.5 s)and electrode potential(0.135 V)protocol necessary to produce peak current that corresponds to the strength of nitrate ions during redox.The findings from in situ testing revealed that the proposed sensors have strong linear predictions(R2=0.968 MSE=1.659 for nSPEv and R2=0.966 MSE=4.697 for nSPEp)in the range of 10 to 100 mg/L and best detection limit of 3.15μg/L,which are comparable to other sensors of more complex construction.The developed three-electrode electrochemical nitrate sensor confirms that it is reliable for both biosensing in controlled solutions and in situ aquaponic pond water systems.

A New Road Extraction Method from Satellite Images Using Genetic Programming

Extracting roads from satellite images is an important task in thefield of computer vision with a wide range of applications.However,efficient road extraction from satellite images remains a complex challenge due to issues such as data labeling and the diversity of road features.Existing methods often struggle to balance accuracy,robustness,and interpretability.Genetic programming(GP)is based on aflexible and interpretable structure that is robust and does not require a large amount of data support.We position the road extraction problem as a binary semantic segmentation task and introduce GP algorithms.First,an approach for extracting pixel neighborhood features is proposed,and features from multiple images in the DeepGlobe road extraction dataset are extracted.Then,an advanced feature construction method based on GP is employed.Finally,these advanced features are utilized for training classifier and classi-fication to achieve road extraction.We have validated the effectiveness of the approach on the DeepGlobe road extraction dataset.The results demonstrated that the proposed approach exhibits superior performance compared to traditional classification methods and multilayer perceptron(MLP)in terms of accuracy,generalization,and interpretability.This study provides a valuable reference for the integration of GP into the domain of road extraction from satellite images,showcasing their potential to enhance the accuracy and efficiency.

GENETIC PROGRAMMING TO PREDICT SKI-JUMP BUCKET SPILLWAY SCOUR

Researchers in the past had noticed that application of Artificial Neural Networks （ANN） in place of conventional statistics on the basis of data mining techniques predicts more accurate results in hydraulic predictions. Mostly these works pertained to applications of ANN. Recently, another tool of soft computing, namely, Genetic Programming （GP） has caught the attention of researchers in civil engineering computing. This article examines the usefulness of the GP based approach to predict the relative scour depth downstream of a common type of ski-jump bucket spillway. Actual field measurements were used to develop the GP model. The GP based estimations were found to be equally and more accurate than the ANN based ones, especially, when the underlying cause-effect relationship became more uncertain to model.

FORECASTING TIME SERIES WITH GENETIC PROGRAMMING BASED ON LEAST SQUARE METHOD

Although time series are frequently nonlinear in reality, people tend to use linear models to fit them under some assumptJLons unnecessarily in accordance with the truth, which unsurprisingly leads to unsatisfactory performance. This paper proposes a forecast method： Genetic programming based on least square method （GP-LSM）. Inheriting the advantages of genetic algorithm （GA）, without relying on the particular distribution of the data, this method can improve the prediction accuracy because of its ability of fitting nonlinear models, and raise the convergence speed benefitting from the least square method （LSM）. In order to verify the vMidity of this method, the authors compare this method with seasonal auto regression integrated moving average （SARIMA） and back propagation artificial neural networks （BP-ANN）. The results of empirical analysis show that forecast accuracy and direction prediction accuracy of GP-LSM are obviously better than those of the others.