利用漂移分析了解一维连续适应度景观

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

Jun He, X. Yao, Qingfu Zhang

{"title":"利用漂移分析了解一维连续适应度景观","authors":"Jun He, X. Yao, Qingfu Zhang","doi":"10.1109/CEC.2004.1331040","DOIUrl":null,"url":null,"abstract":"This work shows that we could describe the characteristics of easy and hard fitness landscapes in one-dimensional continuous space by drift analysis. The work expends the existing results in the discrete space into the continue space. A fitness landscape, here, is regarded as the behaviour of an evolutionary algorithm on fitness functions. Based on the drift analysis, easy fitness landscapes are thought to be a \"short-distance\" landscape, which is easy for the evolutionary algorithm to find the optimal point; and hard fitness landscapes then are as a far-distance landscape, which the evolutionary algorithm had to spend a long time to find the optimal point.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"To understand one-dimensional continuous fitness landscapes by drift analysis\",\"authors\":\"Jun He, X. Yao, Qingfu Zhang\",\"doi\":\"10.1109/CEC.2004.1331040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work shows that we could describe the characteristics of easy and hard fitness landscapes in one-dimensional continuous space by drift analysis. The work expends the existing results in the discrete space into the continue space. A fitness landscape, here, is regarded as the behaviour of an evolutionary algorithm on fitness functions. Based on the drift analysis, easy fitness landscapes are thought to be a \\\"short-distance\\\" landscape, which is easy for the evolutionary algorithm to find the optimal point; and hard fitness landscapes then are as a far-distance landscape, which the evolutionary algorithm had to spend a long time to find the optimal point.\",\"PeriodicalId\":152088,\"journal\":{\"name\":\"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"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.1331040\",\"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.1331040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

本研究表明，通过漂移分析可以描述一维连续空间中易、难适应度景观的特征。该工作将离散空间中的现有结果扩展到连续空间中。在这里，适应度景观被认为是适应度函数上进化算法的行为。基于漂移分析，易适应度景观被认为是“短距离”景观，便于进化算法找到最优点;而硬适应度景观则作为一个远距离景观，进化算法需要花费很长时间来寻找最优点。

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

查看原文本刊更多论文

To understand one-dimensional continuous fitness landscapes by drift analysis

This work shows that we could describe the characteristics of easy and hard fitness landscapes in one-dimensional continuous space by drift analysis. The work expends the existing results in the discrete space into the continue space. A fitness landscape, here, is regarded as the behaviour of an evolutionary algorithm on fitness functions. Based on the drift analysis, easy fitness landscapes are thought to be a "short-distance" landscape, which is easy for the evolutionary algorithm to find the optimal point; and hard fitness landscapes then are as a far-distance landscape, which the evolutionary algorithm had to spend a long time to find the optimal point.

求助全文

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

来源期刊

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

自引率

0.00%

发文量