A Multi-point Interactive Method for Multi-objective Evolutionary Algorithms

Long Nguyen, L. Bui
{"title":"A Multi-point Interactive Method for Multi-objective Evolutionary Algorithms","authors":"Long Nguyen, L. Bui","doi":"10.1109/KSE.2012.30","DOIUrl":null,"url":null,"abstract":"Many real-world optimization problems have more than one objective (and these objectives are often conflicting). In most cases, there is no single solution being optimized with regards to all objectives. Deal with such problems, Multi-Objective Evolutionary Algorithms (MOEAs) have shown a great potential. There has been a popular trend in getting suitable solutions and increasing the convergence of MOEAs, that is consideration of Decision Maker (DM) during the optimization process (interacting with DM) for checking, analyzing the results and giving the preference. In this paper, we propose an interactive method allowing DM to specify a set of reference points. It used a generic algorithm framework of MOEA/D, a widely-used and decomposition-based MOEA for demonstration of concept. Basically MOEA/D decomposes a multi-objective optimization problem into a number of different single-objective optimization sub-problems and defines neighborhood relations among these sub-problems. Then a population-based method is used to optimize these sub-problems simultaneously. Each sub-problem is optimized by using information mainly from its neighboring sub-problems. In MOEA/D an ideal point is used to choose neighbored solutions for each run. Instead of using a single point, we introduce an alternative to the set of reference points. There are several way to take into account the information of the region specified by the set of reference points; here we used the mean of this set (or we call the combined point). The combined point which represents for the set of reference points from DM is used either to replace or adjust the current ideal point obtained by MOEA/D. We carried out a case study on several test problems and obtained quite good results.","PeriodicalId":122680,"journal":{"name":"2012 Fourth International Conference on Knowledge and Systems Engineering","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Knowledge and Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE.2012.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Many real-world optimization problems have more than one objective (and these objectives are often conflicting). In most cases, there is no single solution being optimized with regards to all objectives. Deal with such problems, Multi-Objective Evolutionary Algorithms (MOEAs) have shown a great potential. There has been a popular trend in getting suitable solutions and increasing the convergence of MOEAs, that is consideration of Decision Maker (DM) during the optimization process (interacting with DM) for checking, analyzing the results and giving the preference. In this paper, we propose an interactive method allowing DM to specify a set of reference points. It used a generic algorithm framework of MOEA/D, a widely-used and decomposition-based MOEA for demonstration of concept. Basically MOEA/D decomposes a multi-objective optimization problem into a number of different single-objective optimization sub-problems and defines neighborhood relations among these sub-problems. Then a population-based method is used to optimize these sub-problems simultaneously. Each sub-problem is optimized by using information mainly from its neighboring sub-problems. In MOEA/D an ideal point is used to choose neighbored solutions for each run. Instead of using a single point, we introduce an alternative to the set of reference points. There are several way to take into account the information of the region specified by the set of reference points; here we used the mean of this set (or we call the combined point). The combined point which represents for the set of reference points from DM is used either to replace or adjust the current ideal point obtained by MOEA/D. We carried out a case study on several test problems and obtained quite good results.
一种多目标进化算法的多点交互方法
许多现实世界的优化问题都有多个目标(这些目标经常是相互冲突的)。在大多数情况下,没有针对所有目标进行优化的单一解决方案。多目标进化算法(moea)在处理这类问题方面显示出巨大的潜力。在优化过程中考虑决策者(DM)(与DM交互)对结果进行检查、分析并给出优先选择,是获得合适的解并提高moea收敛性的一个流行趋势。在本文中,我们提出了一种交互式方法,允许DM指定一组参考点。它使用了MOEA/D的通用算法框架,这是一种广泛使用的基于分解的MOEA来演示概念。MOEA/D基本上是将一个多目标优化问题分解为多个不同的单目标优化子问题,并定义这些子问题之间的邻域关系。然后采用基于种群的方法对这些子问题同时进行优化。每个子问题主要利用其相邻子问题的信息进行优化。在MOEA/D中,使用一个理想点来选择每次运行的邻近解。我们不使用单个点,而是引入一组参考点的替代点。有几种方法可以考虑参考点集合所指定的区域信息;这里我们使用这个集合的均值(或者我们称之为结合点)。该组合点代表DM的参考点集合,用于替换或调整MOEA/D获得的当前理想点。我们对几个测试问题进行了案例分析,取得了很好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信