{"title":"种群富集在遗传规划中的作用","authors":"John E. Perry","doi":"10.1109/ICEC.1994.349907","DOIUrl":null,"url":null,"abstract":"The paper examines the effect of \"population enrichment\" in genetic programming as a means of efficiently discovering promising directions for solution exploration in a large problem space. With genetic programming it is advantageous to not restrict the size or shape of the solution and enrichment offers an efficient way to present the initial population with interesting options for development. Multiple abbreviated runs were made, using different random seeds, to keep the size of the members small and save processing time. The best member from each abbreviated run was used to create an enriched population which was loaded along with a full complement of randomly generated unique members at the beginning of a consolidated run.<<ETX>>","PeriodicalId":393865,"journal":{"name":"Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"The effect of population enrichment in genetic programming\",\"authors\":\"John E. Perry\",\"doi\":\"10.1109/ICEC.1994.349907\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper examines the effect of \\\"population enrichment\\\" in genetic programming as a means of efficiently discovering promising directions for solution exploration in a large problem space. With genetic programming it is advantageous to not restrict the size or shape of the solution and enrichment offers an efficient way to present the initial population with interesting options for development. Multiple abbreviated runs were made, using different random seeds, to keep the size of the members small and save processing time. The best member from each abbreviated run was used to create an enriched population which was loaded along with a full complement of randomly generated unique members at the beginning of a consolidated run.<<ETX>>\",\"PeriodicalId\":393865,\"journal\":{\"name\":\"Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEC.1994.349907\",\"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 First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEC.1994.349907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The effect of population enrichment in genetic programming
The paper examines the effect of "population enrichment" in genetic programming as a means of efficiently discovering promising directions for solution exploration in a large problem space. With genetic programming it is advantageous to not restrict the size or shape of the solution and enrichment offers an efficient way to present the initial population with interesting options for development. Multiple abbreviated runs were made, using different random seeds, to keep the size of the members small and save processing time. The best member from each abbreviated run was used to create an enriched population which was loaded along with a full complement of randomly generated unique members at the beginning of a consolidated run.<>