返回
Lorenz dominance based algorithms to solve a practical multiobjective problem
DOI:10.1016/j.cor.2018.12.003.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm一种简单快速的基于超体积指标的多目标进化算法

