arrow
返回

Lorenz dominance based algorithms to solve a practical multiobjective problem

delete2019-04-01
delete4
PRE
AI
M
Matthieu Basseur
J
Jin‐Kao Hao *
DOI:10.1016/j.cor.2018.12.003delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The set of Pareto nondominated solutions obtained in some practical cases of multiobjective optimization problems can be huge, rendering decision making difficult. Applying Lorenz dominance instead of Pareto dominance during the optimization process can help to alleviate this difficulty. Lorenz dominance is a refinement of Pareto dominance that integrates fairness in multiobjective optimization when objectives are considered equal and can help select only the well located solutions. By introducing a partial order among a set of Pareto-nondominated solutions, Lorenz dominance reduces the size of the nondominated front by keeping only fair solutions. In this work, we investigate the use of the infinite order Lorenz dominance within three new methods to solve a practical case of the multiobjective knapsack problem, which involves elaborating efficient action plans in social and medico-social structures. We assess the proposed methods on large problem instances with up to 8 objectives and 500 candidate actions and show their effectiveness in comparison with four leading reference algorithms. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Multiobjective optimization
Fair optimization
Lorenz dominance
Action planning
Decision support
Heuristics
AI总结

AI总结

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

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
A new visualization method in many-objective optimization with chord diagram and angular mapping
err2017-12-01
err33
PREAI
errKoochaksaraei, Roozbeh Haghnazar; Meneghini, Ivan Reinaldo; Coelho, Vitor Nazario; Guimaraes, Frederico Gadelha
err分享
err收藏
err分享
err收藏
学者 查看更多内容