dignea  1.0.0
Diverse Instance Generator with Novelty Search and Evolutionary Algorithms
tsp_heuristics::Greedy Member List

This is the complete list of members for tsp_heuristics::Greedy, including all inherited members.

AbstractEA()AbstractEA< S >
AbstractEA(const int &maxEvals, const int &popsize)AbstractEA< S >
AbstractEA(unique_ptr< PopulationEvaluator< S >>, const int &maxEvals, const int &popsize)AbstractEA< S >
avgEvolution (defined in AbstractEA< S >)AbstractEA< S >protected
createInitialPopulation()Heuristic< IntFloatSolution >inlineprotectedvirtual
DEFAULT_EVALUATIONS_LIMITAbstractEA< S >static
DEFAULT_POPULATION_SIZEAbstractEA< S >static
ELAPSED_TIME (defined in AbstractEA< S >)AbstractEA< S >static
elapsedTime (defined in AbstractEA< S >)AbstractEA< S >protected
endTime (defined in AbstractEA< S >)AbstractEA< S >protected
evaluatePopulation(vector< IntFloatSolution > &)Heuristic< IntFloatSolution >inlineprotectedvirtual
AbstractEA::evaluatePopulation(vector< S > &pop)=0AbstractEA< S >protectedpure virtual
evaluator (defined in AbstractEA< S >)AbstractEA< S >protected
EVALUATOR (defined in AbstractEA< S >)AbstractEA< S >static
evolution (defined in AbstractEA< S >)AbstractEA< S >protected
EVOLUTION_SIZE (defined in AbstractEA< S >)AbstractEA< S >static
evolutionInterval (defined in AbstractEA< S >)AbstractEA< S >protected
finishProgress() overrideHeuristic< IntFloatSolution >protectedvirtual
getElapsedTime() constAbstractEA< S >inline
getEvaluator() constAbstractEA< S >inline
getEvolution() constAbstractEA< S >virtual
getID() consttsp_heuristics::Greedyinlinevirtual
getMaxEvaluations() constAbstractEA< S >inline
getName() consttsp_heuristics::Greedyinlinevirtual
getPerformedEvaluations() constAbstractEA< S >inline
getPopulation() constAbstractEA< S >inline
getPopulationSize() constAbstractEA< S >inline
getPrintingInterval() constAbstractEA< S >inline
getProblem() constAbstractEA< S >inline
getResults() const overridetsp_heuristics::Greedyvirtual
Greedy() (defined in tsp_heuristics::Greedy)tsp_heuristics::Greedy
Heuristic()=default (defined in Heuristic< IntFloatSolution >)Heuristic< IntFloatSolution >
initProgress()Heuristic< IntFloatSolution >inlineprotectedvirtual
isStoppingConditionReached() overrideHeuristic< IntFloatSolution >inlineprotectedvirtual
MAX_EVALUATIONS (defined in AbstractEA< S >)AbstractEA< S >static
maxEvaluationsAbstractEA< S >protected
NAME (defined in AbstractEA< S >)AbstractEA< S >static
nextCheckpoint (defined in AbstractEA< S >)AbstractEA< S >protected
performedEvaluations (defined in AbstractEA< S >)AbstractEA< S >protected
POP_SIZE (defined in AbstractEA< S >)AbstractEA< S >static
population (defined in AbstractEA< S >)AbstractEA< S >protected
populationSizeAbstractEA< S >protected
problem (defined in AbstractEA< S >)AbstractEA< S >protected
run() overridetsp_heuristics::Greedyvirtual
setEvaluator(unique_ptr< PopulationEvaluator< S >> eval)AbstractEA< S >inline
setMaxEvaluations(int maxEval)AbstractEA< S >inline
setPerformedEvaluations(int pEvals)AbstractEA< S >inline
setPopulation(const vector< S > &pop)AbstractEA< S >
setPopulationSize(int pSize)AbstractEA< S >
setProblem(shared_ptr< TSP > prob) (defined in tsp_heuristics::Greedy)tsp_heuristics::Greedy
setProblem(TSP *prob) (defined in tsp_heuristics::Greedy)tsp_heuristics::Greedy
Heuristic< IntFloatSolution >::setProblem(shared_ptr< Problem< S >> prob)AbstractEA< S >inlinevirtual
Heuristic< IntFloatSolution >::setProblem(Problem< S > *prob)AbstractEA< S >inlinevirtual
startTime (defined in AbstractEA< S >)AbstractEA< S >protected
to_json() constHeuristic< IntFloatSolution >virtual
updateEvolution(vector< IntFloatSolution > &)Heuristic< IntFloatSolution >inlineprotectedvirtual
updateEvolution(const int &checkpoint, vector< IntFloatSolution > &)Heuristic< IntFloatSolution >inlineprotectedvirtual
AbstractEA::updateEvolution(vector< S > &pop)AbstractEA< S >protectedvirtual
AbstractEA::updateEvolution(const int &checkpoint, vector< S > &)AbstractEA< S >protectedvirtual
updateProgress()Heuristic< IntFloatSolution >inlineprotectedvirtual
~AbstractEA() (defined in AbstractEA< S >)AbstractEA< S >virtual
~Greedy()=default (defined in tsp_heuristics::Greedy)tsp_heuristics::Greedyvirtual
~Heuristic()=default (defined in Heuristic< IntFloatSolution >)Heuristic< IntFloatSolution >virtual