Alternative bloat control methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3103, Issue , 2004, Pages 630-641

  Panait, Liviu ^a   Luke, Sean ^a  

^a GEORGE MASON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

CONTROL METHODS; EVOLUTIONARY PROCESS; MULTI OBJECTIVE; PARAMETER SETTING; PROBLEM DOMAIN; STEADY-STATE EVOLUTION; WAITING ROOM;

GENETIC PROGRAMMING;

EID: 35048881419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_71     Document Type: Article

References (15)

1. Smith, S.F.: A Learning System Based on Genetic Adaptive Algorithms. PhD thesis, Computer Science Department, University of Pittsburgh (1980)
2. Bassett, J.K., De Jong, K.A.: Evolving behaviors for cooperating agents. In: International Syposium on Methodologies for Intelligent Systems. (2000) 157-165
3. Luke, S.: Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Bloat. PhD thesis, Department of Computer Science, University of Maryland, A. V. Williams Building, University of Maryland, College Park, MD 20742 USA (2000)
4. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA (1992)
5. Martin, P., Poli, R.: Crossover operators for A hardware implementation of GP using FPGAs and Handel-C. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, Morgan Kaufmann Publishers (2002) 845-852
6. Silva, S., Almeida, J.: Dynamic maximum tree depth. In: Genetic and Evolutionary Computation - GECCO-2003, Chicago, Springer-Verlag (2003) 1776-1787
7. Haynes, T.: Collective adaptation: The exchange of coding segments. Evolutionary Computation 6 (1998) 311-338
8. Luke, S., Panait, L.: Lexicographic parsimony pressure. In: GECCO-2002: Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kauffman (2002) 829-836
9. Luke, S., Panait, L.: Fighting bloat with nonparametric parsimony pressure. In Merelo Guervós, J.J., Adamidis, P., Beyer, H.G., Fernández-Villacañas, J.L., Schwefel, H.P., eds.: Proceedings of the International Conference on Parallel Problem Solving from Nature (PPSN VII), Springer-Verlag (2002) 411-421
10. Burke, D.S., De Jong, K.A., Grefenstette, J.J., Ramsey, C.L., Wu, A.S.: Putting more genetics into genetic algorithms. Evolutionary Computation 6 (1998) 387-410
11. Poli, R.: A simple but theoretically-motivated method to control bloat in genetic programming. In: Genetic Programming, Proceedings of EuroGP'2003, Springer-Verlag (2003) 204-217
12. Bleuler, S., Brack, M., Thiele, L., Zitzler, E.: Multiobjective genetic programming: Reducing bloat using SPEA2. In: Proceedings of the 2001 Congress on Evolutionary Computation, IEEE Press (2001) 536-543
13. de Jong, E.D., Pollack, J.B.: Multi-objective methods for tree size control. Genetic Programming and Evolvable Machines 4 (2003) 211-233
14. Ekart, A., Nemeth, S.Z.: Selection based on the pareto nondomination criterion for controlling code growth in genetic programming. Genetic Programming and Evolvable Machines 2 (2001) 61-73
15. Luke, S. ECJ 10 : An Evolutionary Computation research system in Java. Available at http://www.cs.umd.edu/projects/plus/ec/ecj/ (2003)