A Fast Elitist Multiobjective Genetic Algorithm: Nsga-ii
نویسنده
چکیده
NSGA ( [5]) is a popular non-domination based genetic algorithm for multiobjective optimization. It is a very effective algorithm but has been generally criticized for its computational complexity, lack of elitism and for choosing the optimal parameter value for sharing parameter σshare. A modified version, NSGAII ( [3]) was developed, which has a better sorting algorithm , incorporates elitism and no sharing parameter needs to be chosen a priori. NSGA-II is discussed in detail in this.
منابع مشابه
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( ) computational complexity (where is the number of objectives and is the population size); 2) nonelitism approach; and 3) the need for specifying a sharing parameter. In this paper, we suggest a nondominated sorting-based multiobjective EA (MOEA), called nondominate...
متن کاملMulti-Objective Fault Section Estimation in Distribution Systems Using Elitist NSGA
In this paper, a non-dominated sorting based multi objective EA (MOEA), called Elitist non dominated sorting genetic algorithm (Elitist NSGA) has been presented for solving the fault section estimation problem in automated distribution systems, which alleviates the difficulties associated with conventional techniques of fault section estimation. Due to the presence of various conflicting object...
متن کاملA Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis
In this paper, we present a practical case of the multiobjective knapsack problem which concerns the elaboration of the optimal action plan in the social and medico-social sector. We provide a description and a formal model of the problem as well as some preliminary computational results. We perform an empirical analysis of the behavior of three metaheuristic approaches: a fast and elitist mult...
متن کاملA Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II
Abstract. Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) computational complexity (where is the number of objectives and is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algor...
متن کامل