36 #ifndef SHARK_ALGORITHMS_DIRECT_SEARCH_OPERATORS_EVALUATION_PENALIZING_EVALUATOR_H 37 #define SHARK_ALGORITHMS_DIRECT_SEARCH_OPERATORS_EVALUATION_PENALIZING_EVALUATOR_H 66 template<
typename Function,
typename Indiv
idualType>
75 typename Function::SearchPointType t( individual.
searchPoint() );
76 f.closestFeasible( t );
91 template<
typename Function,
typename Iterator>
92 void operator()( Function
const& f, Iterator begin, Iterator end )
const {
93 for(Iterator pos = begin; pos != end; ++pos){
98 template<
class SearchPo
intType>
99 void penalize(SearchPointType
const& s, SearchPointType
const& t,
double& fitness)
const{
103 template<
class SearchPo
intType>
104 void penalize(SearchPointType
const& s, SearchPointType
const& t, RealVector& fitness)
const{
114 template<
typename Archive>
115 void serialize( Archive & archive,
const unsigned int version ) {