DEME File List

Here is a list of all files with brief descriptions:
AbYSS.cpp [code]This class implements the Archive based hYbrid Scatter Search (AbYSS) algorithm
AbYSS.h [code]Header file of AbYSS.cpp
AbYSSSeq.cpp [code]This program obtains the pareto front of a multiobjective problem using a Scatter Search strategy
AdaptiveGrid.cpp [code]Class representing a hypercube structure (grid) to locate the solutions found by a MoEA. It was proposed in the algorithm PAES
AdaptiveGrid.h [code]Header file of AdaptiveGrid.cpp
BinaryGene.cpp [code]Class representing a binary gene
BinaryGene.h [code]Header file of BinaryGene.cpp
BinaryGrayIntegerGene.cpp [code]Class representing a binary gray-coded real gene
BinaryGrayIntegerGene.h [code]
BinaryGrayRealGene.cpp [code]Class representing a binary gray-coded real gene
BinaryGrayRealGene.h [code]Header file of BinaryGrayIntegerGene.cpp
BinaryIntegerGene.cpp [code]Class representing a binary-coded integer gene
BinaryIntegerGene.h [code]Header file of BinaryIntegerGene.cpp
BinaryRealGene.cpp [code]Class representing a binary-coded real gene
BinaryRealGene.h [code]Header file of BinaryRealGene.cpp
Binh2.cpp [code]Specificacion of Binh(2)'s problem. This problem is renamed MOP-C1 in Coello et al
Binh2.h [code]Header file of Binh2.cpp
Chromosome.cpp [code]Class representing a chromosome
Chromosome.h [code]Header file of Chromosome.cpp
Configuration.h [code]This file contains configuration data to adapt the programs to new and old C++ styles
ConstrEx.cpp [code]Specificacion of the problem Constr_Ex. The problem is defined in Deb (2001), pag 290
ConstrEx.h [code]Header file of Constr_Ex.cpp
Deb.cpp [code]Specificacion of the problem Deb. This problem is named MOP6 in Coello et al
Deb.h [code]Header file of Deb.cpp
Docpage.h [code]
Dtlz1.cpp [code]Specificacion of the problem DTLZ1
Dtlz1.h [code]Header file of Dtlz1.cpp
Dtlz2.cpp [code]Specificacion of the problem Dtlz2
Dtlz2.h [code]
Dtlz3.cpp [code]Specificacion of the problem Dtlz3
Dtlz3.h [code]
Dtlz4.cpp [code]Specificacion of the problem Dtlz4
Dtlz4.h [code]Header file of Dtlz4.cpp
Dtlz5.cpp [code]Specificacion of the problem Dtlz5
Dtlz5.h [code]Header file of Dtlz5.cpp
Dtlz6.cpp [code]Specificacion of the problem Dtlz6
Dtlz6.h [code]Header file of Dtlz6.cpp
Dtlz7.cpp [code]Specificacion of the problem Dtlz7
Dtlz7.h [code]Header file of Dtlz7.cpp
ExpansionOfF10.cpp [code]Specificacion of the problem ExpansionOfF10
ExpansionOfF10.h [code]Header file of ExpansionOfF10.cpp
Fonseca.cpp [code]Specificacion of the problem Fonseca
Fonseca.h [code]Header file of Fonseca.cpp
Gene.cpp [code]Abstract class representing a generic gene
Gene.h [code]Header file of Gene.cpp
Golinski.cpp [code]Specificacion of the problem Golinski, also known as Speed Reducer
Golinski.h [code]Header file of Golinski.cpp
Griewangk.cpp [code]Specificacion of the problem Griewangk
Griewangk.h [code]Header file of Griewangk.cpp
Individual.cpp [code]Class representing an individual
Individual.h [code]Header file of Individual.cpp
IntegerGene.cpp [code]Class representing an integer gene
IntegerGene.h [code]Header file of IntegerGene.cpp
K_Distance.cpp [code]Implementation of class K_Distance. Objects of this class calculate the distances and the kth distance in the objective space among the individuals of a population. Due to the first array index in C/C++ is 0, the kth distance is stored in the (k-1)th position in the KDistance_ array
K_Distance.h [code]Header file of K_Distance.cpp
Kita.cpp [code]Especificacion of the problem Kita
Kita.h [code]Header file of Kita.cpp
Kursawe.cpp [code]Especificacion of Kursawe's problem. This problem is renamed MOP4 in Coello et al
Kursawe.h [code]Header file of Kursawe.cpp
MoEA.cpp [code]Abstract class representing Multi-objective Evolutionary Algorithms
MoEA.h [code]Header file of MoEA.cpp
MultiobjectiveProblem.cpp [code]Abstract class representing Multi-objective Optimization Problem (MOP)
MultiobjectiveProblem.h [code]Header file of MultiobjectiveProblem.cpp
Nsga2.cpp [code]This class implements a NSGAII algorithm
Nsga2.h [code]Header file of Nsga2.cpp
Nsga2Seq.cpp [code]This program obtains the pareto front of a multiobjective problem using the NSGAII strategy
OneMax.cpp [code]This problem intends to maximize the number of 1's in a binary string
OneMax.h [code]Header file of OneMax.cpp
OneZeroMax.cpp [code]This problem intends to maximize the number of 1's and the the number of 0's in a set of binary strings
OneZeroMax.h [code]Header file of OneZeroMax.cpp
Osyczka2.cpp [code]Specificacion of Osyczka's problem. This problem is renamed MOP-C2 in Coello et al
Osyczka2.h [code]Header file of Osyczka2.cpp
Poloni.cpp [code]Specificacion of Poloni's problem. This problem is renamed MOP3 in Coello et al
Poloni.h [code]Header file of Poloni.cpp
Population.cpp [code]Class representing a population of individuals
Population.h [code]Header file of Population.cpp
ProblemHeaders.h [code]Contains the headers of the multiobjetive problem classes
Quagliarella.cpp [code]Specificacion of the problem Quagliarella
Quagliarella.h [code]Header file of Quagliarella.cpp
Random.cpp [code]Class represenging random number generator
Random.h [code]Header file of Random.cpp
Ranking.cpp [code]This class makes a ranking of a population using the non-dominated sorting used in NSGA-II
Ranking.h [code]Header file of Ranking.cpp
Rastrigin.cpp [code]Specificacion of the problem Rastrigin
Rastrigin.h [code]Header file of Sphere.cpp
RealGene.cpp [code]Class representing a real gene
RealGene.h [code]Header file of RealGene.cpp
Rosenbrock.cpp [code]Specificacion of the problem Rosenbrock
Rosenbrock.h [code]Header file of Rosebrock.cpp
Schaffer.cpp [code]Specificacion of Schaffer's problem
Schaffer.h [code]Header file of Schaffer.cpp
Schaffer2.cpp [code]Specificacion of the second Schaffer's problem (see pag 457 in [Coello et al, 2002]
Schaffer2.h [code]
Schwefel.cpp [code]Specificacion of the problem Schwefel
Schwefel.h [code]Header file of Schwefel.cpp
Sphere.cpp [code]Specificacion of the problem Sphere
Sphere.h [code]Header file of Sphere.cpp
Srinivas.cpp [code]Specificacion of the problem Srinivas
Srinivas.h [code]Header file of Srinivas.cpp
Ssmo.cpp [code]This class implements a Multi-bjectivE Scatter Search Algorithm
Ssmo.h [code]Header file of Ssmo.cpp
Ssmo1.cpp [code]Class implementing the algorithm SSMOv1
Ssmo1.h [code]Header file of Ssmo1.cpp
Ssmo2.cpp [code]Class implementing the algorithm SSMOv1
Ssmo2.h [code]Header file of Ssmo2.cpp
SsmoSeq.cpp [code]This program obtains the pareto front of a multiobjective problem using a Scatter Search strategy
Tanaka.cpp [code]Specificacion of the problem Tanaka. This problem is renamed MOP-C4 in Coello et al
Tanaka.h [code]Header file of Tanaka.cpp
Viennet2.cpp [code]Specificacion of the problem Viennet(2) This problem is renamed MOP7 in Coello et al
Viennet2.h [code]Header file of Viennet2.cpp
Viennet3.cpp [code]Specificacion of the problem Viennet(3). This problem is renamed MOP4 in Coello et al
Viennet3.h [code]Header file of Viennet.cpp
Viennet4.cpp [code]Specificacion of the problem Viennet(4)
Viennet4.h [code]Header file of Viennet4.cpp
Water.cpp [code]Specificacion of the problem WATER, described in Ray et al, 2001
Water.h [code]Header file of Golinski.cpp
Zdt1.cpp [code]Specificacion of the problem ZDT1. This problem is renamed MOP-G1 in Coello et al. (2002). The problem is defined in Zitzler et at. (2000)
Zdt1.h [code]Header file of Zdt1.cpp
Zdt2.cpp [code]Specificacion of the problem ZDT2. This problem is renamed MOP-G2 in Coello et al. (2002). The problem is defined in Zitzler et at. (2000)
Zdt2.h [code]Header file of Zdt2.cpp
Zdt3.cpp [code]Specificacion of the problem ZDT3. This problem is renamed MOP-G3 in Coello et al. (2002). The problem is defined in Zitzler et at. (2000)
Zdt3.h [code]Header file of Zdt3.cpp
Zdt4.cpp [code]Specificacion of the problem Zdt4. This problem is renamed MOP-G4 in Coello et al. (2002). The problem is defined in Zitzler et at. (2000)
Zdt4.h [code]Header file of Zdt4.cpp
Zdt5.cpp [code]Specificacion of the problem ZDT5. This problem is renamed MOP-G5 in Coello et al. (2002). The problem is defined in Zitzler et at. (2000)
Zdt5.h [code]Header file of Zdt5.cpp
Zdt6.cpp [code]Specificacion of the problem Zdt6. This problem is renamed MOP-G6 in Coello et al. (2002). The problem is defined in Zitzler et at. (2000)
Zdt6.h [code]Header file of Zdt6.cpp