多目标优化
计算机科学
进化算法
水准点(测量)
数学优化
趋同(经济学)
人工智能
集合(抽象数据类型)
秩(图论)
进化计算
机器学习
帕累托原理
偏爱
数学
经济
程序设计语言
地理
组合数学
经济增长
大地测量学
统计
作者
Ke Li,Guiyu Lai,Xin Yao
标识
DOI:10.1109/tevc.2023.3234269
摘要
In practical multicriterion decision making, it is cumbersome if a decision maker (DM) is asked to choose among a set of tradeoff alternatives covering the whole Pareto-optimal front. This is a paradox in conventional evolutionary multiobjective optimization (EMO) that always aim to achieve a well balance between convergence and diversity. In essence, the ultimate goal of multiobjective optimization is to help a DM identify solution(s) of interest (SOI) achieving satisfactory tradeoffs among multiple conflicting criteria. Bearing this in mind, this article develops a framework for designing preference-based EMO algorithms to find SOI in an interactive manner. Its core idea is to involve human in the loop of EMO. After every several iterations, the DM is invited to elicit her feedback with regard to a couple of incumbent candidates. By collecting such information, her preference is progressively learned by a learning-to-rank neural network and then applied to guide the baseline EMO algorithm. Note that this framework is so general that any existing EMO algorithm can be applied in a plug-in manner. Experiments on 48 benchmark test problems with up to ten objectives and a real-world multiobjective robot control problem fully demonstrate the effectiveness of our proposed algorithms for finding SOI.
科研通智能强力驱动
Strongly Powered by AbleSci AI