返回
On decomposition methods in interactive user-preference based optimization
DOI:10.1016/j.asoc.2016.09.032.png)
摘要
En 中文
Evolutionary multi-objective optimization (EMO) methodologies have been widely applied to find a well distributed trade-off solutions approximating to the Pareto-optimal front in the past decades. However, integrating the user-preference into the optimization to find the region of interest (ROI) [1] or preferred Pareto-optimal solutions could be more efficient and effective for the decision maker (DM) straightforwardly. In this paper, we propose several methods by combining preference-based strategy (like the reference points) with the decomposition-based multi-objective evolutionary algorithm (MOEA/D) [2], and demonstrate how preferred sets or ROIs near the different reference points specified by the DM can be found simultaneously and interactively. The study is based on the experiments conducted on a set of test problems with objectives ranging from two to fifteen objectives. Experiments have proved that the proposed approaches are more efficient and effective especially on many-objective problems to provide a set of solutions to the DM's preference, so that a better and a more reliable decision can be made. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Optimization
Interactive multi-objective method
MOEA/D
ROI
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
6.1W
机构
引用论文
Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms
SOFT COMPUTING
IF2.5
The r-Dominance: A New Dominance Relation for Interactive Evolutionary Multicriteria Decision Making
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints使用基于参考点的非支配排序方法的进化多目标优化算法,第一部分: 解决框约束问题

