IGD+-EMOA:基于IGD+的多目标进化算法

Edgar Manoatl Lopez, C. Coello
{"title":"IGD+-EMOA:基于IGD+的多目标进化算法","authors":"Edgar Manoatl Lopez, C. Coello","doi":"10.1109/CEC.2016.7743898","DOIUrl":null,"url":null,"abstract":"In recent years, the design of selection mechanisms based on performance indicators has become a very popular trend in the development of new Multi-Objective Evolutionary Algorithms (MOEAs). The main motivation has been the well-known limitations of Pareto-based MOEAs when dealing with problems having four or more objectives (the so-called many-objective problems). The most commonly adopted indicator has been the hypervolume, mainly because of its nice mathematical properties (e.g., it is the only unary indicator which is known to be Pareto compliant). However, the hypervolume has a well-known disadvantage: its exact computation is very costly in high dimensionality, making it prohibitive for many-objective problems (this cost normally becomes unaffordable for problems with more than 5 objectives). Recently, a variation of the well-known inverse generational distance (IGD) was introduced. This indicator, which is called IGD+ was shown to be weakly Pareto compliant, and presents some evident advantages with respect to the original IGD. Here, we propose an indicator-based MOEA, which adopts IGD+. The proposed approach adopts a novel technique for building the reference set, which is used to assess the quality of the solutions obtained during the search. Our preliminary results indicate that our proposed approach is able to solve many-objective problems in an effective and efficient manner, being able to obtain solutions of a similar quality to those obtained by SMS-EMOA and MOEA/D, but at a much lower computational cost than required by the computation of exact hypervolume contributions (as adopted in SMS-EMOA).","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"44 1","pages":"999-1006"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"40","resultStr":"{\"title\":\"IGD+-EMOA: A multi-objective evolutionary algorithm based on IGD+\",\"authors\":\"Edgar Manoatl Lopez, C. Coello\",\"doi\":\"10.1109/CEC.2016.7743898\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, the design of selection mechanisms based on performance indicators has become a very popular trend in the development of new Multi-Objective Evolutionary Algorithms (MOEAs). The main motivation has been the well-known limitations of Pareto-based MOEAs when dealing with problems having four or more objectives (the so-called many-objective problems). The most commonly adopted indicator has been the hypervolume, mainly because of its nice mathematical properties (e.g., it is the only unary indicator which is known to be Pareto compliant). However, the hypervolume has a well-known disadvantage: its exact computation is very costly in high dimensionality, making it prohibitive for many-objective problems (this cost normally becomes unaffordable for problems with more than 5 objectives). Recently, a variation of the well-known inverse generational distance (IGD) was introduced. This indicator, which is called IGD+ was shown to be weakly Pareto compliant, and presents some evident advantages with respect to the original IGD. Here, we propose an indicator-based MOEA, which adopts IGD+. The proposed approach adopts a novel technique for building the reference set, which is used to assess the quality of the solutions obtained during the search. Our preliminary results indicate that our proposed approach is able to solve many-objective problems in an effective and efficient manner, being able to obtain solutions of a similar quality to those obtained by SMS-EMOA and MOEA/D, but at a much lower computational cost than required by the computation of exact hypervolume contributions (as adopted in SMS-EMOA).\",\"PeriodicalId\":6344,\"journal\":{\"name\":\"2009 IEEE Congress on Evolutionary Computation\",\"volume\":\"44 1\",\"pages\":\"999-1006\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"40\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Congress on Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2016.7743898\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2016.7743898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 40

摘要

近年来,基于性能指标的选择机制设计已成为新型多目标进化算法(moea)发展的一个非常流行的趋势。主要动机是众所周知的基于pareto的moea在处理具有四个或更多目标的问题(所谓的多目标问题)时的局限性。最常被采用的指标是hypervolume,主要是因为它很好的数学性质(例如,它是已知唯一符合Pareto的一元指标)。然而,hypervolume有一个众所周知的缺点:它在高维上的精确计算成本非常高,这使得它无法用于多目标问题(这种成本通常对于具有超过5个目标的问题来说是无法承受的)。最近,一种众所周知的逆代际距离(IGD)的变异被引入。这个被称为IGD+的指标被证明是弱帕累托顺应的,并且相对于原始的IGD表现出一些明显的优势。在此,我们提出了一种基于指标的MOEA,采用IGD+。该方法采用了一种新的技术来构建参考集,用于评估在搜索过程中获得的解的质量。我们的初步结果表明,我们提出的方法能够以有效和高效的方式解决许多客观问题,能够获得与SMS-EMOA和MOEA/D获得的解质量相似的解,但其计算成本远低于精确hypervolume贡献的计算(如SMS-EMOA所采用的)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
IGD+-EMOA: A multi-objective evolutionary algorithm based on IGD+
In recent years, the design of selection mechanisms based on performance indicators has become a very popular trend in the development of new Multi-Objective Evolutionary Algorithms (MOEAs). The main motivation has been the well-known limitations of Pareto-based MOEAs when dealing with problems having four or more objectives (the so-called many-objective problems). The most commonly adopted indicator has been the hypervolume, mainly because of its nice mathematical properties (e.g., it is the only unary indicator which is known to be Pareto compliant). However, the hypervolume has a well-known disadvantage: its exact computation is very costly in high dimensionality, making it prohibitive for many-objective problems (this cost normally becomes unaffordable for problems with more than 5 objectives). Recently, a variation of the well-known inverse generational distance (IGD) was introduced. This indicator, which is called IGD+ was shown to be weakly Pareto compliant, and presents some evident advantages with respect to the original IGD. Here, we propose an indicator-based MOEA, which adopts IGD+. The proposed approach adopts a novel technique for building the reference set, which is used to assess the quality of the solutions obtained during the search. Our preliminary results indicate that our proposed approach is able to solve many-objective problems in an effective and efficient manner, being able to obtain solutions of a similar quality to those obtained by SMS-EMOA and MOEA/D, but at a much lower computational cost than required by the computation of exact hypervolume contributions (as adopted in SMS-EMOA).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Step-Size Individualization: a Case Study for The Fish School Search Family A Genetic Ant Colony Optimization Algorithm for Inter-domain Path Computation problem under the Domain Uniqueness constraint A Simulated IMO-DRSA Approach for Cognitive Reduction in Multiobjective Financial Portfolio Interactive Optimization Applying Never-Ending Learning (NEL) Principles to Build a Gene Ontology (GO) Biocurator Many Layer Transfer Learning Genetic Algorithm (MLTLGA): a New Evolutionary Transfer Learning Approach Applied To Pneumonia Classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1