A Many-Objective Evolutionary Algorithm Based on Non-Linear Dominance
نویسندگان
چکیده
With the increase in number of objectives, non-dominated solutions will also sharply. The sorting method based on traditional Pareto dominance is not sufficiently distinguishable from and cannot provide enough selection pressure when population size small. In this article, a new non-linear (NLD) proposed. main motivation perspective storage solutions. small difference between each component as large possible, so part first quadrant, second, fourth quadrant near becomes dominant interval, except for distance too far defined which construct parabolic shape non-dominant interval. Based relationship, authors propose dominated many-objective evolutionary algorithm (NLDEA), can solve irregular front. Experiments show that NLDEA competitive with most advanced methods various scalable benchmark problems.
منابع مشابه
A Predictive Pareto Dominance Based Algorithm for Many-Objective Problems
1. Abstract Multiobjective genetic algorithms (MOGAs) have successfully been used on a wide range of real world problems. However, it is generally accepted that the performance of most state-of-the-art multiobjective genetic algorithms tend to perform poorly for problems with more than four objectives, termed many-objective problems. The contribution of this paper is a new approach for identify...
متن کاملEvolutionary Many-Objective Optimization Based on Kuhn-Munkres' Algorithm
In this paper, we propose a new multi-objective evolutionary algorithm (MOEA), which transforms a multi-objective optimization problem into a linear assignment problem using a set of weight vectors uniformly scattered. Our approach adopts uniform design to obtain the set of weights and Kuhn-Munkres’ (Hungarian) algorithm to solve the assignment problem. Differential evolution is used as our sea...
متن کاملIGD Indicator-based Evolutionary Algorithm for Many-objective Optimization Problems
Inverted Generational Distance (IGD) has been widely considered as a reliable performance indicator to concurrently quantify the convergence and diversity of multiand manyobjective evolutionary algorithms. In this paper, an IGD indicatorbased evolutionary algorithm for solving many-objective optimization problems (MaOPs) has been proposed. Specifically, the IGD indicator is employed in each gen...
متن کاملA new uniform evolutionary algorithm based on decomposition and CDAS for many-objective optimization
The convergence and the diversity are two main goals of an evolutionary algorithm for many-objective optimization problems. However, achieving these two goals simultaneously is the difficult and challenging work for multi-objective evolutionary algorithms. A uniform evolutionary algorithm based on decomposition and the control of dominance area of solutions (CDAS) is proposed to achieve these t...
متن کاملMany-Objective Evolutionary Optimisation
Many-objective evolutionary optimisation is a recent research area that is concerned with the optimisation of problems consisting of a large number of performance criteria using evolutionary algorithms. Despite the tremendous development that multi-objective evolutionary algorithms (MOEAs) have undergone over the last decade, studies addressing problems consisting of a large number of objective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Swarm Intelligence Research
سال: 2023
ISSN: ['1947-9263', '1947-9271']
DOI: https://doi.org/10.4018/ijsir.323422