Genetic-Programming-Based Symbolic Regression for Heat Transfer Correlations of a Compact Heat Exchanger

Author(s):  
Weihua Cai ◽  
Mihir Sen ◽  
K. T. Yang ◽  
Arturo Pacheco-Vega

We describe a symbolic regression methodology based on genetic programming to find correlations that can be used to estimate the performance of compact heat exchangers. Genetic programming is an evolutionary search technique in which functions represented as parse trees evolve as the search proceeds. An advantage of this approach is that functional forms of the correlation need not be assumed. The algorithm performs symbolic regression by seeking both the functional structure of the correlation and the coefficients therein that enable the closest fit to experimental data. This search is conducted within a functional domain constructed from sets of operators and terminals that are used to build tree-structures representing functions. A penalty function is used to prevent large correlations. The methodology is tested using first artificial data from a one-dimensional function and later a set of published heat exchanger experiments. Comparison with published results from the same data show that symbolic-regression correlations are as good or better. The effect of the penalty parameters on the “best function” is also analyzed.

Author(s):  
Arturo Pacheco-Vega ◽  
Weihua Cai ◽  
Mihir Sen ◽  
K. T. Yang

In the present study we propose the application of evolutionary algorithms to find correlations that can predict the performance of a compact heat exchanger. Genetic programming (GP) is a search technique in which computer codes, representing functions as parse trees, evolve as the search proceeds. As a symbolic regression approach, GP looks for both the functional form and the coefficients that enable the closest fit to experimental data. Two different data sets are used to test the symbolic regression capability of genetic programming, the first being artificial data from a one-dimensional function, while the second are data generated by previously determined correlations from experimental measurements of a single-phase air-water heat exchanger. The results demonstrate that the correlations found by symbolic regression are able to predict well the data from which they were determined, and that the GP technique may be suitable for modeling the nonlinear behavior of heat exchangers. It is also shown that there is not a unique answer for the best-fit correlation from this procedure. The advantage of using genetic programming as symbolic regression is that no initial assumptions on the functional forms are needed, which is contrary to the traditional approach.


2021 ◽  
Vol 11 (12) ◽  
pp. 5468
Author(s):  
Elizaveta Shmalko ◽  
Askhat Diveev

The problem of control synthesis is considered as machine learning control. The paper proposes a mathematical formulation of machine learning control, discusses approaches of supervised and unsupervised learning by symbolic regression methods. The principle of small variation of the basic solution is presented to set up the neighbourhood of the search and to increase search efficiency of symbolic regression methods. Different symbolic regression methods such as genetic programming, network operator, Cartesian and binary genetic programming are presented in details. It is shown on the computational example the possibilities of symbolic regression methods as unsupervised machine learning control technique to the solution of MLC problem of control synthesis for obtaining the stabilization system for a mobile robot.


2017 ◽  
Vol 60 ◽  
pp. 447-469 ◽  
Author(s):  
Maryam Amir Haeri ◽  
Mohammad Mehdi Ebadzadeh ◽  
Gianluigi Folino

2009 ◽  
Vol 18 (05) ◽  
pp. 757-781 ◽  
Author(s):  
CÉSAR L. ALONSO ◽  
JOSÉ LUIS MONTAÑA ◽  
JORGE PUENTE ◽  
CRUZ ENRIQUE BORGES

Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure, named straight line program (slp), to represent computer programs. The main features of this structure are described, new recombination operators for GP related to slp's are introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations.


Author(s):  
Jason M. Daida ◽  
Adam M. Hilss ◽  
David J. Ward ◽  
Stephen L. Long

Author(s):  
Luiz Otavio V.B. Oliveira ◽  
Fernando E.B. Otero ◽  
Luis F. Miranda ◽  
Gisele L. Pappa

Sign in / Sign up

Export Citation Format

Share Document