In this paper, we show some experimental results using incremental evaluation with tree adjoining grammar guided genetic programming (DEVTAG) on two symbolic regression problems, a benchmark polynomial fitting problem in genetic programming, and a Fourier series problem (sawtooth problem). In our pilot study, we compare results with standard genetic programming (GP) and the original tree adjoining grammar guided genetic programming (TAG3P). Our results on the two problems are good, outperforming both standard GP and the original TAG3P.
['Hoang Tuan-Hao', 'Robert I. McKay', 'Daryl Essam', 'Nguyen Xuan Hoai']
Solving Symbolic Regression Problems Using Incremental Evaluation In Genetic Programming