14 #ifndef DIGNEA_ITSPPROBLEM_H
15 #define DIGNEA_ITSPPROBLEM_H
20 #include <dignea/types/SolutionTypes.h>
61 const float &maxL,
const float &minL,
const float e = 5.0,
78 const int &maxSolutions)
const override;
116 string getName()
const override {
return "TSPDomain"; }
159 coords computeCentroid(
const vector<coords> &points);
161 float instanceRadius(
const vector<coords> &points,
const coords ¢roid);
163 float distinctDistances(
const vector<vector<float>> &distances);
Evolutionary TSP Solution. Class which represents the solution for the Instance Generation TSP Proble...
EIG Instance Generation Problem. Abstract Problem for the EIG. This problem will be used as a supercl...
Definition: AbstractDomain.h:28
int numberOfVars
Definition: Problem.h:155
int numberOfObjs
Definition: Problem.h:159
Instance Generator TSP Problem. Problem for the EIG to generate TSP Instances.
Definition: TSPDomain.h:27
TSPInstance createSolution() const override
Creates a single solution (TSP instance)
Definition: TSPDomain.cpp:88
void setLowerLimit(const float &l)
Set the lower limit for the ith dimension.
Definition: TSPDomain.h:134
bool evaluateConstraints(TSPInstance &solution) const override
Not implemented here.
Definition: TSPDomain.h:105
TSPDomain()
Creates a default TSPDomain.
Definition: TSPDomain.cpp:21
float getLowerLimit(const int i) const override
Get the lower limit of the ith dimension (default = 0)
Definition: TSPDomain.cpp:121
int getOptimizationDirection(const int i) const override
Returns the optimization direction for each dimension. Minimize in each case.
Definition: TSPDomain.cpp:147
float getEPS() const
Get the epsilon parameter of the DBSCAN algorithm.
Definition: TSPDomain.h:142
shared_ptr< TSP > genOptProblem(const TSPInstance &instance) const override
Generates a TSP problem with the information in the TSPInstance to be solved in the EIG by the algori...
Definition: TSPDomain.cpp:134
float getUpperLimit(const int i) const override
Get the upper limit of the ith dimension (default = 1000)
Definition: TSPDomain.cpp:112
TSPDomain(const string &pathToInstance)=delete
Not allowed here.
string getName() const override
Get the problem name.
Definition: TSPDomain.h:116
void setMinNeighbors(const int m)
Set the minimum number of neighbors to consider a cluster in the DBSCAN algorithm.
Definition: TSPDomain.h:147
void readData(const string &path) override
Not implemented here.
Definition: TSPDomain.h:156
vector< TSPInstance > createSolutions(const int &maxSolutions) const override
Creates a vector of initial instances (ITSPSolutions) for the EIG.
Definition: TSPDomain.cpp:70
int getMinNeighbors() const
Get the minimum number of neighbors to consider a cluster in the DBSCAN algorithm.
Definition: TSPDomain.h:152
void beforeEvaluation(vector< TSPInstance > &) override
Performs problem dependent operations before evaluating the instances in the EIG.
Definition: TSPDomain.h:83
void evaluate(TSPInstance &solution) const override
Not implemented.
Definition: TSPDomain.h:72
void setEPS(const float e)
Set the epsilon parameter for the DBSCAN algorithm.
Definition: TSPDomain.h:138
void setUpperLimit(const float &l)
Set the upper limit for the ith dimension.
Definition: TSPDomain.h:130
void afterEvaluation(vector< TSPInstance > &) override
Performs problem dependent operatiions after evaluating the instances in the EIG. Computes the featur...
Definition: TSPDomain.cpp:227
Instance Traveling Salesman Problem Solution. Class which represents the solution for the Instance Tr...
Definition: TSPInstance.h:33