A COMPARISON OF MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS by Crina Gro ş
نویسندگان
چکیده
In this paper a comparison of the most recent algorithms for Multiobjective Optimization is realized. For this comparison are used the followings algorithms: Strength Pareto Evolutionary Algorithm (SPEA), Pareto Archived Evolution Strategy (PAES), Nondominated Sorting Genetic Algorithm (NSGA II), Adaptive Pareto Algorithm (APA). The comparison is made by using five test functions.
منابع مشابه
The Role of Elitism in Multiobjective Optimization with Evolutionary Algorithms
This paper studies the influence of elitism in Evolutionary Multiobjective Optimization. The true efficiency of inserting elitism in these algorithms was not yet sufficiently developed. Many algorithms for multiobjective optimization use different methods to keep the best individuals (the elite) founded on the duration of the search process. The problem is how this elitism can be preserved and,...
متن کاملImproving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ϵ -dominance
The 0/1 knapsack problem is a well known problem occurring in many real world problems. The problem is NP-Complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. A new evolutionary algorithm for solving multiobjective 0/1 knapsack problem is proposed in this paper. This algorithm used a ε-dominance relation fo...
متن کاملMultiobjective Adaptive Representation Evolutionary Algorithm (MAREA) - a new evolutionary algorithm for multiobjective optimization
Many algorithms for multiobjective optimization have been proposed in the last years. In the recent past a great importance have the MOEAs able to solve problems with more than two objectives and with a large number of decision vectors (space dimensions). The difficulties occur when problems with more than three objectives (higher dimensional problems) are considered. In this paper, a new algor...
متن کاملSolving Nonlinear Equation Systems Using Evolutionary Algorithms
This paper proposes a new perspective for solving systems of nonlinear equations. A system of equations can be viewed as a multiobjective optimization problem: every equation represents an objective function whose goal is to minimize difference between the right and left term of the corresponding equation in the system. We used an evolutionary computation technique to solve the problem obtained...
متن کاملA New Evolutionary Adaptive Representation Paradigm
In this paper a new evolutionary paradigm is proposed. A technique called Adaptive Representation Evolutionary Algorithm (AREA) based on this paradigm is designed. AREA involves dynamic alphabets for encoding solutions. Proposed adaptive representation is more compact than binary representation. Mutation is the unique variation operator. Mutations are usually more aggressive when higher alphabe...
متن کامل