#include <ElitistCMA.h>

Public Member Functions | |
| CMAElitistSearch () | |
| ~CMAElitistSearch () | |
| const PopulationCT < ChromosomeCMA > * | parents () const |
| const PopulationCT < ChromosomeCMA > * | offspring () const |
| void | init (ObjectiveFunctionVS< double > &fitness, unsigned int lambda=1) |
| void | init (ObjectiveFunctionVS< double > &fitness, const Array< double > &start, double stepsize, unsigned int lambda=1) |
| void | run () |
| main interface: perform one iteration of the search algorithm | |
| void | bestSolutions (std::vector< double * > &points) |
| void | bestSolutionsFitness (Array< double > &fitness) |
| Return a two-dimensional array of fitness values. | |
Protected Attributes | |
| ObjectiveFunctionVS< double > * | m_fitness |
| PopulationCT< ChromosomeCMA > * | m_parents |
| PopulationCT< ChromosomeCMA > * | m_offspring |
| bool | m_bIsParentFitnessValid |
Definition at line 96 of file ElitistCMA.h.
| CMAElitistSearch::CMAElitistSearch | ( | ) |
Definition at line 101 of file ElitistCMA.cpp.
References SearchAlgorithmBase::m_name, m_offspring, and m_parents.
| CMAElitistSearch::~CMAElitistSearch | ( | ) |
| void CMAElitistSearch::bestSolutions | ( | std::vector< double * > & | points | ) |
Definition at line 209 of file ElitistCMA.cpp.
| void CMAElitistSearch::bestSolutionsFitness | ( | Array< double > & | fitness | ) | [virtual] |
Return a two-dimensional array of fitness values.
The first dimension corresponds to the solution, while the second dimension corresponds to the objective.
Implements SearchAlgorithm< T >.
Definition at line 215 of file ElitistCMA.cpp.
| void CMAElitistSearch::init | ( | ObjectiveFunctionVS< double > & | fitness, | |
| const Array< double > & | start, | |||
| double | stepsize, | |||
| unsigned int | lambda = 1 | |||
| ) |
Definition at line 155 of file ElitistCMA.cpp.
References ObjectiveFunctionVS< T >::dimension(), ChromosomeCMA::init(), m_bIsParentFitnessValid, m_fitness, EvolutionaryAlgorithm< double * >::m_lambda, EvolutionaryAlgorithm< double * >::m_mu, m_offspring, m_parents, and Population::setMinimize().
| void CMAElitistSearch::init | ( | ObjectiveFunctionVS< double > & | fitness, | |
| unsigned int | lambda = 1 | |||
| ) |
Definition at line 116 of file ElitistCMA.cpp.
References ObjectiveFunctionVS< T >::dimension(), m_bIsParentFitnessValid, m_fitness, EvolutionaryAlgorithm< double * >::m_lambda, EvolutionaryAlgorithm< double * >::m_mu, m_offspring, m_parents, ObjectiveFunctionVS< T >::ProposeStartingPoint(), and Population::setMinimize().
| const PopulationCT<ChromosomeCMA>* CMAElitistSearch::offspring | ( | ) | const [inline] |
| const PopulationCT<ChromosomeCMA>* CMAElitistSearch::parents | ( | ) | const [inline] |
| void CMAElitistSearch::run | ( | ) | [virtual] |
main interface: perform one iteration of the search algorithm
Reimplemented from SearchAlgorithm< T >.
Definition at line 178 of file ElitistCMA.cpp.
References Individual::getFitness(), m_bIsParentFitnessValid, m_fitness, EvolutionaryAlgorithm< double * >::m_lambda, m_offspring, m_parents, and Individual::setFitness().
bool CMAElitistSearch::m_bIsParentFitnessValid [protected] |
ObjectiveFunctionVS<double>* CMAElitistSearch::m_fitness [protected] |
PopulationCT<ChromosomeCMA>* CMAElitistSearch::m_offspring [protected] |
Definition at line 114 of file ElitistCMA.h.
Referenced by CMAElitistSearch(), init(), offspring(), run(), and ~CMAElitistSearch().
PopulationCT<ChromosomeCMA>* CMAElitistSearch::m_parents [protected] |
Definition at line 113 of file ElitistCMA.h.
Referenced by CMAElitistSearch(), init(), parents(), run(), and ~CMAElitistSearch().