arrow
返回

Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions

delete2019-05-01
delete22
delete
OA
AI
李珂 封面图
李珂 (Ke Li)
R
Renzhi Chen
D
Dragan Savić
X
Xin Yao *
DOI:10.1109/TFUZZ.2018.2880700delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Decomposition has become an increasingly popular technique for evolutionary multiobjective optimization (EMO). A decomposition-based EMO algorithm is usually designed to approximate a whole Pareto-optimal front (PF). However, in practice, a decision maker (DM) might only be concerned in her/his region of interest (ROI), i.e., a part of the PF. Solutions outside that might he useless or even noisy to the decision-making procedure. Furthermore, there is no guarantee that the preferred solutions will he found when many-objective problems. This paper develops an interactive framework for the decomposition-based EMO algorithm to lead a DM to the preferred solutions of her/his choice. It consists of three modules, i.e., consultation, preference elicitation, and optimization. Specifically, after every several generations, the DM is asked to score a few candidate solutions in a consultation session. Thereafter, an approximated value function, which models the DM's preference information, is progressively learned from the DM's behavior. In the preference elicitation session, the preference information learned in the consultation module is translated into the form that can be used in a decomposition-based EMO algorithm, i.e., a set of reference points that are biased toward the ROI. The optimization module, which can be any decomposition-based EMO algorithm in principle, utilizes the biased reference points to guide its search process. Extensive experiments on benchmark problems with three to ten objectives fully demonstrate the effectiveness of our proposed method for finding the DM's preferred solutions.
Keyword:
Decomposition-based technique
evolutionary computation
interactive multiobjective optimization (MOP)
multicriterion decision making (MCDM)
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Fuzzy Systems 封面图
IEEE Transactions on Fuzzy Systems
IF:
11.9
论文数:
5.0K
被引数:
2.9W

机构

U
University of Exeter
学者数:
2.0W
论文数: 2.1W
被引数: 3.6W
N
national university of defense technology - china
学者数:
1.8W
论文数: 1.4W
被引数: 9
引用论文

引用论文

Self Supervision for Attention Networks
err2021-01-01
err0
PREAI
errBadri N Patro; Kasturi G S; Ansh Jain; Vinay P Namboodiri
err分享
err收藏
Bacterial Rhodopsin: Evidence for a New Type of Phototrophy in the Sea
err2000-09-15
err0
PREAI
errOded Béjà; L. Aravind; Eugene V. Koonin; Marcelino T. Suzuki; Andrew Hadd; Linh P. Nguyen; Stevan B. Jovanovich; Christian M. Gates; Robert A. Feldman; John L. Spudich; Elena N. Spudich; Edward F. DeLong
err分享
err收藏
A two-stage preference-based evolutionary multi-objective approach for capability planning problems
err2012-07-01
err25
PREAI
errXiong, Jian; Yang, Ke-wei; Liu, Jing; Zhao, Qing-song; Chen, Ying-wu
err分享
err收藏
学者 查看更多内容