Tree Based Differential Evolution
In recent years a new evolutionary algorithm for optimization in continuos spaces called Differential Evolution (DE) has developed. DE turns out to need only few evaluation steps to minimize a function. This makes it an interesting candidate for problem domains with high computational costs as for instance in the automatic generation of programs. In this paper a DE-based tree discovering algorithm called Tree based Differential Evolution (TreeDE) is presented. TreeDE maps full trees to vectors and represents discrete symbols by points in a real-valued vector space providing this way all arithmetical operations needed for the different DE schemes. Because TreeDE inherits the ’speed property’ of DE, it needs only few evaluations to find suitable trees which produce comparable and better results as other methods.
Unable to display preview. Download preview PDF.
- 1.Abbass, H.A., Hoai, N.X., McKay, R.I.: AntTAG: A new method to compose computer programs using colonies of ants. In: IEEE Congress on Evolutionary Computation (2002)Google Scholar
- 3.O’Neill, M., Brabazon, A.: Grammatical Differential Evolution. In: Proc. International Conference on Artificial Intelligence. CSEA Press, Las Vegas (2006)Google Scholar
- 6.Shan, Y., Abbass, H., McKay, R.I., Essam, D.: AntTAG: a further study. In: Proc. 6th Australia-Japan Joint Workshop on Intelligent and Evolutionary Systems, Canberra, Australia (2002)Google Scholar
- 7.Storn, R., Price, K.: Differential Evolution - A Simple and Efficient Adaptive Scheme for Global Optimization Over Continuous Spaces, Univ. California, Berkeley, ICSI, Technical Report TR-95-012 (March 1995), ftp://ftp.icsi.berkeley.edu/pub/techreports/1995/tr-95-012.pdf
- 8.Storn, R.: On the Usage of Differential Evolution for Function Optimization. In: 1996 Biennial Conference of the North American Fuzzy Information Processing Society (NAFIPS 1996), Berkeley, pp. 519–523. IEEE, USA (1996)Google Scholar