.png){kind=icon}
返回
A Multi-objective optimization algorithm based on dynamic user-preference information
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-021-00995-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In real life, some complex problems are multi-objective optimization problems. Most of the existing studies have focused on how to obtain the optimal solutions distributed on the whole Pareto-optimal frontier. However, in some fields such as industrial production, the decision-makers of enterprises usually care about what specific measures can maximize the comprehensive benefits of enterprises. Due to this kind of realistic demands, we prefer to find a small part of the optimal solutions according to the preference information suggested by the decision-makers rather than obtain all of the Pareto-optimal solutions. However, almost all of the existing methods only repeat calculation when they meet the scenario where the user-preferences change over time. To address the multi-objective optimization problem under the scenario with dynamic user-preferences information, we propose a MOEA/D-DPRE (multi-objective optimization algorithm based on dynamic preference information) algorithm in this paper, and its framework is inspired by the MOEA/D-PRE (decomposition user-preference multi-objective evolutionary) algorithm. We analyze the four position relations between the distribution region of the old preference weight vectors (old preference region), and we also present the distribution region of the new preference weight vectors (new preference region) and propose the different strategy to the different case respectively. When the preference information changes, the MOEA/D-DPRE can converge to the region of new interest by responding to the change of preference and the historical information. Experimental results show that the proposed method is better than the compared method in convergence speed and distribution under the scenario with dynamic user-preferences information.
Keyword:
Dynamic
Preference Information
Multi-objective Optimization
Pareto Optimality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
Automatic selection of a single solution from the Pareto front to identify key players in social networks从帕累托前沿自动选择单一解决方案，以识别社交网络中的关键参与者
PREAI
分享收藏分享收藏An r-dominance-based preference multi-objective optimization for many-objective optimization一种基于r-优势的偏好多目标优化方法.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏
查看更多内容