Cezary Z. Janikow
ABSTRACT
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. The sufficiency principle requires that the set be sufficient to label the desired solution trees, often forcing the user to enlarge the set, thus also enlarging the search space. Structure-preserving crossover, STGP, CGP, and CFG-based GP give the user the power to reduce the space by specifying rules for valid tree construction: types, syntax, and heuristics. However, in general the user may not be aware of the best representation space, including heuristics, to solve a particular problem. Recently, the ACGP methodology for extracting problem-specific heuristics, and thus for learning model of the problem domain, was introduced with preliminary off-line results. This paper overviews ACGP, pointing out its strength and limitations in the off-line mode. It then introduces a new on-line model, for learning while solving a problem, illustrated with experiments involving the multiplexer and the Santa Fe trail.
- Banzhaf, Wolfgang, Nordin, Peter, Keller, Robert E., and Francone, Frank D. Genetic Programming. Morgan Kaufmann 1998. Google Scholar
Digital Library
- Burke, Edmund, Gustafson, Steven, and Kendall, Graham. A survey and analysis of diversity measures in genetic programming. In Langdon, W., Cantu-Paz, E. Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M., Schultz, A., Miller, J., Burke, E. and Jonoska, N., editors. GECCO2002: Proceedings of the Genetic and Evolutionary Computation Conference, 716--723, New York. Morgan Kaufmann. Google ScholarDigital Library
- Daida, Jason, Hills, Adam, Ward, David, and Long, Stephen. Visualizing tree structures in genetic programming. In Cantu-Paz, E., Foster, J., Deb, K., Davis, D., Roy, R., O'Reilly, U., Beyer, H., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter, M., Schultz, A., Dowsland, K., Jonoska, N., and Miller, J., editors, Genetic and Evolutionary Computation - GECCO-2003, volume 2724 of LNCS, 1652--1664, Chicago. Springer Verlag. Google ScholarDigital Library
- Hall, John M. and Soule, Terence. Does Genetic Programming Inherently Adopt Structured Design Techniques? In O'Reilly, Una-May, Yu, Tina, and Riolo, Rick L., editors. Genetic Programming Theory and Practice (II). Springer, New York, NY, 2005, 159--174.Google Scholar
- Janikow, Cezary Z. A Methodology for Processing Problem Constraints in Genetic Programming. Computers and Mathematics with Applications, 32(8):97--113, 1996.Google Scholar
- Janikow, Cezary Z. ACGP: Adaptable Constrained Genetic Programming. In O'Reilly, Una-May, Yu, Tina, and Riolo, Rick L., editors. Genetic Programming Theory and Practice(II). Springer, New York, NY, 2005, 191--206.Google Scholar
- Janikow, Cezary Z. Adapting Representation in Genetic Programming. In K. Deb et al. editors. Proceedings of Genetic and Evolutionary Computation Conference: GECCO 2004, 507--518.Google Scholar
- Janikow, Cezary Z. CGP. http://www.cs.umsl.edu/~janikow/CGP.Google Scholar
- Koza, John R. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts, May 1994. Google ScholarDigital Library
- Langon, William. Quadratic bloat in genetic programming. In Whitley, D., Goldberg, D., Cantu-Paz, E., Spector, L., Parmee, I., and Beyer, H-G., editors, Proceedings of the Genetic and Evolutionary Conference GECCO 2000, 451--458, Las Vegas. Morgan Kaufmann.Google Scholar
- McPhee, Nicholas F. and Hopper, Nicholas J. Analysis of genetic diversity through population history. In Banzhaf, W., Daida, J., Eiben, A. Garzon, M. Honavar, V., Jakiela, M. and Smith, R., editors Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1112--1120, Orlando, Florida, USA. Morgan Kaufmann.Google Scholar
- Montana, David J. Strongly Typed Genetic Programming. Evolutionary Computation, 3(2):199--230, 1995. Google ScholarDigital Library
- Pelikan, Martin and Goldberg, David. Boa: The Bayesian Optimization Algorithm. In Banzhaf, Wolfgang, Daida, Jason, Eiben, Agoston E., Garzon, Max H., Honavar, Vasant, Jakiela, Mark, and Smith, Robert E., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 525--532, Orlando, Florida, USA, 13--17 July 1999. Morgan Kaufmann.Google Scholar
- Whigham, P. A. Grammatically-based Genetic Programming. In Rosca, Justinian P., editor, Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pages 33--41, Tahoe City, California, 9 July 1995.Google Scholar
Index Terms
- Evolving problem heuristics with on-line ACGP
Recommendations
Multiobjective genetic programming approach to evolving heuristics for the bounded diameter minimum spanning tree problem: MOGP for BDMST
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationThe bounded-diameter (or diameter-constrained) minimum spanning tree (BDMST) problem is a well-studied combinatorial optimization problem for which several heuristics such as: one-time tree construction (OTTC), center based tree construction(CBTC), ...
Evolving reusable 3d packing heuristics with genetic programming
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationThis paper compares the quality of reusable heuristics designed by genetic programming (GP) to those designed by human programmers. The heuristics are designed for the three dimensional knapsack packing problem. Evolutionary computation has been ...
Evolving Construction Heuristics for the Symmetric Travelling Salesman Problem
SAICSIT '16: Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information TechnologistsThe symmetric travelling salesman problem is a real world combinatorial optimization problem and a well researched domain. When solving combinatorial optimization problems such as the travelling salesman problem a low-level construction heuristic is ...
Comments