返回
Weighted sum model with partial preference information: Application to multi-objective optimization
DOI:10.1016/j.ejor.2017.01.003.png)
摘要
En 中文
Multi-objective optimization problems often lead to large nondominated sets, as the size of the problem or the number of objectives increases. Generating the whole nondominated set requires significant computation time, while most of the corresponding solutions are irrelevant to the decision maker (DM). Optimizing an aggregation function reduces the computation time and produces one or a very limited number of more focused solutions. This requires, however, the elicitation of precise preference parameters, which is often difficult and partly arbitrary, and might discard solutions of interest. An intermediate approach consists in using partial preference information with an aggregation function. In this work, we present a preference relation based on the weighted sum aggregation, where weights are not precisely defined. We give some properties of this preference relation and define the set of preferred points as the set of nondominated points with respect to this relation. We provide an efficient and generic way of generating this preferred set using any standard multi-objective optimization algorithm. This approach shows competitive performances both on computation time and quality of the generated preferred set. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Multiple objective programming
Weighted sum
Partial preference information
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
The immobilisation and restraint of paediatric patients during plain film radiographic examinations
Radiography
IF0
Recent trends and advances in polyindole-based nanocomposites as potential antimicrobial agents: a mini review
RSC Advances
IF0

