进化约束多目标优化中定向交配有用不可行解的选择区域控制及其档案

Minami Miyakawa, K. Takadama, Hiroyuki Sato
{"title":"进化约束多目标优化中定向交配有用不可行解的选择区域控制及其档案","authors":"Minami Miyakawa, K. Takadama, Hiroyuki Sato","doi":"10.1145/2576768.2598313","DOIUrl":null,"url":null,"abstract":"As an evolutionary approach to solve constrained multi-objective optimization problems (CMOPs), recently a MOEA using the two-stage non-dominated sorting and the directed mating (TNSDM) has been proposed. In TNSDM, the directed mating utilizes infeasible solutions dominating feasible solutions to generate offspring. Although the directed mating contributes to improve the search performance of TNSDM in CMOPs, there are two problems. First, since the number of infeasible solutions dominating feasible solutions in the population depends on each CMOP, the effectiveness of the directed mating also depends on each CMOP. Second, infeasible solutions utilized in the directed mating are discarded in the selection process of parents (elites) population and cannot be utilized in the next generation. To overcome these problems and further improve the effectiveness of the directed mating in TNSDM, in this work we propose an improved TNSDM introducing a method to control selection area of infeasible solutions and an archiving strategy of useful infeasible solutions for the directed mating. The experimental results on m objectives k knapsacks problems shows that the improved TNSDM improves the search performance by controlling the directionality of the directed mating and increasing the number of directed mating executions in the solution search.","PeriodicalId":123241,"journal":{"name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Controlling selection area of useful infeasible solutions and their archive for directed mating in evolutionary constrained multiobjective optimization\",\"authors\":\"Minami Miyakawa, K. Takadama, Hiroyuki Sato\",\"doi\":\"10.1145/2576768.2598313\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As an evolutionary approach to solve constrained multi-objective optimization problems (CMOPs), recently a MOEA using the two-stage non-dominated sorting and the directed mating (TNSDM) has been proposed. In TNSDM, the directed mating utilizes infeasible solutions dominating feasible solutions to generate offspring. Although the directed mating contributes to improve the search performance of TNSDM in CMOPs, there are two problems. First, since the number of infeasible solutions dominating feasible solutions in the population depends on each CMOP, the effectiveness of the directed mating also depends on each CMOP. Second, infeasible solutions utilized in the directed mating are discarded in the selection process of parents (elites) population and cannot be utilized in the next generation. To overcome these problems and further improve the effectiveness of the directed mating in TNSDM, in this work we propose an improved TNSDM introducing a method to control selection area of infeasible solutions and an archiving strategy of useful infeasible solutions for the directed mating. The experimental results on m objectives k knapsacks problems shows that the improved TNSDM improves the search performance by controlling the directionality of the directed mating and increasing the number of directed mating executions in the solution search.\",\"PeriodicalId\":123241,\"journal\":{\"name\":\"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2576768.2598313\",\"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 2014 Annual Conference on Genetic and Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2576768.2598313","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

作为求解约束多目标优化问题的一种进化方法,近年来提出了一种基于两阶段非支配排序和定向交配的多目标优化方法。在TNSDM中,定向交配利用不可行解优于可行解来产生子代。虽然定向匹配有助于提高CMOPs中TNSDM的搜索性能,但存在两个问题。首先,由于种群中不可行解的数量大于可行解的数量取决于每个CMOP,因此定向交配的有效性也取决于每个CMOP。其次,定向交配中使用的不可行的解决方案在亲本(精英)群体的选择过程中被抛弃,不能在下一代中使用。为了克服这些问题,进一步提高TNSDM中有向配对的有效性,本文提出了一种改进的TNSDM,引入了一种控制有向配对不可行解的选择区域的方法和一种有用的有向配对不可行解的存档策略。对m个目标k个背包问题的实验结果表明,改进的TNSDM通过控制有向匹配的方向性和增加求解过程中有向匹配的执行次数,提高了搜索性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Controlling selection area of useful infeasible solutions and their archive for directed mating in evolutionary constrained multiobjective optimization
As an evolutionary approach to solve constrained multi-objective optimization problems (CMOPs), recently a MOEA using the two-stage non-dominated sorting and the directed mating (TNSDM) has been proposed. In TNSDM, the directed mating utilizes infeasible solutions dominating feasible solutions to generate offspring. Although the directed mating contributes to improve the search performance of TNSDM in CMOPs, there are two problems. First, since the number of infeasible solutions dominating feasible solutions in the population depends on each CMOP, the effectiveness of the directed mating also depends on each CMOP. Second, infeasible solutions utilized in the directed mating are discarded in the selection process of parents (elites) population and cannot be utilized in the next generation. To overcome these problems and further improve the effectiveness of the directed mating in TNSDM, in this work we propose an improved TNSDM introducing a method to control selection area of infeasible solutions and an archiving strategy of useful infeasible solutions for the directed mating. The experimental results on m objectives k knapsacks problems shows that the improved TNSDM improves the search performance by controlling the directionality of the directed mating and increasing the number of directed mating executions in the solution search.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信