Saving computational effort in genetic programming by means of plagues

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 3, Issue , 2003, Pages 2042-2049

  Fernandez, F ^a   Tomassini, M ^b   Vanneschi, L ^b  

^a UNIVERSITY OF EXTREMADURA   (Spain)

^b UNIVERSITY OF LAUSANNE   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

COMPUTATIONAL COSTS; COMPUTATIONAL EFFORT; COMPUTING RESOURCE; COMPUTING TIME;

GENETIC PROGRAMMING;

EID: 84901397842     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299924     Document Type: Conference Paper

References (19)

1. Goldberg, D. E. Sizing Populations for serial and parallel genetic algorithms. In Schaffer, J. D. (Ed.). Proceedings of the Third International Conference on Genetic Algorithms (pp. 70-79). San Mateo. CA: Morgan Kaufmann (1989).
2. E. Burke, S. Gustafson and G. Kendall. A survey and analysis of diversity measures in genetic programming. In W. B. Langdon et al.. editor, GECCO 2002: Proceeding of the Generic and Evolutionary Computation Conference. pages 7 16-723. Morgan Kaufmann Publishers, San Francisco, CA, 2002.
3. E. Burke, S. Gustafson, G. Kendall, and N. Krasnogor. Advanced population diversity measures in genetic programming. In J . J. Mrrelo et al.. editor, Parallel Pmblem Solving, from Nuture . PPSN VII. volume 2439 of Lecrure Nores in Compufer Science. pages 341-150. Springer-Verlag. Heidelberg, 2002.
4. Fern'andez, F., Tomassini, M., Vanneschi, L. The effect ofplagues in genetic programming: A study of variable-size populations. In C. Ryan et al.. editor, Generic PrugrammOig, 611, Europeaii Conference, EuroCP 2003, volume 2610 of Lerlure Nom in Cumpurer Science. pages 317-326. Springer- Verlag. Heidelberg. 2003.
5. A. Ek'art and S. Z. N'emeth. Maintaining the diversity of genetic programs. In J . A. Foster et al.. editor. Generic Programming, Proceedings of the 5111 European Conference, EumGP 2W2. volume 2218 of LNCS, pages 162-171. Springer- Verlag. 2002.
6. Tan, K.C., Lee, T.H., and E. F. Khor. Evolurionary Algorithms Withd Dynamic Popdation Siza and Local Exploration for Multiobjrctive Optimization. In IEEE Transactions on Evolutionary Computation. Vol. 5, Num. 6, Dec 2001. pp.565-588.
7. Langdon, W. B., Poli, R: Foundations of Genetic Programming. Springer (2001).
8. Langdon, W. B., Poli, U: Fitness Causes Bloat. In P. K. Chawdhry, R. Roy, and R. K. Pant. editors, Soft Computing in Engineering Design and Manufacturing. pages 13-22. Springer Verlag London (1997).
9. Bruce, K.B., Cardelli, L., Pierce, B.C. Comparing Object Encodings. In: Abadi, M., Ito, T. (eds.): Theoretical Aspects of Computer Software. Lecture Notes in Computer Science, Vol. 1281. Springer-Verlag. Berlin Heidelberg New York (1997) 415-438.
10. Michalewicz, Z. Genetic Algorithms + Data Structures = Evolution Programs. 3rd edn. Springer-Verlag. Berlin Heidelberg New York (1996).
11. Baldonado, M., Chang, C.-C.K., Gravano, L., Paepcke, A. The Stanford Digital Library Metadata Architecture. Int. J. Digit. Libr. 1 (1997) 108-121.
12. Fern'andez, F., Tomassini, M., Vanneschi, L. An Empirical Study of Multipopulation Genetic Programming, in Genetic Programming and Evolvable Machines, Vol. 4, N. 1, Kluwer Academic Press.(2003) 21-52.
13. Fern'andez, F Estudio de Poblaciones de tamafio variable en Programaci 'on Gen'etica (Spanish) in Proceedings Segundo Congreso Espaiiol sohre Metaheur'isticas. Algoritmos evolutivos y bioinspirados, 424-428. Universidad de Oviedo. Feb. 2002.
14. Koza, J.R.: Genetic Programming. On the Programming of Computers by Means of Natural Selection, The MIT Press: Cambridge, MA. 1992.
15. de Jong E. D. and Watson R. A. and Pollack J. B. Reducing bloat and promoting diversity using multi-objective methods, L. Spector et al. (eds). in Proceedings of the genetic and evolutionary computation conference (GECCOOI ). Morgan Kaufmann, San Francisco. CA.(2001) 11-18.
16. Nordin P. and Francone F. D. and Banzhaf, W.:Complexity compression and evolution. In Larry J. Eshelman, editor. Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95). pages 310-317, Pittsburgh, PA, USA, 15- 19 July 1995. Morgan Kaufmann.
17. Punch B. and Zongker D. and Goodman E., The royal tree problem, a benchmark for single and multiple population pcnetic programming, in Advances in Genetic Programming 2, P. Angeline and K. Kinnear (eds). The MIT Press, Cambridge, MA, (1996) 299-316.
18. Banzhaf, W., Langdon, W. Some considerations on the reason of bloat, in Genetic Programming and Evolvable Machines, Vol 3, N., Morgan Kaufman (2002) 81-91.
19. Fuchs, M. Large populations are not Away the best choice in Genetic Programming. in Proceedings of Genetic and Evolutionary Comptation Conference. Morgan Kaufman ( 1999). 1033- 1038.