五分之一成功法则下的互动(1+1)进化策略

Takahiko Sudo, Koji Ueba, Y. Nojima, H. Ishibuchi
{"title":"五分之一成功法则下的互动(1+1)进化策略","authors":"Takahiko Sudo, Koji Ueba, Y. Nojima, H. Ishibuchi","doi":"10.1109/APCASE.2014.6924477","DOIUrl":null,"url":null,"abstract":"Incorporation of fitness evaluation by a human user into evolutionary computation is called interactive evolutionary computation (IEC). Various IEC methods have been studied for design problems. An important challenge in IEC is to decrease human user's workload for fitness evaluation. For example, it is almost impossible for human users to continue to examine and evaluate tens of thousands of solutions. In some application fields such as evolutionary music, it is impossible to evaluate multiple solutions simultaneously. In our previous study, we formulated an IEC model by assuming the minimum level of the human user's ability to evaluate the fitness of each solution. We also illustrated our IEC model through computational experiments on combinatorial optimization problems. In this study, we address the use of our IEC model for continuous optimization problems. We propose an idea to incorporate step-size adaptation by the well-known one-fifth success rule into our IEC model. Through computational experiments on four test problems, we examine the search ability of our IEC model with the step-size adaptation mechanism.","PeriodicalId":118511,"journal":{"name":"2014 Asia-Pacific Conference on Computer Aided System Engineering (APCASE)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Interactive (1+1) evolutionary strategy with one-fifth success rule\",\"authors\":\"Takahiko Sudo, Koji Ueba, Y. Nojima, H. Ishibuchi\",\"doi\":\"10.1109/APCASE.2014.6924477\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Incorporation of fitness evaluation by a human user into evolutionary computation is called interactive evolutionary computation (IEC). Various IEC methods have been studied for design problems. An important challenge in IEC is to decrease human user's workload for fitness evaluation. For example, it is almost impossible for human users to continue to examine and evaluate tens of thousands of solutions. In some application fields such as evolutionary music, it is impossible to evaluate multiple solutions simultaneously. In our previous study, we formulated an IEC model by assuming the minimum level of the human user's ability to evaluate the fitness of each solution. We also illustrated our IEC model through computational experiments on combinatorial optimization problems. In this study, we address the use of our IEC model for continuous optimization problems. We propose an idea to incorporate step-size adaptation by the well-known one-fifth success rule into our IEC model. Through computational experiments on four test problems, we examine the search ability of our IEC model with the step-size adaptation mechanism.\",\"PeriodicalId\":118511,\"journal\":{\"name\":\"2014 Asia-Pacific Conference on Computer Aided System Engineering (APCASE)\",\"volume\":\"147 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Asia-Pacific Conference on Computer Aided System Engineering (APCASE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCASE.2014.6924477\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Asia-Pacific Conference on Computer Aided System Engineering (APCASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCASE.2014.6924477","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

将人类用户的适应度评估结合到进化计算中被称为交互式进化计算(IEC)。各种IEC方法已经被研究用于设计问题。如何减少人体适应度评估的工作量是IEC面临的一个重要挑战。例如,人类用户几乎不可能继续检查和评估数以万计的解决方案。在进化音乐等一些应用领域,不可能同时评估多个解。在我们之前的研究中,我们通过假设人类用户评估每个解决方案适应度的能力的最低水平来制定IEC模型。我们还通过组合优化问题的计算实验说明了我们的IEC模型。在这项研究中,我们解决了使用我们的IEC模型进行连续优化问题。我们提出了一个想法,将众所周知的五分之一成功规则的步长适应纳入我们的IEC模型。通过对四个测试问题的计算实验,验证了采用步长自适应机制的IEC模型的搜索能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interactive (1+1) evolutionary strategy with one-fifth success rule
Incorporation of fitness evaluation by a human user into evolutionary computation is called interactive evolutionary computation (IEC). Various IEC methods have been studied for design problems. An important challenge in IEC is to decrease human user's workload for fitness evaluation. For example, it is almost impossible for human users to continue to examine and evaluate tens of thousands of solutions. In some application fields such as evolutionary music, it is impossible to evaluate multiple solutions simultaneously. In our previous study, we formulated an IEC model by assuming the minimum level of the human user's ability to evaluate the fitness of each solution. We also illustrated our IEC model through computational experiments on combinatorial optimization problems. In this study, we address the use of our IEC model for continuous optimization problems. We propose an idea to incorporate step-size adaptation by the well-known one-fifth success rule into our IEC model. Through computational experiments on four test problems, we examine the search ability of our IEC model with the step-size adaptation mechanism.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信