提高后代适合度的交叉操作

Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) Pub Date : 1999-07-06 DOI:10.1109/CEC.1999.782667

C. Mohan

{"title":"提高后代适合度的交叉操作","authors":"C. Mohan","doi":"10.1109/CEC.1999.782667","DOIUrl":null,"url":null,"abstract":"Fine-honing the crossover operator to produce higher fitness children is shown to result in improved genetic search. To illustrate this, two new general-purpose crossover operators are described. These operators require more computation time than traditional crossover operators, but the number of fitness evaluations and the overall amount of time spent by the genetic algorithm (to obtain solutions of desired near-optimal quality) is reduced significantly.","PeriodicalId":292523,"journal":{"name":"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Crossover operators that improve offspring fitness\",\"authors\":\"C. Mohan\",\"doi\":\"10.1109/CEC.1999.782667\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fine-honing the crossover operator to produce higher fitness children is shown to result in improved genetic search. To illustrate this, two new general-purpose crossover operators are described. These operators require more computation time than traditional crossover operators, but the number of fitness evaluations and the overall amount of time spent by the genetic algorithm (to obtain solutions of desired near-optimal quality) is reduced significantly.\",\"PeriodicalId\":292523,\"journal\":{\"name\":\"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.1999.782667\",\"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 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.1999.782667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

对交叉算子进行微调以产生更高适应度的子代，可以提高基因搜索的效率。为了说明这一点，描述了两个新的通用交叉操作符。这些算子比传统的交叉算子需要更多的计算时间，但遗传算法的适应度评估次数和总体花费的时间(获得期望的近最优质量的解)显著减少。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Crossover operators that improve offspring fitness

Fine-honing the crossover operator to produce higher fitness children is shown to result in improved genetic search. To illustrate this, two new general-purpose crossover operators are described. These operators require more computation time than traditional crossover operators, but the number of fitness evaluations and the overall amount of time spent by the genetic algorithm (to obtain solutions of desired near-optimal quality) is reduced significantly.

求助全文

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

来源期刊

Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)

自引率

0.00%

发文量