Using Shapley Values and Genetic Algorithms to Solve Multiobjective Optimization Problems
نویسندگان
چکیده
This paper proposes a new methodology to solve multiobjective optimization problems by invoking genetic algorithms and the concept of Shapley values cooperative games. It is well known that Pareto-optimal solutions can be obtained solving corresponding weighting are formulated assigning some suitable weights objective functions. In this paper, we game from original problem regarding functions as players. The payoff function involves symmetric concept, which means only depends on number players in coalition independent role coalition. case, reasonably set up game. Under these settings, obtain so-called Shapley–Pareto-optimal solution. order choose best solution, used setting reasonable fitness function.
منابع مشابه
Genetic Algorithms Applied to Real Time Multiobjective Optimization Problems
Genetic algorithms are often well suited for multiobjective optimization problems. In this work, multiple objectives pertaining to the THUNDER software were concerned to optimize the war results obtained from the software. It is a stochastic, two-sided, analytical simulation of military operations. The simulation is subject to internal unknown noises. Due to these noises and discreetness in the...
متن کاملNsga with Elitism Applied to Solve Multiobjective Optimization Problems
In this paper the effects of elitism in the Nondominated Sorting Genetic Algorithm (NSGA) are analyzed. Three different kinds of elitism: standard, clustering and Parks & Miller techniques are investigated using two test problems. For the studied problems, the Parks & Miller mechanism generated the best results. Finally, the NSGA with Parks & Miller elitism was applied to determine the nondomin...
متن کاملUsing Genetic Algorithms to Solve NP-Complete Problems
A strategy for using Genetic Algorithms (GAs) to solve NP-complete problems is presented. The key aspect of the approach taken is to exploit the observation that, although all NP-complete problems are equally difficult in a general computational sense, some have much better GA representations than others, leading to much more successful use of GAs on some NP-complete problems than on others. Si...
متن کاملApproaches Based on Genetic Algorithms for Multiobjective Optimization Problems
In engineering, it is often necessary to formulate problems in which there are several criteria or objectives. It is unlikely that a solution that optimizes one of the objectives will be optimal for any of the others. Compromise solutions are therefore sought such that no other solutions are better in any one objective while remaining no worse in the others. These types of problems are known as...
متن کاملDivided Range Genetic Algorithms in Multiobjective Optimization Problems
In this paper, Divided Range Genetic Algorithm in Multi objective optimization Problems (DRGA) is proposed. In this method, population of GAs is sorted with respect to the objective function and divided into sub populations. In this model, the Pareto optimum solutions which are close to each other are collected by one sub population. Therefore, by this algorithm, the calculation efficiency is i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2021
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym13112021