DEME Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

AbYSS	Abstract class representing the algorithm AbYSS
AdaptiveGrid	Class representing a hypercube structure (grid) to locate the solutions found by a MoEA. It was proposed in the algorithm PAES
BinaryGene	Abstract class representing a binary gene
BinaryGrayIntegerGene	Abstract class representing a binary gray coded real gene
BinaryGrayRealGene	Abstract class representing a binary gray coded real gene
BinaryIntegerGene	Class representing a binary-coded integer gene
BinaryRealGene	Class representing a binary-coded real gene
Binh2	Class representing Bihn(2)'s problem
Chromosome	Class representing a chromosome
ConstrEx	Class representing the problem ConstrEx
Deb	Class representing the problem Deb (This problem is renamed MOP6 in Coello et al.)
Dtlz1	Class representing the problem Dtlz1
Dtlz2	Class representing the problem Dtlz2
Dtlz3	Class representing the problem Dtlz3
Dtlz4	Class representing the problem Dtlz4
Dtlz5	Class representing the problem Dtlz5
Dtlz6	Class representing the problem Dtlz6
Dtlz7	Class representing the problem Dtlz7
ExpansionOfF10	Class representing the problem ExpansionOfF10
Fonseca	Class representing the problem Fonseca
Gene	Abstract class that represents a gene
Golinski	Class representing the problem Golinksi (speed reducer)
Griewangk	Class representing the problem Griewangk
Individual	Class representing an individual
IntegerGene	Class representing an integer gene
K_Distance	Class for obtaining the k-th neighbour distance of the individuals of a population
Kita	Class representing the problem Kita
Kursawe	Class representing Kursawe's problem
MoEA	Abstract class representing Multi-objective Evolutionary Algorithms
MultiobjectiveProblem	Abstract class representing a Multi-objective Optimization Problem (MOP)
Nsga2	Class implemenging the NSGA-II algorithm
OneMax	Class representing the problem OneMax (counting ones in a binary string)
OneZeroMax	This problem intends to maximize the number of 1's and the the number of 0's in a set of binary strings
Osyczka2	Class representing Osyczka's problem
Poloni	Class representing the problem Poloni
Population	This class represents a population of individuals
Quagliarella	Class representing the problem Quagliarella
Random	Class represenging random number generator
Ranking	This class makes a ranking of a population using the non-dominated sorting used in NSGA-II
Rastrigin	Class representing the problem Sphere
RealGene	Class representing a real gene
Rosenbrock	Class representing the problem Rosenbrock
Schaffer	Class representing Schaffer's problem
Schaffer2	Class representing the second Schaffer's problem
Schwefel	Class representing the problem Sphere
Sphere	Class representing the problem Sphere
Srinivas	Class representing the problem Srinivas
Ssmo	Abstract class representing the algorithm SSMO
Ssmo1	Class implementing the algorithm SSMOv1
Ssmo2	Class implementing the algorithm SSMOv2
Tanaka	Class representing the problem Tanaka
Viennet2	Class representing the problem Viennet(2)
Viennet3	Class representing the problem Viennet(3)
Viennet4	Class representing the problem Viennet(4)
Water	Class representing the problem WATER
Zdt1	Class representing the problem Zdt1
Zdt2	Class representing the problem Zdt2
Zdt3	Class representing the problem Zdt3
Zdt4	Class representing the problem Zdt4
Zdt5	Class representing the problem Zdt5
Zdt6	Class representing the problem Zdt6