A carregar...
Publicação
Multi-objective MaxiMin Sorting Scheme
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 609.09 KB | Adobe PDF |
Orientador(es)
Resumo(s)
Obtaining a well distributed non-dominated Pareto front is one of the key issues in multi-objective optimization algorithms. this paper proposes a new variant for the elitist selection operator to the NSGA-II algorithm, which promotes well distributed non-dominated fronts. The basic idea is to replace the crowding distance method by a maximin technique. the proposed technique is deployed in well know test functions and compared with the crowding is performed in terms of achieved front solutions distribution by using distance performance indices.