| Class | Description |
|---|---|
| BinaryProblemsStudy |
Example of experimental study based on solving two binary problems with four algorithms: NSGAII,
SPEA2, MOCell, and MOCHC
This experiment assumes that the reference Pareto front are not known, so the must be produced.
|
| ConstraintProblemsStudy |
Example of experimental study based on solving the unconstrained problems included in jMetal.
|
| DTLZStudy |
Example of experimental study based on solving the problems (configured with 3 objectives) with the algorithms
NSGAII, SPEA2, and SMPSO
This experiment assumes that the reference Pareto front are known and stored in files whose names are different
from the default name expected for every problem.
|
| NSGAIIStudy |
Example of experimental study based on solving the ZDT problems with four versions of NSGA-II,
each of them applying a different crossover probability (from 0.7 to 1.0).
|
| NSGAIIStudy2 |
Example of experimental study based on solving the ZDT problems with four versions of NSGA-II,
each of them applying a different crossover probability (from 0.7 to 1.0).
|
| ZDTScalabilityIStudy |
Example of experimental study based on solving the ZDT1 problem but using five different number
of variables.
|
| ZDTScalabilityIStudy2 |
Example of experimental study based on solving the ZDT1 problem but using five different number
of variables.
|
| ZDTStudy |
Example of experimental study based on solving the ZDT problems with the algorithms NSGAII,
SPEA2, and SMPSO
This experiment assumes that the reference Pareto front are known and that, given a problem named
P, there is a corresponding file called P.pf containing its corresponding Pareto front.
|
| ZDTStudy2 |
Example of experimental study based on solving the ZDT problems with algorithms NSGAII, SPEA2,
and SMPSO
This experiment assumes that the reference Pareto front are not known, so the names of files
containing them and the directory where they are located must be specified.
|
Copyright © 2018. All rights reserved.