Abstract
In Genetic Programming (GP), evolving tree nodes separately would be an ideal approach to reduce the huge solution space of GP. We use Instruction Matrix based Genetic Programming (IMGP) to evolve tree nodes separately while taking into account their interdependencies in the form of subtrees. IMGP uses an Instruction Matrix (IM) to maintain the statistical data of tree nodes and subtrees. IMGP extracts program trees from IM, and updates IM with the information of the extracted program trees. The experiments have verified that the results of IMGP are better than those the related GP algorithms in terms of the qualities of the solutions and the number of program evaluations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming – An Introduction. In: On the Automatic Evolution of Computer Programs and its Applications, January 1998, Morgan Kaufmann, San Francisco (1998)
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)
D’haeseleer, P.: Context preserving crossover in genetic programming. In: Proceedings of the 1994 IEEE World Congress on Computational Intelligence, Orlando, Florida, USA, June 27-29, 1994, vol. 1, pp. 256–261. IEEE Press, Los Alamitos (1994)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley, Reading, MA (1989)
Koza, J.R.: Genetic programming: On the programming of computers by natural selection. MIT Press, Cambridge, Mass (1992)
Li, G., Lee, K.-H., Leung, K.-S.: Evolve schema directly using instruction matrix based genetic programming. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J.I., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol. 3447, pp. 271–280. Springer, Heidelberg (2005)
Salustowicz, R., Schmidhuber, J.: Probabilistic incremental program evolution. Evolutionary Computation 5(2), 123–141 (1997)
Shan, Y., McKay, R.I., Abbass, H.A., Essam, D.: Program evolution with explicit learning: a new framework for program automatic synthesis. In: Sarker, R., Reynolds, R., Abbass, H., Tan, K.C., McKay, B., Essam, D., Gedeon, T. (eds.) CEC 2003. Proceedings of the 2003 Congress on Evolutionary Computation, Canberra, December 8-12, 2003, pp. 1639–1646. IEEE Press, Los Alamitos (2003)
Shan, Y., McKay, R.I., Baxter, R., Abbass, H., Essam, D., Nguyen, H.: Grammar model-based program evolution. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation, Portland, Oregon, June 20-23, 2004, pp. 478–485. IEEE Press, Los Alamitos (2004)
Thierens, D., Goldberg, D.E.: Mixing in genetic algorithms. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, CA, pp. 38–45. Morgan Kaufman, San Francisco (1993)
Whigham, P.A.: Grammatically-based genetic programming. In: Rosca, J. (ed.) Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, San Mateo, July 1995, pp. 33–41. Morgan Kaufmann, San Francisco (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, G., Lee, K.H., Leung, K.S. (2007). Using Instruction Matrix Based Genetic Programming to Evolve Programs. In: Kang, L., Liu, Y., Zeng, S. (eds) Advances in Computation and Intelligence. ISICA 2007. Lecture Notes in Computer Science, vol 4683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74581-5_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-74581-5_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74580-8
Online ISBN: 978-3-540-74581-5
eBook Packages: Computer ScienceComputer Science (R0)