search

DEAP / deap

Distributed Evolutionary Algorithms in Python
http://deap.readthedocs.org/
GNU Lesser General Public License v3.0
5.81k stars 1.12k forks source link

Pareto Domination Tournament in the NSGA2 #171

Closed Dsaqui closed 7 years ago

Dsaqui commented 7 years ago

Why do you use the Pareto Domination Tournament in the NSGA2 example for selectiong and not the original selection algorithm (binary tournament selection)?

fmder commented 7 years ago

The examples/ga/nsga2.py example uses both TournamentDCD and Pareto+Sorting distance selection as described in the original paper.

Dsaqui commented 7 years ago

It is based on the paper:A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II?

fmder commented 7 years ago

This one exactly

Deb, Pratab, Agarwal, and Meyarivan, “A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II”, 2002.

We used the example to benchmark our nsga-2 selection. We obtained similar results as reported in the paper for convergence and diversity. To test it just enable the code sections in the main at the bottom of the file.

Dsaqui commented 7 years ago

Thanks