A review of some methods that incorporate decision-maker preferences in multi-objective evolutionary optimization using a multi-criteria classification method

J. P. Sánchez-Solís, E. Fernández, L. Cruz-Reyes, Gilberto Rivera-Zarate, Luis Cisneros
{"title":"A review of some methods that incorporate decision-maker preferences in multi-objective evolutionary optimization using a multi-criteria classification method","authors":"J. P. Sánchez-Solís, E. Fernández, L. Cruz-Reyes, Gilberto Rivera-Zarate, Luis Cisneros","doi":"10.3390/MOL2NET-04-06136","DOIUrl":null,"url":null,"abstract":"In the real world there are many problems which involve the optimization of multiple objective functions at the same time. These are known as Multi-objective Optimization Problems (MOPs). Solving this kind of problems implies generating a set of good solutions, commonly known as Pareto-optimal solutions. The Multi-Objective Evolutionary Algorithms (MOEAs) have been extensively used to address this type of problems, since it allowing to get a set of the Pareto solutions in a particular run. Nevertheless, finding this solution set does not resolve the problem since the Decision-Maker (DM) still must select from that set the solution that matches more with his/her preferences. Determine the Region of Interest (RoI), in accordance with the DM’s preferences, is an option that would make easy the selection process. The RoI has been defined as the region on the Pareto frontier which suits better to the DM's preferences. In order to help the DM in the selection process, different approaches in literature have added preferential information into the optimization process to lead the search towards the RoI. \n \nSuch is the case of the approach presented by (Cruz-Reyes et al., 2017) called Hybrid Multi-Criteria Sorting Genetic Algorithm (H-MCSGA). This method addresses the preferences incorporation a priori into a MOEA to characterize the RoI by a multicriteria sorting method called THESEUS (Fernandez et al., 2011). H-MCSGA consists by two phases. First, a metaheuristic is used to create a set of solutions (reference set) that are assigned to ordered classes by the DM. The objective of this process is that the DM's preferences are indirectly reflected in this set. In the second phase, THESEUS is incorporated into an evolutionary algorithm to sort the new solutions created during optimization process. For this, THESEUS uses the reference set, generating selective pressure in the direction of the RoI. The performance of H-MCSGA was verified using nine instances of a public project portfolio problem. The achieve results show that H-MCSGA reach a good definition of the RoI and outperforms the well-known NSGA-II (Deb et al., 2002). A first interactive version of the H-MCSGA is presented in (Cruz-Reyes et al., 2014), where the reference set is updated, only once, while exploration process. Consequently, the DM’s preferences are updated. In examples on the portfolio problem, this proposal maintains its superiority over the NSGAII. \n \nFinally, an interactive method more robust is proposed in (Cruz-Reyes et al., 2016) called the Interactive Multi-Criteria Sorting Genetic Algorithm (I-MCSGA). This method allows the DM to assimilate progressively respecting the problem and to clarify his/her preferences. I-MCSGA was assessed on project portfolio optimization problems. This algorithm was measure against with NSGA-II in three and four objectives problems and in nine and sixteen objectives problems with A2-NSGA-III (Jain, Deb, 2013). I-MCSGA presented better outcomes than these algorithms in regard to Pareto-dominance and to its ability to accomplish the RoI. The automatic-enhancement procedure results efficient to include new solutions into the reference set, aiding THESEUS to propose more suitable assignments. Moreover, the proposed procedure to update preferences interactively is efficient to validate the enhanced reference set, still when the real DM was supplanted by the preference model proposed by (Fernandez et al., 2011). Therefore, I-MCSGA shown its capacity to identify the RoI and, to address optimization problems with a few and many numbers of objectives, effectively. \n \nFuture research directions should be leads towards extend the experimentation to problems where the true Pareto frontier is known, the use of others multicriteria sorting methods and the comparing with others most recent MOEAs. This with the aim of validating the outcomes of these approach with greater certainty.","PeriodicalId":20475,"journal":{"name":"Proceedings of MOL2NET 2018, International Conference on Multidisciplinary Sciences, 4th edition","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of MOL2NET 2018, International Conference on Multidisciplinary Sciences, 4th edition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/MOL2NET-04-06136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the real world there are many problems which involve the optimization of multiple objective functions at the same time. These are known as Multi-objective Optimization Problems (MOPs). Solving this kind of problems implies generating a set of good solutions, commonly known as Pareto-optimal solutions. The Multi-Objective Evolutionary Algorithms (MOEAs) have been extensively used to address this type of problems, since it allowing to get a set of the Pareto solutions in a particular run. Nevertheless, finding this solution set does not resolve the problem since the Decision-Maker (DM) still must select from that set the solution that matches more with his/her preferences. Determine the Region of Interest (RoI), in accordance with the DM’s preferences, is an option that would make easy the selection process. The RoI has been defined as the region on the Pareto frontier which suits better to the DM's preferences. In order to help the DM in the selection process, different approaches in literature have added preferential information into the optimization process to lead the search towards the RoI. Such is the case of the approach presented by (Cruz-Reyes et al., 2017) called Hybrid Multi-Criteria Sorting Genetic Algorithm (H-MCSGA). This method addresses the preferences incorporation a priori into a MOEA to characterize the RoI by a multicriteria sorting method called THESEUS (Fernandez et al., 2011). H-MCSGA consists by two phases. First, a metaheuristic is used to create a set of solutions (reference set) that are assigned to ordered classes by the DM. The objective of this process is that the DM's preferences are indirectly reflected in this set. In the second phase, THESEUS is incorporated into an evolutionary algorithm to sort the new solutions created during optimization process. For this, THESEUS uses the reference set, generating selective pressure in the direction of the RoI. The performance of H-MCSGA was verified using nine instances of a public project portfolio problem. The achieve results show that H-MCSGA reach a good definition of the RoI and outperforms the well-known NSGA-II (Deb et al., 2002). A first interactive version of the H-MCSGA is presented in (Cruz-Reyes et al., 2014), where the reference set is updated, only once, while exploration process. Consequently, the DM’s preferences are updated. In examples on the portfolio problem, this proposal maintains its superiority over the NSGAII. Finally, an interactive method more robust is proposed in (Cruz-Reyes et al., 2016) called the Interactive Multi-Criteria Sorting Genetic Algorithm (I-MCSGA). This method allows the DM to assimilate progressively respecting the problem and to clarify his/her preferences. I-MCSGA was assessed on project portfolio optimization problems. This algorithm was measure against with NSGA-II in three and four objectives problems and in nine and sixteen objectives problems with A2-NSGA-III (Jain, Deb, 2013). I-MCSGA presented better outcomes than these algorithms in regard to Pareto-dominance and to its ability to accomplish the RoI. The automatic-enhancement procedure results efficient to include new solutions into the reference set, aiding THESEUS to propose more suitable assignments. Moreover, the proposed procedure to update preferences interactively is efficient to validate the enhanced reference set, still when the real DM was supplanted by the preference model proposed by (Fernandez et al., 2011). Therefore, I-MCSGA shown its capacity to identify the RoI and, to address optimization problems with a few and many numbers of objectives, effectively. Future research directions should be leads towards extend the experimentation to problems where the true Pareto frontier is known, the use of others multicriteria sorting methods and the comparing with others most recent MOEAs. This with the aim of validating the outcomes of these approach with greater certainty.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
综述了基于多准则分类的多目标进化优化中包含决策者偏好的几种方法
在现实世界中,有许多问题同时涉及多个目标函数的优化问题。这就是所谓的多目标优化问题(MOPs)。解决这类问题意味着产生一组好的解决方案,通常被称为帕累托最优解决方案。多目标进化算法(moea)已被广泛用于解决这类问题,因为它允许在特定运行中获得一组Pareto解。然而,找到这个解决方案集并不能解决问题,因为决策者(DM)仍然必须从这个解决方案集中选择更符合他/她偏好的解决方案。根据DM的偏好确定感兴趣的区域(RoI),这是一个可以简化选择过程的选项。投资回报率被定义为帕累托边界上更适合决策制定者偏好的区域。为了在选择过程中帮助决策制定者,文献中不同的方法在优化过程中加入了优先信息,从而引导搜索向RoI方向发展。这就是(Cruz-Reyes等人,2017)提出的称为混合多标准排序遗传算法(H-MCSGA)的方法的情况。该方法通过称为THESEUS的多标准分类方法,解决了将先验偏好纳入MOEA以表征RoI的问题(Fernandez等人,2011)。H-MCSGA由两个阶段组成。首先,使用元启发式方法创建一组解决方案(参考集),这些解决方案(参考集)由DM分配给有序类。此过程的目标是DM的偏好间接反映在该集合中。在第二阶段,THESEUS被整合到一个进化算法中,对优化过程中产生的新解进行排序。为此,THESEUS使用参考集,在RoI方向上产生选择性压力。使用9个公共项目组合问题实例验证了H-MCSGA的性能。研究结果表明,H-MCSGA对RoI的定义很好,优于著名的NSGA-II (Deb et al., 2002)。在(Cruz-Reyes et al., 2014)中提出了H-MCSGA的第一个交互式版本,其中参考集在探索过程中仅更新一次。因此,DM的首选项被更新。在投资组合问题的实例中,该方法保持了相对于NSGAII的优越性。最后,在(Cruz-Reyes et al., 2016)中提出了一种更鲁棒的交互式方法,称为交互式多标准排序遗传算法(I-MCSGA)。这种方法可以让DM逐渐理解问题,并澄清他/她的偏好。对项目组合优化问题进行了I-MCSGA评估。该算法在3个和4个目标问题中与NSGA-II进行了比较,在9个和16个目标问题中与A2-NSGA-III进行了比较(Jain, Deb, 2013)。I-MCSGA在帕累托优势及其实现RoI的能力方面表现出比这些算法更好的结果。自动增强过程有效地将新解纳入参考集,帮助THESEUS提出更合适的分配。此外,当实际决策被(Fernandez et al., 2011)提出的偏好模型所取代时,所提出的交互更新偏好的过程仍然有效地验证了增强的参考集。因此,I-MCSGA显示了其识别RoI的能力,并有效地解决了具有少量和大量目标的优化问题。未来的研究方向应该是将实验扩展到真正的帕累托边界已知的问题,使用其他多标准分类方法,并与其他最新的moea进行比较。这样做的目的是更确定地验证这些方法的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
PANELFIT-LAWSci-02 Workshop: H2020 Challenges in Law, Technology, Life, and Social Sciences Characterization and overexpression of a glucanase from a newly isolated B. subtilis strain MOL2NET: FROM MOLECULES TO NETWORKS (PROC. BOOK), ISBN: 978-3-03842-820-6, 2019, Vol. 4, 2985 pp. Analysis of chemical composition of Cissus incisa leaves by GC/MS Machine learning techniques and the identification of new potentially active compounds against Leishmania infantum.
×
引用
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