Return
Lorenz dominance based algorithms to solve a practical multiobjective problem
DOI:10.1016/j.cor.2018.12.003.png)
Abstract
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.
Keywords:
Multiobjective optimization
Fair optimization
Lorenz dominance
Action planning
Decision support
Heuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available

