A New Technique for Dynamic Size Populations in Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{tomassini:2004:antfdspigp,

• title = "A New Technique for Dynamic Size Populations in Genetic Programming",
• author = "Marco Tomassini and Leonardo Vanneschi and Jerome Cuendet and Francisco Fernandez",
• pages = "486--493",
• booktitle = "Proceedings of the 2004 IEEE Congress on Evolutionary Computation",
• year = "2004",
• publisher = "IEEE Press",
• month = "20-23 " # jun,
• address = "Portland, Oregon",
• ISBN = "0-7803-8515-2",
• keywords = "genetic algorithms, genetic programming, Theory of evolutionary algorithms, Multiobjective evolutionary algorithms",
• DOI = "doi:10.1109/CEC.2004.1330896",
• abstract = "New techniques for dynamically changing the size of populations during the execution of genetic programming systems are proposed. Two models are presented, allowing to add and suppress individuals on the basis of some particular events occurring during the evolution. These models allow to find solutions of better quality, to save considerable amounts of computational effort and to find optimal solutions more quickly, at least for the set of problems studied here, namely the artificial ant on the Santa Fe trail, the even parity 5 problem and one instance of the symbolic regression problem. Furthermore, these models have a positive effect on the well known problem of bloat and act without introducing additional computational cost.",
• notes = "CEC 2004 - A joint meeting of the IEEE, the EPS, and the IEE.",

}

Genetic Programming entries for Marco Tomassini Leonardo Vanneschi Jerome Cuendet Francisco Fernandez de Vega

Citations