利用基因流原理在遗传算法中适应突变

The 2003 Congress on Evolutionary Computation, 2003. CEC '03. Pub Date : 2003-12-08 DOI:10.1109/CEC.2003.1299833

G. Greenwood

{"title":"利用基因流原理在遗传算法中适应突变","authors":"G. Greenwood","doi":"10.1109/CEC.2003.1299833","DOIUrl":null,"url":null,"abstract":"Bit mutation in genetic algorithms is usually done with a single fixed probability. Methods to adapt this probability have been suggested, but they operate at the genome level. This paper describes a gene level adaption scheme, based on allele frequencies, which gives a better escape from local optima.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Adapting mutations in genetic algorithms using gene flow principles\",\"authors\":\"G. Greenwood\",\"doi\":\"10.1109/CEC.2003.1299833\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bit mutation in genetic algorithms is usually done with a single fixed probability. Methods to adapt this probability have been suggested, but they operate at the genome level. This paper describes a gene level adaption scheme, based on allele frequencies, which gives a better escape from local optima.\",\"PeriodicalId\":416243,\"journal\":{\"name\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2003.1299833\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

遗传算法中的位突变通常以单一的固定概率完成。已经提出了适应这种可能性的方法，但它们是在基因组水平上操作的。本文提出了一种基于等位基因频率的基因水平自适应方案，该方案能更好地摆脱局部最优。

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

查看原文本刊更多论文

Adapting mutations in genetic algorithms using gene flow principles

Bit mutation in genetic algorithms is usually done with a single fixed probability. Methods to adapt this probability have been suggested, but they operate at the genome level. This paper describes a gene level adaption scheme, based on allele frequencies, which gives a better escape from local optima.

求助全文

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

来源期刊

The 2003 Congress on Evolutionary Computation, 2003. CEC '03.

自引率

0.00%

发文量