遗传规划中动态大小群体的一种新技术

Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI:10.1109/CEC.2004.1330896

M. Tomassini, L. Vanneschi, Jerome Cuendet, F. Fernández

{"title":"遗传规划中动态大小群体的一种新技术","authors":"M. Tomassini, L. Vanneschi, Jerome Cuendet, F. Fernández","doi":"10.1109/CEC.2004.1330896","DOIUrl":null,"url":null,"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.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"235 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":"{\"title\":\"A new technique for dynamic size populations in genetic programming\",\"authors\":\"M. Tomassini, L. Vanneschi, Jerome Cuendet, F. Fernández\",\"doi\":\"10.1109/CEC.2004.1330896\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":152088,\"journal\":{\"name\":\"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)\",\"volume\":\"235 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"42\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2004.1330896\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2004.1330896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 42

摘要

提出了在遗传规划系统执行过程中动态改变种群大小的新技术。提出了两种模型，允许根据进化过程中发生的一些特定事件来增加和抑制个体。这些模型允许找到质量更好的解决方案，节省大量的计算工作，并更快地找到最优解决方案，至少对于这里研究的一组问题，即圣达菲小径上的人工蚂蚁，偶宇称问题和符号回归问题的一个实例。此外，这些模型对众所周知的膨胀问题有积极的影响，并且没有引入额外的计算成本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new technique for dynamic size populations in genetic programming

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)

自引率

0.00%

发文量